./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-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 5990b1cf211e12a23ca85722a0e539783495fb8504bce43e0d5e789fe089f178 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:53:06,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:53:06,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:53:06,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:53:06,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:53:07,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:53:07,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:53:07,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:53:07,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:53:07,032 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:53:07,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:53:07,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:53:07,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:53:07,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:53:07,033 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:53:07,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:53:07,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:53:07,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:53:07,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:53:07,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:53:07,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:53:07,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:53:07,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:53:07,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:53:07,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:53:07,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:53:07,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:53:07,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:53:07,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:53:07,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:53:07,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:53:07,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:53:07,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:53:07,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:53:07,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:53:07,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:53:07,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:53:07,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:53:07,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:53:07,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:53:07,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:53:07,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:53:07,048 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 -> 5990b1cf211e12a23ca85722a0e539783495fb8504bce43e0d5e789fe089f178 [2024-11-19 22:53:07,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:53:07,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:53:07,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:53:07,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:53:07,366 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:53:07,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2024-11-19 22:53:08,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:53:09,140 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:53:09,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2024-11-19 22:53:09,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4994289/28abda08e8884d0caa8003e0d4f75ef9/FLAG10f3b7d07 [2024-11-19 22:53:09,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4994289/28abda08e8884d0caa8003e0d4f75ef9 [2024-11-19 22:53:09,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:53:09,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:53:09,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:53:09,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:53:09,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:53:09,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:53:09" (1/1) ... [2024-11-19 22:53:09,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ee18b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:09, skipping insertion in model container [2024-11-19 22:53:09,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:53:09" (1/1) ... [2024-11-19 22:53:09,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:53:09,589 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.BOUNDED-8.pals.c.v+sep-reducer.c[18815,18828] [2024-11-19 22:53:09,626 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.BOUNDED-8.pals.c.v+sep-reducer.c[25895,25908] [2024-11-19 22:53:09,639 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.BOUNDED-8.pals.c.v+sep-reducer.c[29420,29433] [2024-11-19 22:53:09,649 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.BOUNDED-8.pals.c.v+sep-reducer.c[32798,32811] [2024-11-19 22:53:09,665 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.BOUNDED-8.pals.c.v+sep-reducer.c[36856,36869] [2024-11-19 22:53:09,675 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.BOUNDED-8.pals.c.v+sep-reducer.c[40310,40323] [2024-11-19 22:53:09,689 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.BOUNDED-8.pals.c.v+sep-reducer.c[43875,43888] [2024-11-19 22:53:09,701 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.BOUNDED-8.pals.c.v+sep-reducer.c[47290,47303] [2024-11-19 22:53:09,719 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.BOUNDED-8.pals.c.v+sep-reducer.c[50969,50982] [2024-11-19 22:53:09,734 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.BOUNDED-8.pals.c.v+sep-reducer.c[54551,54564] [2024-11-19 22:53:09,751 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.BOUNDED-8.pals.c.v+sep-reducer.c[58080,58093] [2024-11-19 22:53:09,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:53:09,803 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:53:09,851 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.BOUNDED-8.pals.c.v+sep-reducer.c[18815,18828] [2024-11-19 22:53:09,878 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.BOUNDED-8.pals.c.v+sep-reducer.c[25895,25908] [2024-11-19 22:53:09,892 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.BOUNDED-8.pals.c.v+sep-reducer.c[29420,29433] [2024-11-19 22:53:09,904 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.BOUNDED-8.pals.c.v+sep-reducer.c[32798,32811] [2024-11-19 22:53:09,921 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.BOUNDED-8.pals.c.v+sep-reducer.c[36856,36869] [2024-11-19 22:53:09,932 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.BOUNDED-8.pals.c.v+sep-reducer.c[40310,40323] [2024-11-19 22:53:09,942 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.BOUNDED-8.pals.c.v+sep-reducer.c[43875,43888] [2024-11-19 22:53:09,951 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.BOUNDED-8.pals.c.v+sep-reducer.c[47290,47303] [2024-11-19 22:53:09,965 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.BOUNDED-8.pals.c.v+sep-reducer.c[50969,50982] [2024-11-19 22:53:09,982 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.BOUNDED-8.pals.c.v+sep-reducer.c[54551,54564] [2024-11-19 22:53:09,992 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.BOUNDED-8.pals.c.v+sep-reducer.c[58080,58093] [2024-11-19 22:53:10,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:53:10,042 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:53:10,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10 WrapperNode [2024-11-19 22:53:10,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:53:10,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:53:10,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:53:10,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:53:10,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,196 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2962 [2024-11-19 22:53:10,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:53:10,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:53:10,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:53:10,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:53:10,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,260 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-19 22:53:10,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:53:10,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:53:10,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:53:10,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:53:10,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (1/1) ... [2024-11-19 22:53:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:53:10,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:53:10,390 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-19 22:53:10,393 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-19 22:53:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:53:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:53:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:53:10,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:53:10,748 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:53:10,751 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:53:12,363 INFO L? ?]: Removed 576 outVars from TransFormulas that were not future-live. [2024-11-19 22:53:12,363 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:53:12,400 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:53:12,400 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:53:12,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:53:12 BoogieIcfgContainer [2024-11-19 22:53:12,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:53:12,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:53:12,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:53:12,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:53:12,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:53:09" (1/3) ... [2024-11-19 22:53:12,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce8aa8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:53:12, skipping insertion in model container [2024-11-19 22:53:12,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:10" (2/3) ... [2024-11-19 22:53:12,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce8aa8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:53:12, skipping insertion in model container [2024-11-19 22:53:12,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:53:12" (3/3) ... [2024-11-19 22:53:12,413 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2024-11-19 22:53:12,431 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:53:12,431 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-19 22:53:12,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:53:12,534 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;@71465ab3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:53:12,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-19 22:53:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 570 states, 558 states have (on average 1.7831541218637992) internal successors, (995), 569 states have internal predecessors, (995), 0 states have call successors, (0), 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-19 22:53:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 22:53:12,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:12,564 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-19 22:53:12,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:12,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:12,571 INFO L85 PathProgramCache]: Analyzing trace with hash 646480323, now seen corresponding path program 1 times [2024-11-19 22:53:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:12,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076284518] [2024-11-19 22:53:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:12,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:13,225 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-19 22:53:13,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:13,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076284518] [2024-11-19 22:53:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076284518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:13,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:13,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:53:13,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912209113] [2024-11-19 22:53:13,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:13,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:53:13,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:13,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:53:13,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:53:13,261 INFO L87 Difference]: Start difference. First operand has 570 states, 558 states have (on average 1.7831541218637992) internal successors, (995), 569 states have internal predecessors, (995), 0 states have call successors, (0), 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 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-19 22:53:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:13,817 INFO L93 Difference]: Finished difference Result 785 states and 1334 transitions. [2024-11-19 22:53:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:53:13,820 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-19 22:53:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:13,837 INFO L225 Difference]: With dead ends: 785 [2024-11-19 22:53:13,838 INFO L226 Difference]: Without dead ends: 503 [2024-11-19 22:53:13,842 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-19 22:53:13,846 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 2434 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:13,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2434 Valid, 551 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:53:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-19 22:53:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2024-11-19 22:53:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 492 states have (on average 1.274390243902439) internal successors, (627), 502 states have internal predecessors, (627), 0 states have call successors, (0), 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-19 22:53:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 627 transitions. [2024-11-19 22:53:13,921 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 627 transitions. Word has length 60 [2024-11-19 22:53:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:13,922 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 627 transitions. [2024-11-19 22:53:13,923 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-19 22:53:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 627 transitions. [2024-11-19 22:53:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 22:53:13,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:13,930 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-19 22:53:13,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:53:13,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:13,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:13,931 INFO L85 PathProgramCache]: Analyzing trace with hash 221242932, now seen corresponding path program 1 times [2024-11-19 22:53:13,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:13,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065017692] [2024-11-19 22:53:13,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:13,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:14,135 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-19 22:53:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065017692] [2024-11-19 22:53:14,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065017692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:14,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:14,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:53:14,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910088901] [2024-11-19 22:53:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:14,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:53:14,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:14,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:53:14,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:53:14,140 INFO L87 Difference]: Start difference. First operand 503 states and 627 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-19 22:53:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:14,431 INFO L93 Difference]: Finished difference Result 637 states and 796 transitions. [2024-11-19 22:53:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:53:14,433 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-19 22:53:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:14,435 INFO L225 Difference]: With dead ends: 637 [2024-11-19 22:53:14,437 INFO L226 Difference]: Without dead ends: 381 [2024-11-19 22:53:14,439 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-19 22:53:14,440 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1376 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:14,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 266 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-19 22:53:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-19 22:53:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 380 states have internal predecessors, (476), 0 states have call successors, (0), 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-19 22:53:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 476 transitions. [2024-11-19 22:53:14,460 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 476 transitions. Word has length 60 [2024-11-19 22:53:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:14,461 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 476 transitions. [2024-11-19 22:53:14,461 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-19 22:53:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2024-11-19 22:53:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 22:53:14,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:14,464 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-19 22:53:14,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:53:14,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:14,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2147344789, now seen corresponding path program 1 times [2024-11-19 22:53:14,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58287735] [2024-11-19 22:53:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:14,637 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-19 22:53:14,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:14,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58287735] [2024-11-19 22:53:14,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58287735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:14,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:14,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:53:14,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374027515] [2024-11-19 22:53:14,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:14,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:53:14,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:14,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:53:14,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:53:14,641 INFO L87 Difference]: Start difference. First operand 381 states and 476 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-19 22:53:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:14,859 INFO L93 Difference]: Finished difference Result 539 states and 682 transitions. [2024-11-19 22:53:14,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:53:14,859 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-19 22:53:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:14,861 INFO L225 Difference]: With dead ends: 539 [2024-11-19 22:53:14,862 INFO L226 Difference]: Without dead ends: 335 [2024-11-19 22:53:14,862 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-19 22:53:14,864 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 1224 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:14,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 240 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-19 22:53:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2024-11-19 22:53:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 324 states have (on average 1.2993827160493827) internal successors, (421), 334 states have internal predecessors, (421), 0 states have call successors, (0), 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-19 22:53:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 421 transitions. [2024-11-19 22:53:14,879 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 421 transitions. Word has length 60 [2024-11-19 22:53:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:14,880 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 421 transitions. [2024-11-19 22:53:14,880 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-19 22:53:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 421 transitions. [2024-11-19 22:53:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 22:53:14,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:14,881 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-19 22:53:14,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:53:14,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:14,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash 604643521, now seen corresponding path program 1 times [2024-11-19 22:53:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080890033] [2024-11-19 22:53:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:15,093 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-19 22:53:15,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:15,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080890033] [2024-11-19 22:53:15,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080890033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:15,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:15,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:53:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765999503] [2024-11-19 22:53:15,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:15,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:53:15,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:15,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:53:15,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:53:15,099 INFO L87 Difference]: Start difference. First operand 335 states and 421 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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-19 22:53:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:15,289 INFO L93 Difference]: Finished difference Result 433 states and 540 transitions. [2024-11-19 22:53:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:53:15,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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-19 22:53:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:15,290 INFO L225 Difference]: With dead ends: 433 [2024-11-19 22:53:15,291 INFO L226 Difference]: Without dead ends: 261 [2024-11-19 22:53:15,291 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-19 22:53:15,292 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 909 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:15,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 209 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-19 22:53:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-11-19 22:53:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.296) internal successors, (324), 260 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-19 22:53:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 324 transitions. [2024-11-19 22:53:15,298 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 324 transitions. Word has length 62 [2024-11-19 22:53:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:15,299 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 324 transitions. [2024-11-19 22:53:15,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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-19 22:53:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 324 transitions. [2024-11-19 22:53:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 22:53:15,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:15,300 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-19 22:53:15,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:53:15,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:15,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash -699288056, now seen corresponding path program 1 times [2024-11-19 22:53:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:15,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561940653] [2024-11-19 22:53:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:15,810 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-19 22:53:15,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:15,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561940653] [2024-11-19 22:53:15,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561940653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:15,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:15,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:15,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297086746] [2024-11-19 22:53:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:15,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:15,813 INFO L87 Difference]: Start difference. First operand 261 states and 324 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-19 22:53:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:16,384 INFO L93 Difference]: Finished difference Result 497 states and 634 transitions. [2024-11-19 22:53:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:53:16,385 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-19 22:53:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:16,387 INFO L225 Difference]: With dead ends: 497 [2024-11-19 22:53:16,387 INFO L226 Difference]: Without dead ends: 405 [2024-11-19 22:53:16,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:53:16,388 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1490 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:16,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1073 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:53:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-19 22:53:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 261. [2024-11-19 22:53:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.292) internal successors, (323), 260 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 323 transitions. [2024-11-19 22:53:16,394 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 323 transitions. Word has length 64 [2024-11-19 22:53:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:16,395 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 323 transitions. [2024-11-19 22:53:16,395 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-19 22:53:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 323 transitions. [2024-11-19 22:53:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 22:53:16,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:16,396 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-19 22:53:16,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:53:16,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:16,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1796013608, now seen corresponding path program 1 times [2024-11-19 22:53:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980411416] [2024-11-19 22:53:16,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:16,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:16,673 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-19 22:53:16,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:16,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980411416] [2024-11-19 22:53:16,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980411416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:16,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:16,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590193650] [2024-11-19 22:53:16,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:16,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:16,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:16,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:16,675 INFO L87 Difference]: Start difference. First operand 261 states and 323 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-19 22:53:17,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:17,163 INFO L93 Difference]: Finished difference Result 399 states and 492 transitions. [2024-11-19 22:53:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:53:17,164 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-19 22:53:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:17,166 INFO L225 Difference]: With dead ends: 399 [2024-11-19 22:53:17,166 INFO L226 Difference]: Without dead ends: 393 [2024-11-19 22:53:17,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:53:17,167 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 865 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:17,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 800 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:53:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-19 22:53:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 261. [2024-11-19 22:53:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.288) internal successors, (322), 260 states have internal predecessors, (322), 0 states have call successors, (0), 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-19 22:53:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 322 transitions. [2024-11-19 22:53:17,173 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 322 transitions. Word has length 64 [2024-11-19 22:53:17,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:17,173 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 322 transitions. [2024-11-19 22:53:17,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-19 22:53:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 322 transitions. [2024-11-19 22:53:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 22:53:17,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:17,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-19 22:53:17,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:53:17,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:17,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:17,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1577721816, now seen corresponding path program 1 times [2024-11-19 22:53:17,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:17,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605468280] [2024-11-19 22:53:17,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:17,496 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-19 22:53:17,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:17,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605468280] [2024-11-19 22:53:17,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605468280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:17,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:17,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:53:17,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856204839] [2024-11-19 22:53:17,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:17,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:53:17,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:17,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:53:17,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:53:17,499 INFO L87 Difference]: Start difference. First operand 261 states and 322 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 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-19 22:53:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:17,909 INFO L93 Difference]: Finished difference Result 516 states and 638 transitions. [2024-11-19 22:53:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:53:17,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 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-19 22:53:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:17,911 INFO L225 Difference]: With dead ends: 516 [2024-11-19 22:53:17,911 INFO L226 Difference]: Without dead ends: 375 [2024-11-19 22:53:17,911 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-19 22:53:17,912 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 1333 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 837 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.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:17,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 837 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:53:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-19 22:53:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 261. [2024-11-19 22:53:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.284) internal successors, (321), 260 states have internal predecessors, (321), 0 states have call successors, (0), 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-19 22:53:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 321 transitions. [2024-11-19 22:53:17,922 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 321 transitions. Word has length 64 [2024-11-19 22:53:17,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:17,922 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 321 transitions. [2024-11-19 22:53:17,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 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-19 22:53:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 321 transitions. [2024-11-19 22:53:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 22:53:17,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:17,923 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] [2024-11-19 22:53:17,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:53:17,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:17,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:17,924 INFO L85 PathProgramCache]: Analyzing trace with hash -295025225, now seen corresponding path program 1 times [2024-11-19 22:53:17,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:17,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334061619] [2024-11-19 22:53:17,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:17,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:18,225 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-19 22:53:18,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:18,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334061619] [2024-11-19 22:53:18,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334061619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:18,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:18,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:18,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332533128] [2024-11-19 22:53:18,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:18,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:18,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:18,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:18,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:18,229 INFO L87 Difference]: Start difference. First operand 261 states and 321 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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-19 22:53:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:18,707 INFO L93 Difference]: Finished difference Result 450 states and 566 transitions. [2024-11-19 22:53:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:53:18,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-19 22:53:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:18,709 INFO L225 Difference]: With dead ends: 450 [2024-11-19 22:53:18,709 INFO L226 Difference]: Without dead ends: 393 [2024-11-19 22:53:18,710 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-19 22:53:18,711 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1802 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:18,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1802 Valid, 803 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:53:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-19 22:53:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 261. [2024-11-19 22:53:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.28) internal successors, (320), 260 states have internal predecessors, (320), 0 states have call successors, (0), 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-19 22:53:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 320 transitions. [2024-11-19 22:53:18,716 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 320 transitions. Word has length 65 [2024-11-19 22:53:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:18,717 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 320 transitions. [2024-11-19 22:53:18,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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-19 22:53:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 320 transitions. [2024-11-19 22:53:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 22:53:18,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:18,718 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] [2024-11-19 22:53:18,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:53:18,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:18,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash -535072361, now seen corresponding path program 1 times [2024-11-19 22:53:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:18,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352979755] [2024-11-19 22:53:18,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:18,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:19,004 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-19 22:53:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:19,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352979755] [2024-11-19 22:53:19,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352979755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:19,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:19,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:19,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114076370] [2024-11-19 22:53:19,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:19,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:19,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:19,007 INFO L87 Difference]: Start difference. First operand 261 states and 320 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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-19 22:53:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:19,484 INFO L93 Difference]: Finished difference Result 469 states and 594 transitions. [2024-11-19 22:53:19,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:53:19,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-19 22:53:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:19,487 INFO L225 Difference]: With dead ends: 469 [2024-11-19 22:53:19,487 INFO L226 Difference]: Without dead ends: 401 [2024-11-19 22:53:19,488 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-19 22:53:19,488 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 1113 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:19,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1072 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:53:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-19 22:53:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 261. [2024-11-19 22:53:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.276) internal successors, (319), 260 states have internal predecessors, (319), 0 states have call successors, (0), 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-19 22:53:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 319 transitions. [2024-11-19 22:53:19,495 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 319 transitions. Word has length 65 [2024-11-19 22:53:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:19,495 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 319 transitions. [2024-11-19 22:53:19,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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-19 22:53:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 319 transitions. [2024-11-19 22:53:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 22:53:19,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:19,496 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-19 22:53:19,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:53:19,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:19,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash -168692467, now seen corresponding path program 1 times [2024-11-19 22:53:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:19,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930940659] [2024-11-19 22:53:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:19,853 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-19 22:53:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:19,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930940659] [2024-11-19 22:53:19,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930940659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:19,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:19,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287110289] [2024-11-19 22:53:19,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:19,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:19,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:19,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:19,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:19,856 INFO L87 Difference]: Start difference. First operand 261 states and 319 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:20,350 INFO L93 Difference]: Finished difference Result 420 states and 519 transitions. [2024-11-19 22:53:20,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:53:20,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:20,352 INFO L225 Difference]: With dead ends: 420 [2024-11-19 22:53:20,352 INFO L226 Difference]: Without dead ends: 401 [2024-11-19 22:53:20,353 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-19 22:53:20,353 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 1682 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:20,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 953 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:53:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-19 22:53:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 261. [2024-11-19 22:53:20,358 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-19 22:53:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 318 transitions. [2024-11-19 22:53:20,359 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 318 transitions. Word has length 66 [2024-11-19 22:53:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:20,359 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 318 transitions. [2024-11-19 22:53:20,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 318 transitions. [2024-11-19 22:53:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 22:53:20,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:20,360 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-19 22:53:20,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:53:20,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:20,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1424145869, now seen corresponding path program 1 times [2024-11-19 22:53:20,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:20,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524896294] [2024-11-19 22:53:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:20,635 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-19 22:53:20,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:20,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524896294] [2024-11-19 22:53:20,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524896294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:20,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831707762] [2024-11-19 22:53:20,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:20,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:20,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:20,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:20,638 INFO L87 Difference]: Start difference. First operand 261 states and 318 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:21,117 INFO L93 Difference]: Finished difference Result 399 states and 486 transitions. [2024-11-19 22:53:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:53:21,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:21,119 INFO L225 Difference]: With dead ends: 399 [2024-11-19 22:53:21,119 INFO L226 Difference]: Without dead ends: 393 [2024-11-19 22:53:21,119 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-19 22:53:21,133 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1677 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:21,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 897 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:53:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-19 22:53:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 261. [2024-11-19 22:53:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.268) internal successors, (317), 260 states have internal predecessors, (317), 0 states have call successors, (0), 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-19 22:53:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 317 transitions. [2024-11-19 22:53:21,140 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 317 transitions. Word has length 66 [2024-11-19 22:53:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:21,141 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 317 transitions. [2024-11-19 22:53:21,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 317 transitions. [2024-11-19 22:53:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 22:53:21,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:21,145 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-19 22:53:21,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:53:21,145 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:21,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:21,146 INFO L85 PathProgramCache]: Analyzing trace with hash -155488627, now seen corresponding path program 1 times [2024-11-19 22:53:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:21,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084499504] [2024-11-19 22:53:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:21,606 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-19 22:53:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084499504] [2024-11-19 22:53:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084499504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:21,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:21,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:53:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624046986] [2024-11-19 22:53:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:21,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:53:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:21,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:53:21,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:53:21,609 INFO L87 Difference]: Start difference. First operand 261 states and 317 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 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-19 22:53:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:22,360 INFO L93 Difference]: Finished difference Result 557 states and 708 transitions. [2024-11-19 22:53:22,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 22:53:22,361 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 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-19 22:53:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:22,363 INFO L225 Difference]: With dead ends: 557 [2024-11-19 22:53:22,363 INFO L226 Difference]: Without dead ends: 459 [2024-11-19 22:53:22,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2024-11-19 22:53:22,364 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1665 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:22,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 1669 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:53:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-19 22:53:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 261. [2024-11-19 22:53:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.264) internal successors, (316), 260 states have internal predecessors, (316), 0 states have call successors, (0), 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-19 22:53:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 316 transitions. [2024-11-19 22:53:22,372 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 316 transitions. Word has length 66 [2024-11-19 22:53:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:22,373 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 316 transitions. [2024-11-19 22:53:22,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 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-19 22:53:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 316 transitions. [2024-11-19 22:53:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 22:53:22,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:22,374 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-19 22:53:22,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 22:53:22,374 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:22,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash -131812051, now seen corresponding path program 1 times [2024-11-19 22:53:22,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:22,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867691657] [2024-11-19 22:53:22,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:22,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:22,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-19 22:53:22,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867691657] [2024-11-19 22:53:22,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867691657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:22,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:22,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:22,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288583810] [2024-11-19 22:53:22,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:22,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:22,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:22,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:22,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:22,625 INFO L87 Difference]: Start difference. First operand 261 states and 316 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:23,109 INFO L93 Difference]: Finished difference Result 453 states and 564 transitions. [2024-11-19 22:53:23,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:53:23,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:23,111 INFO L225 Difference]: With dead ends: 453 [2024-11-19 22:53:23,111 INFO L226 Difference]: Without dead ends: 393 [2024-11-19 22:53:23,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:53:23,112 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1668 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:23,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 897 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:53:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-19 22:53:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 261. [2024-11-19 22:53:23,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.26) internal successors, (315), 260 states have internal predecessors, (315), 0 states have call successors, (0), 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-19 22:53:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 315 transitions. [2024-11-19 22:53:23,120 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 315 transitions. Word has length 66 [2024-11-19 22:53:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:23,120 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 315 transitions. [2024-11-19 22:53:23,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 315 transitions. [2024-11-19 22:53:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 22:53:23,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:23,121 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-19 22:53:23,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 22:53:23,122 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:23,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2058619373, now seen corresponding path program 1 times [2024-11-19 22:53:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708694800] [2024-11-19 22:53:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:23,361 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-19 22:53:23,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:23,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708694800] [2024-11-19 22:53:23,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708694800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:23,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:23,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:23,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163906651] [2024-11-19 22:53:23,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:23,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:23,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:23,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:23,363 INFO L87 Difference]: Start difference. First operand 261 states and 315 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:23,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:23,851 INFO L93 Difference]: Finished difference Result 474 states and 594 transitions. [2024-11-19 22:53:23,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:53:23,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:23,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:23,854 INFO L225 Difference]: With dead ends: 474 [2024-11-19 22:53:23,854 INFO L226 Difference]: Without dead ends: 401 [2024-11-19 22:53:23,854 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-19 22:53:23,855 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1321 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:23,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 1083 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:53:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-19 22:53:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 261. [2024-11-19 22:53:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.256) internal successors, (314), 260 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-19 22:53:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 314 transitions. [2024-11-19 22:53:23,861 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 314 transitions. Word has length 66 [2024-11-19 22:53:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:23,861 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 314 transitions. [2024-11-19 22:53:23,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 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-19 22:53:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 314 transitions. [2024-11-19 22:53:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:53:23,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:23,862 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-19 22:53:23,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 22:53:23,862 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:23,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash 817551922, now seen corresponding path program 1 times [2024-11-19 22:53:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:23,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983881606] [2024-11-19 22:53:23,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:24,410 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-19 22:53:24,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:24,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983881606] [2024-11-19 22:53:24,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983881606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:24,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:24,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:53:24,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673295128] [2024-11-19 22:53:24,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:24,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:53:24,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:24,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:53:24,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:53:24,412 INFO L87 Difference]: Start difference. First operand 261 states and 314 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-19 22:53:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:24,942 INFO L93 Difference]: Finished difference Result 421 states and 533 transitions. [2024-11-19 22:53:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:53:24,943 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-19 22:53:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:24,944 INFO L225 Difference]: With dead ends: 421 [2024-11-19 22:53:24,944 INFO L226 Difference]: Without dead ends: 331 [2024-11-19 22:53:24,944 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-19 22:53:24,945 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1209 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:24,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 1748 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-19 22:53:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 225. [2024-11-19 22:53:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 224 states have internal predecessors, (273), 0 states have call successors, (0), 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-19 22:53:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 273 transitions. [2024-11-19 22:53:24,949 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 273 transitions. Word has length 67 [2024-11-19 22:53:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:24,950 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 273 transitions. [2024-11-19 22:53:24,950 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-19 22:53:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 273 transitions. [2024-11-19 22:53:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:53:24,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:24,951 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-19 22:53:24,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 22:53:24,951 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:24,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:24,951 INFO L85 PathProgramCache]: Analyzing trace with hash 167509874, now seen corresponding path program 1 times [2024-11-19 22:53:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:24,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62061212] [2024-11-19 22:53:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:26,593 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-19 22:53:26,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:26,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62061212] [2024-11-19 22:53:26,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62061212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:26,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:26,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-11-19 22:53:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302782301] [2024-11-19 22:53:26,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:26,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 22:53:26,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:26,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 22:53:26,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2024-11-19 22:53:26,598 INFO L87 Difference]: Start difference. First operand 225 states and 273 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 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-19 22:53:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:29,304 INFO L93 Difference]: Finished difference Result 660 states and 832 transitions. [2024-11-19 22:53:29,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 22:53:29,305 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 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-19 22:53:29,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:29,307 INFO L225 Difference]: With dead ends: 660 [2024-11-19 22:53:29,308 INFO L226 Difference]: Without dead ends: 605 [2024-11-19 22:53:29,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=379, Invalid=1691, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 22:53:29,309 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 2359 mSDsluCounter, 5217 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2359 SdHoareTripleChecker+Valid, 5642 SdHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:29,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2359 Valid, 5642 Invalid, 2657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2644 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 22:53:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-19 22:53:29,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 236. [2024-11-19 22:53:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 228 states have (on average 1.2587719298245614) internal successors, (287), 235 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 287 transitions. [2024-11-19 22:53:29,316 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 287 transitions. Word has length 67 [2024-11-19 22:53:29,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:29,317 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 287 transitions. [2024-11-19 22:53:29,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 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-19 22:53:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 287 transitions. [2024-11-19 22:53:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 22:53:29,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:29,319 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-19 22:53:29,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 22:53:29,319 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:29,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:29,319 INFO L85 PathProgramCache]: Analyzing trace with hash 620991698, now seen corresponding path program 1 times [2024-11-19 22:53:29,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:29,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174607565] [2024-11-19 22:53:29,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:29,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:29,809 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-19 22:53:29,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:29,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174607565] [2024-11-19 22:53:29,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174607565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:29,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:29,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:53:29,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964439067] [2024-11-19 22:53:29,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:29,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:53:29,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:29,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:53:29,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:53:29,811 INFO L87 Difference]: Start difference. First operand 236 states and 287 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-19 22:53:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:30,237 INFO L93 Difference]: Finished difference Result 396 states and 505 transitions. [2024-11-19 22:53:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:53:30,238 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-19 22:53:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:30,239 INFO L225 Difference]: With dead ends: 396 [2024-11-19 22:53:30,239 INFO L226 Difference]: Without dead ends: 315 [2024-11-19 22:53:30,240 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-19 22:53:30,240 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 931 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:30,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1639 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-19 22:53:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 209. [2024-11-19 22:53:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 202 states have (on average 1.2574257425742574) internal successors, (254), 208 states have internal predecessors, (254), 0 states have call successors, (0), 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-19 22:53:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 254 transitions. [2024-11-19 22:53:30,247 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 254 transitions. Word has length 67 [2024-11-19 22:53:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:30,247 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 254 transitions. [2024-11-19 22:53:30,248 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-19 22:53:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 254 transitions. [2024-11-19 22:53:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 22:53:30,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:30,248 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] [2024-11-19 22:53:30,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 22:53:30,249 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:30,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1968382194, now seen corresponding path program 1 times [2024-11-19 22:53:30,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:30,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690740216] [2024-11-19 22:53:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:30,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:31,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-19 22:53:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:31,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690740216] [2024-11-19 22:53:31,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690740216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:31,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:31,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-19 22:53:31,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301269050] [2024-11-19 22:53:31,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:31,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 22:53:31,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:31,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 22:53:31,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:53:31,464 INFO L87 Difference]: Start difference. First operand 209 states and 254 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:33,273 INFO L93 Difference]: Finished difference Result 570 states and 731 transitions. [2024-11-19 22:53:33,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 22:53:33,273 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-19 22:53:33,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:33,275 INFO L225 Difference]: With dead ends: 570 [2024-11-19 22:53:33,275 INFO L226 Difference]: Without dead ends: 512 [2024-11-19 22:53:33,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 22:53:33,276 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 2135 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2135 SdHoareTripleChecker+Valid, 3625 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:33,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2135 Valid, 3625 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 22:53:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-19 22:53:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 226. [2024-11-19 22:53:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 219 states have (on average 1.264840182648402) internal successors, (277), 225 states have internal predecessors, (277), 0 states have call successors, (0), 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-19 22:53:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2024-11-19 22:53:33,283 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 68 [2024-11-19 22:53:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:33,283 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2024-11-19 22:53:33,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2024-11-19 22:53:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 22:53:33,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:33,284 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] [2024-11-19 22:53:33,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 22:53:33,285 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:33,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:33,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1763841774, now seen corresponding path program 1 times [2024-11-19 22:53:33,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:33,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75938241] [2024-11-19 22:53:33,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:33,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:33,748 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-19 22:53:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:33,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75938241] [2024-11-19 22:53:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75938241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:33,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:53:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434975796] [2024-11-19 22:53:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:33,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:53:33,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:53:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:53:33,750 INFO L87 Difference]: Start difference. First operand 226 states and 277 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:34,298 INFO L93 Difference]: Finished difference Result 522 states and 678 transitions. [2024-11-19 22:53:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:53:34,299 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-19 22:53:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:34,300 INFO L225 Difference]: With dead ends: 522 [2024-11-19 22:53:34,300 INFO L226 Difference]: Without dead ends: 414 [2024-11-19 22:53:34,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:53:34,301 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 787 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:34,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1415 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:34,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-19 22:53:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 172. [2024-11-19 22:53:34,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 168 states have (on average 1.2619047619047619) internal successors, (212), 171 states have internal predecessors, (212), 0 states have call successors, (0), 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-19 22:53:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 212 transitions. [2024-11-19 22:53:34,307 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 212 transitions. Word has length 68 [2024-11-19 22:53:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:34,308 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 212 transitions. [2024-11-19 22:53:34,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions. [2024-11-19 22:53:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 22:53:34,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:34,309 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-19 22:53:34,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 22:53:34,309 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:34,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1394723840, now seen corresponding path program 1 times [2024-11-19 22:53:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:34,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937466187] [2024-11-19 22:53:34,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:34,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:34,841 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-19 22:53:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:34,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937466187] [2024-11-19 22:53:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937466187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:34,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:34,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:53:34,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570825581] [2024-11-19 22:53:34,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:34,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:53:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:34,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:53:34,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:53:34,845 INFO L87 Difference]: Start difference. First operand 172 states and 212 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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-19 22:53:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:35,268 INFO L93 Difference]: Finished difference Result 308 states and 403 transitions. [2024-11-19 22:53:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:53:35,269 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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-19 22:53:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:35,270 INFO L225 Difference]: With dead ends: 308 [2024-11-19 22:53:35,270 INFO L226 Difference]: Without dead ends: 233 [2024-11-19 22:53:35,270 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-19 22:53:35,271 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 623 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:35,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1201 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-19 22:53:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 138. [2024-11-19 22:53:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 136 states have (on average 1.2426470588235294) internal successors, (169), 137 states have internal predecessors, (169), 0 states have call successors, (0), 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-19 22:53:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions. [2024-11-19 22:53:35,274 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 69 [2024-11-19 22:53:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:35,275 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions. [2024-11-19 22:53:35,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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-19 22:53:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2024-11-19 22:53:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 22:53:35,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:35,276 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-19 22:53:35,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 22:53:35,276 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:35,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:35,277 INFO L85 PathProgramCache]: Analyzing trace with hash -957086542, now seen corresponding path program 1 times [2024-11-19 22:53:35,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:35,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733493925] [2024-11-19 22:53:35,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:35,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:35,470 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-19 22:53:35,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:35,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733493925] [2024-11-19 22:53:35,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733493925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:35,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:35,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:35,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005607787] [2024-11-19 22:53:35,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:35,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:35,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:35,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:35,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:35,483 INFO L87 Difference]: Start difference. First operand 138 states and 169 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 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-19 22:53:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:35,833 INFO L93 Difference]: Finished difference Result 296 states and 383 transitions. [2024-11-19 22:53:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:53:35,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 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-19 22:53:35,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:35,835 INFO L225 Difference]: With dead ends: 296 [2024-11-19 22:53:35,835 INFO L226 Difference]: Without dead ends: 222 [2024-11-19 22:53:35,835 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-19 22:53:35,836 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 459 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:35,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 670 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-19 22:53:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2024-11-19 22:53:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 137 states have internal predecessors, (168), 0 states have call successors, (0), 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-19 22:53:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 168 transitions. [2024-11-19 22:53:35,839 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 168 transitions. Word has length 70 [2024-11-19 22:53:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:35,839 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 168 transitions. [2024-11-19 22:53:35,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 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-19 22:53:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 168 transitions. [2024-11-19 22:53:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 22:53:35,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:35,840 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] [2024-11-19 22:53:35,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 22:53:35,842 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:35,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash -918116841, now seen corresponding path program 1 times [2024-11-19 22:53:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:35,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221928590] [2024-11-19 22:53:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:36,325 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-19 22:53:36,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:36,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221928590] [2024-11-19 22:53:36,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221928590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:36,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:36,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 22:53:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354923557] [2024-11-19 22:53:36,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:36,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:53:36,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:36,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:53:36,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:53:36,327 INFO L87 Difference]: Start difference. First operand 138 states and 168 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:36,932 INFO L93 Difference]: Finished difference Result 331 states and 439 transitions. [2024-11-19 22:53:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 22:53:36,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-19 22:53:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:36,934 INFO L225 Difference]: With dead ends: 331 [2024-11-19 22:53:36,934 INFO L226 Difference]: Without dead ends: 325 [2024-11-19 22:53:36,934 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-19 22:53:36,935 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 867 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:36,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1700 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:53:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-19 22:53:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 132. [2024-11-19 22:53:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.2366412213740459) internal successors, (162), 131 states have internal predecessors, (162), 0 states have call successors, (0), 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-19 22:53:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2024-11-19 22:53:36,944 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 72 [2024-11-19 22:53:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:36,944 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2024-11-19 22:53:36,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2024-11-19 22:53:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 22:53:36,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:36,945 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-19 22:53:36,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 22:53:36,945 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:36,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:36,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1364481581, now seen corresponding path program 1 times [2024-11-19 22:53:36,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:36,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821228889] [2024-11-19 22:53:36,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:36,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:37,053 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-19 22:53:37,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:37,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821228889] [2024-11-19 22:53:37,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821228889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:37,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:37,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:37,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694777962] [2024-11-19 22:53:37,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:37,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:37,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:37,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:37,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:37,056 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand has 6 states, 6 states have (on average 16.0) 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-19 22:53:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:37,165 INFO L93 Difference]: Finished difference Result 564 states and 794 transitions. [2024-11-19 22:53:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 22:53:37,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) 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-19 22:53:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:37,168 INFO L225 Difference]: With dead ends: 564 [2024-11-19 22:53:37,168 INFO L226 Difference]: Without dead ends: 510 [2024-11-19 22:53:37,169 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-19 22:53:37,170 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 896 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:37,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 944 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-19 22:53:37,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 184. [2024-11-19 22:53:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 183 states have internal predecessors, (238), 0 states have call successors, (0), 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-19 22:53:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 238 transitions. [2024-11-19 22:53:37,177 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 238 transitions. Word has length 96 [2024-11-19 22:53:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:37,177 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 238 transitions. [2024-11-19 22:53:37,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) 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-19 22:53:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 238 transitions. [2024-11-19 22:53:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 22:53:37,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:37,178 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-19 22:53:37,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 22:53:37,179 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:37,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:37,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1426852022, now seen corresponding path program 1 times [2024-11-19 22:53:37,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:37,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169111961] [2024-11-19 22:53:37,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:37,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:37,307 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-19 22:53:37,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:37,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169111961] [2024-11-19 22:53:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169111961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:37,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:37,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280522227] [2024-11-19 22:53:37,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:37,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:37,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:37,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:37,310 INFO L87 Difference]: Start difference. First operand 184 states and 238 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:37,387 INFO L93 Difference]: Finished difference Result 662 states and 935 transitions. [2024-11-19 22:53:37,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:37,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:37,389 INFO L225 Difference]: With dead ends: 662 [2024-11-19 22:53:37,390 INFO L226 Difference]: Without dead ends: 556 [2024-11-19 22:53:37,391 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-19 22:53:37,392 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 648 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:37,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 664 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-19 22:53:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 288. [2024-11-19 22:53:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.362369337979094) internal successors, (391), 287 states have internal predecessors, (391), 0 states have call successors, (0), 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-19 22:53:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 391 transitions. [2024-11-19 22:53:37,400 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 391 transitions. Word has length 98 [2024-11-19 22:53:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:37,400 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 391 transitions. [2024-11-19 22:53:37,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 391 transitions. [2024-11-19 22:53:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 22:53:37,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:37,401 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-19 22:53:37,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 22:53:37,402 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:37,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash 645902315, now seen corresponding path program 1 times [2024-11-19 22:53:37,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:37,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969904924] [2024-11-19 22:53:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:37,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:37,598 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-19 22:53:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969904924] [2024-11-19 22:53:37,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969904924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:37,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:37,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549374565] [2024-11-19 22:53:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:37,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:37,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:37,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:37,601 INFO L87 Difference]: Start difference. First operand 288 states and 391 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:37,690 INFO L93 Difference]: Finished difference Result 500 states and 700 transitions. [2024-11-19 22:53:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:37,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:37,692 INFO L225 Difference]: With dead ends: 500 [2024-11-19 22:53:37,692 INFO L226 Difference]: Without dead ends: 290 [2024-11-19 22:53:37,692 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-19 22:53:37,693 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:37,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 454 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:37,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-19 22:53:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2024-11-19 22:53:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.3554006968641115) internal successors, (389), 287 states have internal predecessors, (389), 0 states have call successors, (0), 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-19 22:53:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 389 transitions. [2024-11-19 22:53:37,705 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 389 transitions. Word has length 98 [2024-11-19 22:53:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:37,706 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 389 transitions. [2024-11-19 22:53:37,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 389 transitions. [2024-11-19 22:53:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 22:53:37,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:37,707 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-19 22:53:37,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 22:53:37,708 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:37,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash 579408803, now seen corresponding path program 1 times [2024-11-19 22:53:37,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:37,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641463998] [2024-11-19 22:53:37,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:37,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:37,759 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-19 22:53:37,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:37,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641463998] [2024-11-19 22:53:37,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641463998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:37,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:37,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600246461] [2024-11-19 22:53:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:37,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:37,762 INFO L87 Difference]: Start difference. First operand 288 states and 389 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-19 22:53:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:37,784 INFO L93 Difference]: Finished difference Result 682 states and 957 transitions. [2024-11-19 22:53:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:37,784 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-19 22:53:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:37,786 INFO L225 Difference]: With dead ends: 682 [2024-11-19 22:53:37,786 INFO L226 Difference]: Without dead ends: 472 [2024-11-19 22:53:37,787 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-19 22:53:37,787 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 66 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:37,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 371 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-19 22:53:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 470. [2024-11-19 22:53:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.3688699360341152) internal successors, (642), 469 states have internal predecessors, (642), 0 states have call successors, (0), 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-19 22:53:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 642 transitions. [2024-11-19 22:53:37,796 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 642 transitions. Word has length 98 [2024-11-19 22:53:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:37,796 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 642 transitions. [2024-11-19 22:53:37,797 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-19 22:53:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 642 transitions. [2024-11-19 22:53:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 22:53:37,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:37,798 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-19 22:53:37,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 22:53:37,798 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:37,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash 628880202, now seen corresponding path program 1 times [2024-11-19 22:53:37,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:37,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329100345] [2024-11-19 22:53:37,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:37,911 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-19 22:53:37,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:37,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329100345] [2024-11-19 22:53:37,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329100345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:37,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:37,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:37,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030543198] [2024-11-19 22:53:37,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:37,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:37,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:37,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:37,914 INFO L87 Difference]: Start difference. First operand 470 states and 642 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:37,988 INFO L93 Difference]: Finished difference Result 1358 states and 1906 transitions. [2024-11-19 22:53:37,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:37,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:37,993 INFO L225 Difference]: With dead ends: 1358 [2024-11-19 22:53:37,993 INFO L226 Difference]: Without dead ends: 1161 [2024-11-19 22:53:37,993 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-19 22:53:37,995 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 613 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:37,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 691 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-11-19 22:53:38,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 763. [2024-11-19 22:53:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 762 states have (on average 1.389763779527559) internal successors, (1059), 762 states have internal predecessors, (1059), 0 states have call successors, (0), 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-19 22:53:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1059 transitions. [2024-11-19 22:53:38,011 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1059 transitions. Word has length 98 [2024-11-19 22:53:38,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:38,012 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1059 transitions. [2024-11-19 22:53:38,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1059 transitions. [2024-11-19 22:53:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 22:53:38,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:38,013 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-19 22:53:38,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 22:53:38,013 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:38,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:38,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1790937782, now seen corresponding path program 1 times [2024-11-19 22:53:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:38,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350566061] [2024-11-19 22:53:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:38,132 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-19 22:53:38,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:38,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350566061] [2024-11-19 22:53:38,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350566061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:38,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:38,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:38,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497641749] [2024-11-19 22:53:38,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:38,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:38,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:38,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:38,137 INFO L87 Difference]: Start difference. First operand 763 states and 1059 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:38,211 INFO L93 Difference]: Finished difference Result 1553 states and 2184 transitions. [2024-11-19 22:53:38,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:38,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:38,215 INFO L225 Difference]: With dead ends: 1553 [2024-11-19 22:53:38,215 INFO L226 Difference]: Without dead ends: 1356 [2024-11-19 22:53:38,215 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-19 22:53:38,216 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 583 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:38,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 750 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2024-11-19 22:53:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 958. [2024-11-19 22:53:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.3970741901776385) internal successors, (1337), 957 states have internal predecessors, (1337), 0 states have call successors, (0), 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-19 22:53:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1337 transitions. [2024-11-19 22:53:38,233 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1337 transitions. Word has length 98 [2024-11-19 22:53:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:38,234 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1337 transitions. [2024-11-19 22:53:38,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1337 transitions. [2024-11-19 22:53:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 22:53:38,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:38,244 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-19 22:53:38,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 22:53:38,244 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:38,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:38,245 INFO L85 PathProgramCache]: Analyzing trace with hash -686393014, now seen corresponding path program 1 times [2024-11-19 22:53:38,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:38,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97740526] [2024-11-19 22:53:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:38,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:38,368 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-19 22:53:38,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:38,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97740526] [2024-11-19 22:53:38,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97740526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:38,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:38,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:38,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480577481] [2024-11-19 22:53:38,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:38,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:38,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:38,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:38,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:38,371 INFO L87 Difference]: Start difference. First operand 958 states and 1337 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:38,458 INFO L93 Difference]: Finished difference Result 1748 states and 2462 transitions. [2024-11-19 22:53:38,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:38,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:38,462 INFO L225 Difference]: With dead ends: 1748 [2024-11-19 22:53:38,462 INFO L226 Difference]: Without dead ends: 1551 [2024-11-19 22:53:38,463 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-19 22:53:38,466 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 641 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:38,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 765 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-11-19 22:53:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1153. [2024-11-19 22:53:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.4019097222222223) internal successors, (1615), 1152 states have internal predecessors, (1615), 0 states have call successors, (0), 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-19 22:53:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1615 transitions. [2024-11-19 22:53:38,484 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1615 transitions. Word has length 98 [2024-11-19 22:53:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:38,485 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1615 transitions. [2024-11-19 22:53:38,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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-19 22:53:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1615 transitions. [2024-11-19 22:53:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 22:53:38,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:38,486 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-19 22:53:38,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 22:53:38,486 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:38,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:38,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1897778033, now seen corresponding path program 1 times [2024-11-19 22:53:38,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:38,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126914230] [2024-11-19 22:53:38,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:38,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:38,585 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-19 22:53:38,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:38,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126914230] [2024-11-19 22:53:38,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126914230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:38,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:38,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:38,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71142386] [2024-11-19 22:53:38,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:38,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:38,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:38,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:38,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:38,587 INFO L87 Difference]: Start difference. First operand 1153 states and 1615 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-19 22:53:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:38,608 INFO L93 Difference]: Finished difference Result 2885 states and 4062 transitions. [2024-11-19 22:53:38,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:38,608 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-19 22:53:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:38,613 INFO L225 Difference]: With dead ends: 2885 [2024-11-19 22:53:38,613 INFO L226 Difference]: Without dead ends: 1810 [2024-11-19 22:53:38,615 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-19 22:53:38,616 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 77 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 343 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-19 22:53:38,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:38,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-19 22:53:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1720. [2024-11-19 22:53:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1719 states have (on average 1.3944153577661431) internal successors, (2397), 1719 states have internal predecessors, (2397), 0 states have call successors, (0), 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-19 22:53:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2397 transitions. [2024-11-19 22:53:38,648 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2397 transitions. Word has length 99 [2024-11-19 22:53:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:38,648 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2397 transitions. [2024-11-19 22:53:38,649 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-19 22:53:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2397 transitions. [2024-11-19 22:53:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 22:53:38,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:38,649 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-19 22:53:38,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 22:53:38,650 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:38,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash 642959826, now seen corresponding path program 1 times [2024-11-19 22:53:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466878508] [2024-11-19 22:53:38,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:38,754 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-19 22:53:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466878508] [2024-11-19 22:53:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466878508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:38,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:38,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:38,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474851525] [2024-11-19 22:53:38,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:38,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:38,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:38,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:38,757 INFO L87 Difference]: Start difference. First operand 1720 states and 2397 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-19 22:53:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:38,783 INFO L93 Difference]: Finished difference Result 4872 states and 6794 transitions. [2024-11-19 22:53:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:38,783 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-19 22:53:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:38,791 INFO L225 Difference]: With dead ends: 4872 [2024-11-19 22:53:38,791 INFO L226 Difference]: Without dead ends: 3230 [2024-11-19 22:53:38,793 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-19 22:53:38,794 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 70 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 344 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-19 22:53:38,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 344 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2024-11-19 22:53:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3096. [2024-11-19 22:53:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 3095 states have (on average 1.3831987075928918) internal successors, (4281), 3095 states have internal predecessors, (4281), 0 states have call successors, (0), 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-19 22:53:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 4281 transitions. [2024-11-19 22:53:38,839 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 4281 transitions. Word has length 100 [2024-11-19 22:53:38,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:38,839 INFO L471 AbstractCegarLoop]: Abstraction has 3096 states and 4281 transitions. [2024-11-19 22:53:38,839 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-19 22:53:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 4281 transitions. [2024-11-19 22:53:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 22:53:38,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:38,840 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-19 22:53:38,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 22:53:38,841 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:38,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash -563977445, now seen corresponding path program 1 times [2024-11-19 22:53:38,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:38,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529327000] [2024-11-19 22:53:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:38,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:38,948 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-19 22:53:38,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:38,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529327000] [2024-11-19 22:53:38,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529327000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:38,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:38,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441218081] [2024-11-19 22:53:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:38,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:38,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:38,951 INFO L87 Difference]: Start difference. First operand 3096 states and 4281 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 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-19 22:53:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:38,986 INFO L93 Difference]: Finished difference Result 8868 states and 12215 transitions. [2024-11-19 22:53:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 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-19 22:53:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:39,003 INFO L225 Difference]: With dead ends: 8868 [2024-11-19 22:53:39,003 INFO L226 Difference]: Without dead ends: 5850 [2024-11-19 22:53:39,009 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-19 22:53:39,011 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 63 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 344 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-19 22:53:39,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 344 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2024-11-19 22:53:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5584. [2024-11-19 22:53:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5584 states, 5583 states have (on average 1.3648576034390112) internal successors, (7620), 5583 states have internal predecessors, (7620), 0 states have call successors, (0), 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-19 22:53:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5584 states to 5584 states and 7620 transitions. [2024-11-19 22:53:39,124 INFO L78 Accepts]: Start accepts. Automaton has 5584 states and 7620 transitions. Word has length 101 [2024-11-19 22:53:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:39,125 INFO L471 AbstractCegarLoop]: Abstraction has 5584 states and 7620 transitions. [2024-11-19 22:53:39,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 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-19 22:53:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 5584 states and 7620 transitions. [2024-11-19 22:53:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 22:53:39,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:39,126 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-19 22:53:39,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 22:53:39,126 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:39,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash 573353758, now seen corresponding path program 1 times [2024-11-19 22:53:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:39,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25153712] [2024-11-19 22:53:39,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:39,245 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-19 22:53:39,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:39,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25153712] [2024-11-19 22:53:39,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25153712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:39,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:39,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:39,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444161886] [2024-11-19 22:53:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:39,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:39,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:39,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:39,247 INFO L87 Difference]: Start difference. First operand 5584 states and 7620 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-19 22:53:39,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:39,286 INFO L93 Difference]: Finished difference Result 16068 states and 21770 transitions. [2024-11-19 22:53:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:39,287 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-19 22:53:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:39,308 INFO L225 Difference]: With dead ends: 16068 [2024-11-19 22:53:39,309 INFO L226 Difference]: Without dead ends: 10562 [2024-11-19 22:53:39,316 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-19 22:53:39,317 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 53 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 343 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-19 22:53:39,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 343 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10562 states. [2024-11-19 22:53:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10562 to 10032. [2024-11-19 22:53:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10032 states, 10031 states have (on average 1.3398464759246336) internal successors, (13440), 10031 states have internal predecessors, (13440), 0 states have call successors, (0), 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-19 22:53:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10032 states to 10032 states and 13440 transitions. [2024-11-19 22:53:39,449 INFO L78 Accepts]: Start accepts. Automaton has 10032 states and 13440 transitions. Word has length 102 [2024-11-19 22:53:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:39,450 INFO L471 AbstractCegarLoop]: Abstraction has 10032 states and 13440 transitions. [2024-11-19 22:53:39,450 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-19 22:53:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 10032 states and 13440 transitions. [2024-11-19 22:53:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 22:53:39,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:39,451 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, 1] [2024-11-19 22:53:39,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 22:53:39,452 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:39,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1488377255, now seen corresponding path program 1 times [2024-11-19 22:53:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627285824] [2024-11-19 22:53:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:39,726 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-19 22:53:39,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:39,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627285824] [2024-11-19 22:53:39,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627285824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:39,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:39,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306496473] [2024-11-19 22:53:39,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:39,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:39,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:39,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:39,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:39,728 INFO L87 Difference]: Start difference. First operand 10032 states and 13440 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:40,059 INFO L93 Difference]: Finished difference Result 30226 states and 40442 transitions. [2024-11-19 22:53:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:53:40,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-19 22:53:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:40,149 INFO L225 Difference]: With dead ends: 30226 [2024-11-19 22:53:40,149 INFO L226 Difference]: Without dead ends: 20265 [2024-11-19 22:53:40,161 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-19 22:53:40,162 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 603 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:40,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 604 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20265 states. [2024-11-19 22:53:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20265 to 10032. [2024-11-19 22:53:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10032 states, 10031 states have (on average 1.3397467849666036) internal successors, (13439), 10031 states have internal predecessors, (13439), 0 states have call successors, (0), 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-19 22:53:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10032 states to 10032 states and 13439 transitions. [2024-11-19 22:53:40,331 INFO L78 Accepts]: Start accepts. Automaton has 10032 states and 13439 transitions. Word has length 103 [2024-11-19 22:53:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:40,331 INFO L471 AbstractCegarLoop]: Abstraction has 10032 states and 13439 transitions. [2024-11-19 22:53:40,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 10032 states and 13439 transitions. [2024-11-19 22:53:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 22:53:40,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:40,332 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, 1, 1, 1] [2024-11-19 22:53:40,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 22:53:40,332 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:40,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash -397575358, now seen corresponding path program 1 times [2024-11-19 22:53:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:40,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720873033] [2024-11-19 22:53:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:40,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:40,585 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-19 22:53:40,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:40,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720873033] [2024-11-19 22:53:40,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720873033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:40,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:40,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037742816] [2024-11-19 22:53:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:40,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:40,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:40,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:40,587 INFO L87 Difference]: Start difference. First operand 10032 states and 13439 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:40,626 INFO L93 Difference]: Finished difference Result 10274 states and 13760 transitions. [2024-11-19 22:53:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:40,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-19 22:53:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:40,641 INFO L225 Difference]: With dead ends: 10274 [2024-11-19 22:53:40,641 INFO L226 Difference]: Without dead ends: 10272 [2024-11-19 22:53:40,644 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-19 22:53:40,644 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:40,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 768 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10272 states. [2024-11-19 22:53:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10272 to 10272. [2024-11-19 22:53:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10272 states, 10271 states have (on average 1.3224612988024536) internal successors, (13583), 10271 states have internal predecessors, (13583), 0 states have call successors, (0), 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-19 22:53:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10272 states to 10272 states and 13583 transitions. [2024-11-19 22:53:40,757 INFO L78 Accepts]: Start accepts. Automaton has 10272 states and 13583 transitions. Word has length 105 [2024-11-19 22:53:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:40,757 INFO L471 AbstractCegarLoop]: Abstraction has 10272 states and 13583 transitions. [2024-11-19 22:53:40,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 10272 states and 13583 transitions. [2024-11-19 22:53:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 22:53:40,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:40,758 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, 1, 1, 1] [2024-11-19 22:53:40,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 22:53:40,759 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:40,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1994343167, now seen corresponding path program 1 times [2024-11-19 22:53:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:40,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607692562] [2024-11-19 22:53:40,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:40,843 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-19 22:53:40,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:40,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607692562] [2024-11-19 22:53:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607692562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:40,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:40,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618925164] [2024-11-19 22:53:40,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:40,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:40,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:40,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:40,846 INFO L87 Difference]: Start difference. First operand 10272 states and 13583 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:40,899 INFO L93 Difference]: Finished difference Result 20788 states and 27513 transitions. [2024-11-19 22:53:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:40,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-19 22:53:40,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:40,916 INFO L225 Difference]: With dead ends: 20788 [2024-11-19 22:53:40,916 INFO L226 Difference]: Without dead ends: 10594 [2024-11-19 22:53:40,929 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-19 22:53:40,930 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 85 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:40,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 285 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10594 states. [2024-11-19 22:53:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10594 to 10592. [2024-11-19 22:53:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10592 states, 10591 states have (on average 1.3055424416957795) internal successors, (13827), 10591 states have internal predecessors, (13827), 0 states have call successors, (0), 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-19 22:53:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10592 states to 10592 states and 13827 transitions. [2024-11-19 22:53:41,060 INFO L78 Accepts]: Start accepts. Automaton has 10592 states and 13827 transitions. Word has length 105 [2024-11-19 22:53:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:41,060 INFO L471 AbstractCegarLoop]: Abstraction has 10592 states and 13827 transitions. [2024-11-19 22:53:41,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 10592 states and 13827 transitions. [2024-11-19 22:53:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 22:53:41,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:41,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:53:41,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 22:53:41,064 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:41,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash 869036994, now seen corresponding path program 1 times [2024-11-19 22:53:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:41,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977947223] [2024-11-19 22:53:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:41,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977947223] [2024-11-19 22:53:41,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977947223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:53:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907502067] [2024-11-19 22:53:41,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:41,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:53:41,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:53:41,635 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-19 22:53:41,636 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-19 22:53:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:41,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 22:53:41,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:53:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:42,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:53:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:44,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907502067] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:53:44,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:53:44,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-11-19 22:53:44,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962253580] [2024-11-19 22:53:44,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:53:44,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 22:53:44,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:44,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 22:53:44,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:53:44,776 INFO L87 Difference]: Start difference. First operand 10592 states and 13827 transitions. Second operand has 23 states, 23 states have (on average 12.434782608695652) internal successors, (286), 22 states have internal predecessors, (286), 0 states have call successors, (0), 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-19 22:53:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:45,902 INFO L93 Difference]: Finished difference Result 45675 states and 60354 transitions. [2024-11-19 22:53:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-19 22:53:45,903 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 12.434782608695652) internal successors, (286), 22 states have internal predecessors, (286), 0 states have call successors, (0), 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 132 [2024-11-19 22:53:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:45,934 INFO L225 Difference]: With dead ends: 45675 [2024-11-19 22:53:45,934 INFO L226 Difference]: Without dead ends: 35161 [2024-11-19 22:53:45,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=425, Invalid=1831, Unknown=0, NotChecked=0, Total=2256 [2024-11-19 22:53:45,956 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1384 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:45,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 1793 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:53:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35161 states. [2024-11-19 22:53:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35161 to 25789. [2024-11-19 22:53:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25789 states, 25788 states have (on average 1.3035132619823173) internal successors, (33615), 25788 states have internal predecessors, (33615), 0 states have call successors, (0), 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-19 22:53:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25789 states to 25789 states and 33615 transitions. [2024-11-19 22:53:46,304 INFO L78 Accepts]: Start accepts. Automaton has 25789 states and 33615 transitions. Word has length 132 [2024-11-19 22:53:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:46,305 INFO L471 AbstractCegarLoop]: Abstraction has 25789 states and 33615 transitions. [2024-11-19 22:53:46,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.434782608695652) internal successors, (286), 22 states have internal predecessors, (286), 0 states have call successors, (0), 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-19 22:53:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 25789 states and 33615 transitions. [2024-11-19 22:53:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 22:53:46,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:46,310 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:53:46,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 22:53:46,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-19 22:53:46,511 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:46,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1613142068, now seen corresponding path program 1 times [2024-11-19 22:53:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:46,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663472912] [2024-11-19 22:53:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:46,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:47,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:47,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663472912] [2024-11-19 22:53:47,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663472912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:53:47,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972875626] [2024-11-19 22:53:47,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:47,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:53:47,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:53:47,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:53:47,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 22:53:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:47,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 22:53:47,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:53:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:47,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:53:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:49,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972875626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:53:49,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:53:49,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-19 22:53:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410394890] [2024-11-19 22:53:49,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:53:49,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 22:53:49,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:49,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 22:53:49,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2024-11-19 22:53:49,222 INFO L87 Difference]: Start difference. First operand 25789 states and 33615 transitions. Second operand has 29 states, 29 states have (on average 11.89655172413793) internal successors, (345), 28 states have internal predecessors, (345), 0 states have call successors, (0), 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-19 22:53:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:50,311 INFO L93 Difference]: Finished difference Result 100201 states and 131551 transitions. [2024-11-19 22:53:50,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 22:53:50,311 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 11.89655172413793) internal successors, (345), 28 states have internal predecessors, (345), 0 states have call successors, (0), 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 133 [2024-11-19 22:53:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:50,419 INFO L225 Difference]: With dead ends: 100201 [2024-11-19 22:53:50,419 INFO L226 Difference]: Without dead ends: 74519 [2024-11-19 22:53:50,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=553, Invalid=1897, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 22:53:50,453 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1757 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:50,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 1427 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:53:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74519 states. [2024-11-19 22:53:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74519 to 61258. [2024-11-19 22:53:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61258 states, 61257 states have (on average 1.302953131886968) internal successors, (79815), 61257 states have internal predecessors, (79815), 0 states have call successors, (0), 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-19 22:53:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61258 states to 61258 states and 79815 transitions. [2024-11-19 22:53:51,241 INFO L78 Accepts]: Start accepts. Automaton has 61258 states and 79815 transitions. Word has length 133 [2024-11-19 22:53:51,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:51,242 INFO L471 AbstractCegarLoop]: Abstraction has 61258 states and 79815 transitions. [2024-11-19 22:53:51,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.89655172413793) internal successors, (345), 28 states have internal predecessors, (345), 0 states have call successors, (0), 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-19 22:53:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 61258 states and 79815 transitions. [2024-11-19 22:53:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 22:53:51,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:51,257 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:51,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 22:53:51,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-19 22:53:51,458 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:51,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:51,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1347457011, now seen corresponding path program 1 times [2024-11-19 22:53:51,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:51,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024967938] [2024-11-19 22:53:51,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:51,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:52,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:52,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024967938] [2024-11-19 22:53:52,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024967938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:53:52,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526439359] [2024-11-19 22:53:52,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:52,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:53:52,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:53:52,522 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:53:52,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 22:53:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:52,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 22:53:52,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:53:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:56,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:54:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:54:04,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526439359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:54:04,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:54:04,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22, 22] total 55 [2024-11-19 22:54:04,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51118822] [2024-11-19 22:54:04,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:54:04,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-19 22:54:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:54:04,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-19 22:54:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2758, Unknown=1, NotChecked=0, Total=2970 [2024-11-19 22:54:04,041 INFO L87 Difference]: Start difference. First operand 61258 states and 79815 transitions. Second operand has 55 states, 55 states have (on average 6.618181818181818) internal successors, (364), 55 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)