./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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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.1.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 c74f92ba3d978b3a2efb098ebc8eb373bc42abebaabf8c6efaf148fbe05036e0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:55:35,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:55:35,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:55:35,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:55:35,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:55:35,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:55:35,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:55:35,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:55:35,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:55:35,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:55:35,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:55:35,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:55:35,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:55:35,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:55:35,967 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:55:35,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:55:35,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:55:35,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:55:35,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:55:35,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:55:35,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:55:35,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:55:35,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:55:35,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:55:35,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:55:35,975 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:55:35,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:55:35,975 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:55:35,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:55:35,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:55:35,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:55:35,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:55:35,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:55:35,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:55:35,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:55:35,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:55:35,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:55:35,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:55:35,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:55:35,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:55:35,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:55:35,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:55:35,977 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 -> c74f92ba3d978b3a2efb098ebc8eb373bc42abebaabf8c6efaf148fbe05036e0 [2024-10-14 03:55:36,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:55:36,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:55:36,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:55:36,212 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:55:36,213 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:55:36,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2024-10-14 03:55:37,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:55:37,719 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:55:37,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2024-10-14 03:55:37,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7232dd8c6/ac8aea59a6324fbeafaa661fd440b3ec/FLAG2ce222367 [2024-10-14 03:55:37,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7232dd8c6/ac8aea59a6324fbeafaa661fd440b3ec [2024-10-14 03:55:37,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:55:37,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:55:37,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:55:37,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:55:37,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:55:37,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:55:37" (1/1) ... [2024-10-14 03:55:37,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@965f707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:37, skipping insertion in model container [2024-10-14 03:55:37,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:55:37" (1/1) ... [2024-10-14 03:55:37,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:55:38,103 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2024-10-14 03:55:38,148 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2024-10-14 03:55:38,158 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2024-10-14 03:55:38,179 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2024-10-14 03:55:38,194 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2024-10-14 03:55:38,206 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2024-10-14 03:55:38,218 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2024-10-14 03:55:38,231 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2024-10-14 03:55:38,249 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2024-10-14 03:55:38,263 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2024-10-14 03:55:38,278 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2024-10-14 03:55:38,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:55:38,320 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:55:38,393 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2024-10-14 03:55:38,424 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2024-10-14 03:55:38,431 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2024-10-14 03:55:38,437 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2024-10-14 03:55:38,448 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2024-10-14 03:55:38,458 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2024-10-14 03:55:38,464 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2024-10-14 03:55:38,469 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2024-10-14 03:55:38,475 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2024-10-14 03:55:38,481 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2024-10-14 03:55:38,487 WARN L248 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.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2024-10-14 03:55:38,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:55:38,523 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:55:38,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38 WrapperNode [2024-10-14 03:55:38,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:55:38,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:55:38,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:55:38,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:55:38,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,619 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2971 [2024-10-14 03:55:38,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:55:38,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:55:38,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:55:38,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:55:38,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,680 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-10-14 03:55:38,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:55:38,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:55:38,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:55:38,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:55:38,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (1/1) ... [2024-10-14 03:55:38,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:55:38,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:55:38,774 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-10-14 03:55:38,776 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-10-14 03:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:55:38,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:55:38,995 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:55:38,997 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:55:40,317 INFO L? ?]: Removed 576 outVars from TransFormulas that were not future-live. [2024-10-14 03:55:40,318 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:55:40,370 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:55:40,373 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:55:40,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:55:40 BoogieIcfgContainer [2024-10-14 03:55:40,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:55:40,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:55:40,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:55:40,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:55:40,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:55:37" (1/3) ... [2024-10-14 03:55:40,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484b992e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:55:40, skipping insertion in model container [2024-10-14 03:55:40,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:38" (2/3) ... [2024-10-14 03:55:40,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484b992e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:55:40, skipping insertion in model container [2024-10-14 03:55:40,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:55:40" (3/3) ... [2024-10-14 03:55:40,381 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2024-10-14 03:55:40,395 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:55:40,395 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-14 03:55:40,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:55:40,468 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;@2d5811f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:55:40,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-14 03:55:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 568 states, 556 states have (on average 1.7859712230215827) internal successors, (993), 567 states have internal predecessors, (993), 0 states have call successors, (0), 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-10-14 03:55:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:55:40,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:40,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:55:40,495 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-10-14 03:55:40,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:40,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1518492486, now seen corresponding path program 1 times [2024-10-14 03:55:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:40,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583955312] [2024-10-14 03:55:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:40,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:40,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:40,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583955312] [2024-10-14 03:55:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583955312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:40,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:40,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:55:40,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993382047] [2024-10-14 03:55:40,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:40,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:55:40,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:40,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:55:40,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:55:41,001 INFO L87 Difference]: Start difference. First operand has 568 states, 556 states have (on average 1.7859712230215827) internal successors, (993), 567 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:41,511 INFO L93 Difference]: Finished difference Result 780 states and 1329 transitions. [2024-10-14 03:55:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:55:41,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-14 03:55:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:41,529 INFO L225 Difference]: With dead ends: 780 [2024-10-14 03:55:41,529 INFO L226 Difference]: Without dead ends: 502 [2024-10-14 03:55:41,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:55:41,537 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 2431 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:41,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 537 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:55:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-10-14 03:55:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2024-10-14 03:55:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 491 states have (on average 1.274949083503055) internal successors, (626), 501 states have internal predecessors, (626), 0 states have call successors, (0), 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-10-14 03:55:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 626 transitions. [2024-10-14 03:55:41,589 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 626 transitions. Word has length 59 [2024-10-14 03:55:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:41,589 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 626 transitions. [2024-10-14 03:55:41,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 626 transitions. [2024-10-14 03:55:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:55:41,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:41,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:55:41,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:55:41,597 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-10-14 03:55:41,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1943729877, now seen corresponding path program 1 times [2024-10-14 03:55:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:41,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478626755] [2024-10-14 03:55:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:41,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:41,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:41,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478626755] [2024-10-14 03:55:41,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478626755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:41,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:41,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:55:41,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371607398] [2024-10-14 03:55:41,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:41,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:55:41,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:41,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:55:41,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:55:41,783 INFO L87 Difference]: Start difference. First operand 502 states and 626 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:41,976 INFO L93 Difference]: Finished difference Result 600 states and 747 transitions. [2024-10-14 03:55:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:55:41,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-14 03:55:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:41,978 INFO L225 Difference]: With dead ends: 600 [2024-10-14 03:55:41,978 INFO L226 Difference]: Without dead ends: 350 [2024-10-14 03:55:41,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:55:41,980 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1240 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:41,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 254 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:55:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-14 03:55:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-10-14 03:55:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 339 states have (on average 1.2772861356932153) internal successors, (433), 349 states have internal predecessors, (433), 0 states have call successors, (0), 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-10-14 03:55:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 433 transitions. [2024-10-14 03:55:41,996 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 433 transitions. Word has length 59 [2024-10-14 03:55:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:41,996 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 433 transitions. [2024-10-14 03:55:41,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 433 transitions. [2024-10-14 03:55:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:55:41,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:41,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:55:41,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:55:41,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:41,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:41,998 INFO L85 PathProgramCache]: Analyzing trace with hash -19682530, now seen corresponding path program 1 times [2024-10-14 03:55:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:41,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840033975] [2024-10-14 03:55:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:41,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:42,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:42,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840033975] [2024-10-14 03:55:42,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840033975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:42,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:42,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:55:42,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817985531] [2024-10-14 03:55:42,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:42,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:55:42,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:42,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:55:42,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:55:42,123 INFO L87 Difference]: Start difference. First operand 350 states and 433 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:42,371 INFO L93 Difference]: Finished difference Result 646 states and 817 transitions. [2024-10-14 03:55:42,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:55:42,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-14 03:55:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:42,373 INFO L225 Difference]: With dead ends: 646 [2024-10-14 03:55:42,373 INFO L226 Difference]: Without dead ends: 457 [2024-10-14 03:55:42,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:55:42,375 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1490 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:42,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 340 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:55:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-14 03:55:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 409. [2024-10-14 03:55:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 398 states have (on average 1.3391959798994975) internal successors, (533), 408 states have internal predecessors, (533), 0 states have call successors, (0), 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-10-14 03:55:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 533 transitions. [2024-10-14 03:55:42,385 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 533 transitions. Word has length 59 [2024-10-14 03:55:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:42,385 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 533 transitions. [2024-10-14 03:55:42,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 533 transitions. [2024-10-14 03:55:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 03:55:42,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:42,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:55:42,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:55:42,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:42,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash -732780502, now seen corresponding path program 1 times [2024-10-14 03:55:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:42,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494966429] [2024-10-14 03:55:42,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:42,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:42,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494966429] [2024-10-14 03:55:42,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494966429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:42,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:42,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:55:42,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649112667] [2024-10-14 03:55:42,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:42,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:55:42,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:42,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:55:42,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:55:42,549 INFO L87 Difference]: Start difference. First operand 409 states and 533 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:42,692 INFO L93 Difference]: Finished difference Result 596 states and 784 transitions. [2024-10-14 03:55:42,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:55:42,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-14 03:55:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:42,694 INFO L225 Difference]: With dead ends: 596 [2024-10-14 03:55:42,694 INFO L226 Difference]: Without dead ends: 356 [2024-10-14 03:55:42,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:55:42,695 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 925 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:42,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 205 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:55:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-14 03:55:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-10-14 03:55:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3478260869565217) internal successors, (465), 355 states have internal predecessors, (465), 0 states have call successors, (0), 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-10-14 03:55:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 465 transitions. [2024-10-14 03:55:42,702 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 465 transitions. Word has length 61 [2024-10-14 03:55:42,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:42,703 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 465 transitions. [2024-10-14 03:55:42,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 465 transitions. [2024-10-14 03:55:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:55:42,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:42,705 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] [2024-10-14 03:55:42,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:55:42,705 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-10-14 03:55:42,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1082227329, now seen corresponding path program 1 times [2024-10-14 03:55:42,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:42,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366151137] [2024-10-14 03:55:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:42,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:42,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366151137] [2024-10-14 03:55:42,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366151137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:42,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:42,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615553627] [2024-10-14 03:55:42,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:42,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:42,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:42,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:42,970 INFO L87 Difference]: Start difference. First operand 356 states and 465 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:43,415 INFO L93 Difference]: Finished difference Result 645 states and 855 transitions. [2024-10-14 03:55:43,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:55:43,415 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:55:43,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:43,417 INFO L225 Difference]: With dead ends: 645 [2024-10-14 03:55:43,417 INFO L226 Difference]: Without dead ends: 501 [2024-10-14 03:55:43,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:55:43,418 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1353 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:43,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 837 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:55:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-14 03:55:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 356. [2024-10-14 03:55:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.344927536231884) internal successors, (464), 355 states have internal predecessors, (464), 0 states have call successors, (0), 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-10-14 03:55:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 464 transitions. [2024-10-14 03:55:43,425 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 464 transitions. Word has length 63 [2024-10-14 03:55:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:43,426 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 464 transitions. [2024-10-14 03:55:43,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 464 transitions. [2024-10-14 03:55:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:55:43,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:43,427 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] [2024-10-14 03:55:43,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:55:43,427 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-10-14 03:55:43,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1413074335, now seen corresponding path program 1 times [2024-10-14 03:55:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020781711] [2024-10-14 03:55:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020781711] [2024-10-14 03:55:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020781711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:43,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:43,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618382569] [2024-10-14 03:55:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:43,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:43,665 INFO L87 Difference]: Start difference. First operand 356 states and 464 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:44,067 INFO L93 Difference]: Finished difference Result 563 states and 732 transitions. [2024-10-14 03:55:44,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:55:44,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:55:44,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:44,069 INFO L225 Difference]: With dead ends: 563 [2024-10-14 03:55:44,070 INFO L226 Difference]: Without dead ends: 557 [2024-10-14 03:55:44,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:55:44,071 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 866 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:44,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 798 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:55:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-14 03:55:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 356. [2024-10-14 03:55:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3420289855072465) internal successors, (463), 355 states have internal predecessors, (463), 0 states have call successors, (0), 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-10-14 03:55:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 463 transitions. [2024-10-14 03:55:44,077 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 463 transitions. Word has length 63 [2024-10-14 03:55:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:44,078 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 463 transitions. [2024-10-14 03:55:44,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 463 transitions. [2024-10-14 03:55:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:55:44,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:44,079 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] [2024-10-14 03:55:44,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:55:44,079 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-10-14 03:55:44,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:44,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1960661089, now seen corresponding path program 1 times [2024-10-14 03:55:44,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:44,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716715986] [2024-10-14 03:55:44,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:44,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:44,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:44,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716715986] [2024-10-14 03:55:44,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716715986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:44,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:44,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:55:44,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755320965] [2024-10-14 03:55:44,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:44,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:55:44,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:44,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:55:44,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:55:44,281 INFO L87 Difference]: Start difference. First operand 356 states and 463 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:44,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:44,600 INFO L93 Difference]: Finished difference Result 723 states and 945 transitions. [2024-10-14 03:55:44,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:55:44,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:55:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:44,604 INFO L225 Difference]: With dead ends: 723 [2024-10-14 03:55:44,604 INFO L226 Difference]: Without dead ends: 530 [2024-10-14 03:55:44,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:55:44,605 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 1154 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:44,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 646 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:55:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-14 03:55:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 356. [2024-10-14 03:55:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3391304347826087) internal successors, (462), 355 states have internal predecessors, (462), 0 states have call successors, (0), 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-10-14 03:55:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 462 transitions. [2024-10-14 03:55:44,612 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 462 transitions. Word has length 63 [2024-10-14 03:55:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:44,612 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 462 transitions. [2024-10-14 03:55:44,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 462 transitions. [2024-10-14 03:55:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 03:55:44,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:44,613 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-10-14 03:55:44,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:55:44,613 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-10-14 03:55:44,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash 718759200, now seen corresponding path program 1 times [2024-10-14 03:55:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959279301] [2024-10-14 03:55:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:44,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-10-14 03:55:44,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:44,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959279301] [2024-10-14 03:55:44,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959279301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:44,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:44,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:44,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739413983] [2024-10-14 03:55:44,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:44,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:44,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:44,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:44,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:44,812 INFO L87 Difference]: Start difference. First operand 356 states and 462 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-10-14 03:55:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:45,198 INFO L93 Difference]: Finished difference Result 666 states and 885 transitions. [2024-10-14 03:55:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:55:45,198 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-10-14 03:55:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:45,200 INFO L225 Difference]: With dead ends: 666 [2024-10-14 03:55:45,200 INFO L226 Difference]: Without dead ends: 557 [2024-10-14 03:55:45,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:55:45,201 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1327 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:45,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 801 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:55:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-14 03:55:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 356. [2024-10-14 03:55:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.336231884057971) internal successors, (461), 355 states have internal predecessors, (461), 0 states have call successors, (0), 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-10-14 03:55:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 461 transitions. [2024-10-14 03:55:45,209 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 461 transitions. Word has length 64 [2024-10-14 03:55:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:45,209 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 461 transitions. [2024-10-14 03:55:45,209 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-10-14 03:55:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 461 transitions. [2024-10-14 03:55:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 03:55:45,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:45,210 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-10-14 03:55:45,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:55:45,210 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-10-14 03:55:45,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash 478712064, now seen corresponding path program 1 times [2024-10-14 03:55:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:45,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440340298] [2024-10-14 03:55:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:45,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:45,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440340298] [2024-10-14 03:55:45,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440340298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:45,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:45,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:45,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265814623] [2024-10-14 03:55:45,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:45,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:45,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:45,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:45,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:45,436 INFO L87 Difference]: Start difference. First operand 356 states and 461 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-10-14 03:55:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:45,899 INFO L93 Difference]: Finished difference Result 698 states and 933 transitions. [2024-10-14 03:55:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:55:45,899 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-10-14 03:55:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:45,901 INFO L225 Difference]: With dead ends: 698 [2024-10-14 03:55:45,901 INFO L226 Difference]: Without dead ends: 578 [2024-10-14 03:55:45,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:55:45,902 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 1243 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:45,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 951 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:55:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-10-14 03:55:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 356. [2024-10-14 03:55:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3333333333333333) internal successors, (460), 355 states have internal predecessors, (460), 0 states have call successors, (0), 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-10-14 03:55:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 460 transitions. [2024-10-14 03:55:45,912 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 460 transitions. Word has length 64 [2024-10-14 03:55:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:45,912 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 460 transitions. [2024-10-14 03:55:45,913 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-10-14 03:55:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 460 transitions. [2024-10-14 03:55:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:55:45,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:45,914 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-10-14 03:55:45,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:55:45,915 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-10-14 03:55:45,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1193853636, now seen corresponding path program 1 times [2024-10-14 03:55:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:45,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136009351] [2024-10-14 03:55:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:46,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:46,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:46,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136009351] [2024-10-14 03:55:46,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136009351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:46,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:46,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:46,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581087463] [2024-10-14 03:55:46,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:46,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:46,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:46,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:46,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:46,111 INFO L87 Difference]: Start difference. First operand 356 states and 460 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:46,516 INFO L93 Difference]: Finished difference Result 597 states and 779 transitions. [2024-10-14 03:55:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:55:46,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:46,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:46,518 INFO L225 Difference]: With dead ends: 597 [2024-10-14 03:55:46,518 INFO L226 Difference]: Without dead ends: 578 [2024-10-14 03:55:46,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:55:46,519 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 661 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:46,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1200 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:55:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-10-14 03:55:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 356. [2024-10-14 03:55:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.327536231884058) internal successors, (458), 355 states have internal predecessors, (458), 0 states have call successors, (0), 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-10-14 03:55:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 458 transitions. [2024-10-14 03:55:46,525 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 458 transitions. Word has length 65 [2024-10-14 03:55:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:46,525 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 458 transitions. [2024-10-14 03:55:46,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 458 transitions. [2024-10-14 03:55:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:55:46,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:46,526 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-10-14 03:55:46,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:55:46,526 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-10-14 03:55:46,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:46,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1508275324, now seen corresponding path program 1 times [2024-10-14 03:55:46,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:46,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484248252] [2024-10-14 03:55:46,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:46,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:46,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484248252] [2024-10-14 03:55:46,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484248252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:46,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:46,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937642096] [2024-10-14 03:55:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:46,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:46,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:46,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:46,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:46,736 INFO L87 Difference]: Start difference. First operand 356 states and 458 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:47,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:47,125 INFO L93 Difference]: Finished difference Result 563 states and 725 transitions. [2024-10-14 03:55:47,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:55:47,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:47,127 INFO L225 Difference]: With dead ends: 563 [2024-10-14 03:55:47,128 INFO L226 Difference]: Without dead ends: 557 [2024-10-14 03:55:47,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:55:47,129 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 1242 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:47,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 895 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:55:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-14 03:55:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 356. [2024-10-14 03:55:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3217391304347825) internal successors, (456), 355 states have internal predecessors, (456), 0 states have call successors, (0), 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-10-14 03:55:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 456 transitions. [2024-10-14 03:55:47,135 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 456 transitions. Word has length 65 [2024-10-14 03:55:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:47,135 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 456 transitions. [2024-10-14 03:55:47,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 456 transitions. [2024-10-14 03:55:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:55:47,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:47,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:55:47,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:55:47,137 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-10-14 03:55:47,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:47,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1207057476, now seen corresponding path program 1 times [2024-10-14 03:55:47,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:47,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970273116] [2024-10-14 03:55:47,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:47,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:47,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:47,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970273116] [2024-10-14 03:55:47,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970273116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:47,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:47,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:47,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658017722] [2024-10-14 03:55:47,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:47,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:47,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:47,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:47,314 INFO L87 Difference]: Start difference. First operand 356 states and 456 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:47,651 INFO L93 Difference]: Finished difference Result 591 states and 785 transitions. [2024-10-14 03:55:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:55:47,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:47,653 INFO L225 Difference]: With dead ends: 591 [2024-10-14 03:55:47,653 INFO L226 Difference]: Without dead ends: 414 [2024-10-14 03:55:47,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:55:47,654 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 623 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:47,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 850 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:55:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-14 03:55:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 356. [2024-10-14 03:55:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3159420289855073) internal successors, (454), 355 states have internal predecessors, (454), 0 states have call successors, (0), 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-10-14 03:55:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 454 transitions. [2024-10-14 03:55:47,659 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 454 transitions. Word has length 65 [2024-10-14 03:55:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:47,660 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 454 transitions. [2024-10-14 03:55:47,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 454 transitions. [2024-10-14 03:55:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:55:47,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:47,660 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-10-14 03:55:47,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:55:47,660 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-10-14 03:55:47,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1230734052, now seen corresponding path program 1 times [2024-10-14 03:55:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586111611] [2024-10-14 03:55:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:47,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:47,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586111611] [2024-10-14 03:55:47,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586111611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:47,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:47,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:47,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325784725] [2024-10-14 03:55:47,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:47,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:47,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:47,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:47,829 INFO L87 Difference]: Start difference. First operand 356 states and 454 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:48,223 INFO L93 Difference]: Finished difference Result 669 states and 880 transitions. [2024-10-14 03:55:48,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:55:48,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:48,225 INFO L225 Difference]: With dead ends: 669 [2024-10-14 03:55:48,225 INFO L226 Difference]: Without dead ends: 557 [2024-10-14 03:55:48,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:55:48,226 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 1235 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:48,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 895 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:55:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-14 03:55:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 356. [2024-10-14 03:55:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3130434782608695) internal successors, (453), 355 states have internal predecessors, (453), 0 states have call successors, (0), 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-10-14 03:55:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 453 transitions. [2024-10-14 03:55:48,232 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 453 transitions. Word has length 65 [2024-10-14 03:55:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:48,232 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 453 transitions. [2024-10-14 03:55:48,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 453 transitions. [2024-10-14 03:55:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:55:48,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:48,233 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-10-14 03:55:48,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:55:48,233 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-10-14 03:55:48,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash -873801820, now seen corresponding path program 1 times [2024-10-14 03:55:48,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:48,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277248861] [2024-10-14 03:55:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:48,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:48,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277248861] [2024-10-14 03:55:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277248861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:48,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60392268] [2024-10-14 03:55:48,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:48,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:48,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:48,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:48,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:48,412 INFO L87 Difference]: Start difference. First operand 356 states and 453 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:48,791 INFO L93 Difference]: Finished difference Result 703 states and 930 transitions. [2024-10-14 03:55:48,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:55:48,791 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:48,793 INFO L225 Difference]: With dead ends: 703 [2024-10-14 03:55:48,793 INFO L226 Difference]: Without dead ends: 578 [2024-10-14 03:55:48,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:55:48,794 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 650 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:48,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1215 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:55:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-10-14 03:55:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 356. [2024-10-14 03:55:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3101449275362318) internal successors, (452), 355 states have internal predecessors, (452), 0 states have call successors, (0), 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-10-14 03:55:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 452 transitions. [2024-10-14 03:55:48,801 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 452 transitions. Word has length 65 [2024-10-14 03:55:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:48,802 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 452 transitions. [2024-10-14 03:55:48,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-14 03:55:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 452 transitions. [2024-10-14 03:55:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:55:48,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:48,802 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-10-14 03:55:48,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:55:48,803 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-10-14 03:55:48,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash 106808155, now seen corresponding path program 1 times [2024-10-14 03:55:48,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:48,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043162473] [2024-10-14 03:55:48,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:50,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:50,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043162473] [2024-10-14 03:55:50,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043162473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:50,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:50,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-10-14 03:55:50,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675251164] [2024-10-14 03:55:50,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:50,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 03:55:50,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:50,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 03:55:50,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:55:50,062 INFO L87 Difference]: Start difference. First operand 356 states and 452 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:52,229 INFO L93 Difference]: Finished difference Result 872 states and 1151 transitions. [2024-10-14 03:55:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 03:55:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-14 03:55:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:52,232 INFO L225 Difference]: With dead ends: 872 [2024-10-14 03:55:52,232 INFO L226 Difference]: Without dead ends: 765 [2024-10-14 03:55:52,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=345, Invalid=1817, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 03:55:52,233 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 2000 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 2888 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2000 SdHoareTripleChecker+Valid, 5786 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:52,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2000 Valid, 5786 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2888 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:55:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-14 03:55:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 355. [2024-10-14 03:55:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 344 states have (on average 1.308139534883721) internal successors, (450), 354 states have internal predecessors, (450), 0 states have call successors, (0), 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-10-14 03:55:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 450 transitions. [2024-10-14 03:55:52,240 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 450 transitions. Word has length 66 [2024-10-14 03:55:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:52,240 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 450 transitions. [2024-10-14 03:55:52,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 450 transitions. [2024-10-14 03:55:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:55:52,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:52,241 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-10-14 03:55:52,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:55:52,241 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-10-14 03:55:52,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:52,241 INFO L85 PathProgramCache]: Analyzing trace with hash -543233893, now seen corresponding path program 1 times [2024-10-14 03:55:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:52,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927986152] [2024-10-14 03:55:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927986152] [2024-10-14 03:55:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927986152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:53,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:53,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-10-14 03:55:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586546660] [2024-10-14 03:55:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:53,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 03:55:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:53,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 03:55:53,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:55:53,340 INFO L87 Difference]: Start difference. First operand 355 states and 450 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:55,362 INFO L93 Difference]: Finished difference Result 871 states and 1149 transitions. [2024-10-14 03:55:55,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 03:55:55,362 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-14 03:55:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:55,364 INFO L225 Difference]: With dead ends: 871 [2024-10-14 03:55:55,364 INFO L226 Difference]: Without dead ends: 764 [2024-10-14 03:55:55,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=352, Invalid=1628, Unknown=0, NotChecked=0, Total=1980 [2024-10-14 03:55:55,367 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 1945 mSDsluCounter, 5614 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 5986 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:55,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 5986 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:55:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-10-14 03:55:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 366. [2024-10-14 03:55:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 355 states have (on average 1.3070422535211268) internal successors, (464), 365 states have internal predecessors, (464), 0 states have call successors, (0), 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-10-14 03:55:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 464 transitions. [2024-10-14 03:55:55,375 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 464 transitions. Word has length 66 [2024-10-14 03:55:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:55,375 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 464 transitions. [2024-10-14 03:55:55,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 464 transitions. [2024-10-14 03:55:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:55:55,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:55,376 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-10-14 03:55:55,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:55:55,376 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-10-14 03:55:55,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:55,377 INFO L85 PathProgramCache]: Analyzing trace with hash -89752069, now seen corresponding path program 1 times [2024-10-14 03:55:55,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:55,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162329820] [2024-10-14 03:55:55,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:55,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:55,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162329820] [2024-10-14 03:55:55,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162329820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:55,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:55,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:55:55,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074597776] [2024-10-14 03:55:55,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:55,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:55:55,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:55,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:55:55,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:55:55,745 INFO L87 Difference]: Start difference. First operand 366 states and 464 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 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-10-14 03:55:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:56,077 INFO L93 Difference]: Finished difference Result 619 states and 818 transitions. [2024-10-14 03:55:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:55:56,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 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-10-14 03:55:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:56,079 INFO L225 Difference]: With dead ends: 619 [2024-10-14 03:55:56,079 INFO L226 Difference]: Without dead ends: 432 [2024-10-14 03:55:56,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:55:56,080 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1137 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:56,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 895 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:55:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-14 03:55:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 285. [2024-10-14 03:55:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 278 states have (on average 1.316546762589928) internal successors, (366), 284 states have internal predecessors, (366), 0 states have call successors, (0), 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-10-14 03:55:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 366 transitions. [2024-10-14 03:55:56,087 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 366 transitions. Word has length 66 [2024-10-14 03:55:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:56,087 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 366 transitions. [2024-10-14 03:55:56,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 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-10-14 03:55:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 366 transitions. [2024-10-14 03:55:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:55:56,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:56,088 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-10-14 03:55:56,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:55:56,089 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-10-14 03:55:56,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1410161897, now seen corresponding path program 1 times [2024-10-14 03:55:56,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:56,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927938911] [2024-10-14 03:55:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:56,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:56,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927938911] [2024-10-14 03:55:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927938911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:56,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:55:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431443337] [2024-10-14 03:55:56,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:56,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:55:56,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:56,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:55:56,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:55:56,506 INFO L87 Difference]: Start difference. First operand 285 states and 366 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 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-10-14 03:55:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:56,929 INFO L93 Difference]: Finished difference Result 547 states and 743 transitions. [2024-10-14 03:55:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:55:56,929 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 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-10-14 03:55:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:56,930 INFO L225 Difference]: With dead ends: 547 [2024-10-14 03:55:56,931 INFO L226 Difference]: Without dead ends: 418 [2024-10-14 03:55:56,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:55:56,931 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1127 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:56,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 1321 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:55:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-14 03:55:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 262. [2024-10-14 03:55:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 1.3035019455252919) internal successors, (335), 261 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 335 transitions. [2024-10-14 03:55:56,937 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 335 transitions. Word has length 67 [2024-10-14 03:55:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:56,938 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 335 transitions. [2024-10-14 03:55:56,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 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-10-14 03:55:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 335 transitions. [2024-10-14 03:55:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:55:56,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:56,938 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-10-14 03:55:56,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:55:56,939 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:56,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:56,939 INFO L85 PathProgramCache]: Analyzing trace with hash 866774441, now seen corresponding path program 1 times [2024-10-14 03:55:56,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:56,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346352910] [2024-10-14 03:55:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:56,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:57,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346352910] [2024-10-14 03:55:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346352910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:55:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347053437] [2024-10-14 03:55:57,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:57,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:55:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:57,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:55:57,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:55:57,305 INFO L87 Difference]: Start difference. First operand 262 states and 335 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 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-10-14 03:55:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:57,601 INFO L93 Difference]: Finished difference Result 368 states and 493 transitions. [2024-10-14 03:55:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:55:57,602 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 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-10-14 03:55:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:57,602 INFO L225 Difference]: With dead ends: 368 [2024-10-14 03:55:57,602 INFO L226 Difference]: Without dead ends: 218 [2024-10-14 03:55:57,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:55:57,603 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 400 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:57,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 859 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:55:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-14 03:55:57,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-10-14 03:55:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 1.3055555555555556) internal successors, (282), 217 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 282 transitions. [2024-10-14 03:55:57,606 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 282 transitions. Word has length 67 [2024-10-14 03:55:57,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:57,606 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 282 transitions. [2024-10-14 03:55:57,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 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-10-14 03:55:57,606 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 282 transitions. [2024-10-14 03:55:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:55:57,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:57,606 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-10-14 03:55:57,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:55:57,607 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:57,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:57,607 INFO L85 PathProgramCache]: Analyzing trace with hash -535879959, now seen corresponding path program 1 times [2024-10-14 03:55:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:57,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221650744] [2024-10-14 03:55:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:57,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:57,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:57,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221650744] [2024-10-14 03:55:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221650744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:57,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:57,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:57,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233895642] [2024-10-14 03:55:57,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:57,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:57,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:57,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:57,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:57,748 INFO L87 Difference]: Start difference. First operand 218 states and 282 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 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-10-14 03:55:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:58,036 INFO L93 Difference]: Finished difference Result 518 states and 700 transitions. [2024-10-14 03:55:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:55:58,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 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-10-14 03:55:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:58,037 INFO L225 Difference]: With dead ends: 518 [2024-10-14 03:55:58,037 INFO L226 Difference]: Without dead ends: 378 [2024-10-14 03:55:58,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:55:58,038 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 348 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:58,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 668 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:55:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-14 03:55:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 218. [2024-10-14 03:55:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 217 states have internal predecessors, (280), 0 states have call successors, (0), 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-10-14 03:55:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 280 transitions. [2024-10-14 03:55:58,048 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 280 transitions. Word has length 69 [2024-10-14 03:55:58,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:58,048 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 280 transitions. [2024-10-14 03:55:58,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 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-10-14 03:55:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 280 transitions. [2024-10-14 03:55:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:55:58,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:58,049 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] [2024-10-14 03:55:58,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:55:58,049 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-10-14 03:55:58,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash 134483598, now seen corresponding path program 1 times [2024-10-14 03:55:58,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:58,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838514822] [2024-10-14 03:55:58,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:58,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:58,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838514822] [2024-10-14 03:55:58,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838514822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:58,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:58,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-14 03:55:58,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155191922] [2024-10-14 03:55:58,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:58,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 03:55:58,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:58,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 03:55:58,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:55:58,824 INFO L87 Difference]: Start difference. First operand 218 states and 280 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 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-10-14 03:55:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:59,660 INFO L93 Difference]: Finished difference Result 360 states and 477 transitions. [2024-10-14 03:55:59,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 03:55:59,661 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-14 03:55:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:59,662 INFO L225 Difference]: With dead ends: 360 [2024-10-14 03:55:59,662 INFO L226 Difference]: Without dead ends: 354 [2024-10-14 03:55:59,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=1294, Unknown=0, NotChecked=0, Total=1560 [2024-10-14 03:55:59,663 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 384 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:59,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1628 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:55:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-14 03:55:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 231. [2024-10-14 03:55:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 229 states have (on average 1.2925764192139737) internal successors, (296), 230 states have internal predecessors, (296), 0 states have call successors, (0), 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-10-14 03:55:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 296 transitions. [2024-10-14 03:55:59,667 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 296 transitions. Word has length 71 [2024-10-14 03:55:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:59,667 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 296 transitions. [2024-10-14 03:55:59,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 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-10-14 03:55:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 296 transitions. [2024-10-14 03:55:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 03:55:59,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:59,668 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-10-14 03:55:59,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:55:59,668 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-10-14 03:55:59,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1358946869, now seen corresponding path program 1 times [2024-10-14 03:55:59,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:59,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007667153] [2024-10-14 03:55:59,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:59,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:00,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:00,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007667153] [2024-10-14 03:56:00,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007667153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:00,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:00,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-14 03:56:00,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079833559] [2024-10-14 03:56:00,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:00,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 03:56:00,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:00,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 03:56:00,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:56:00,667 INFO L87 Difference]: Start difference. First operand 231 states and 296 transitions. Second operand has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 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-10-14 03:56:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:01,894 INFO L93 Difference]: Finished difference Result 367 states and 486 transitions. [2024-10-14 03:56:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 03:56:01,896 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 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-10-14 03:56:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:01,897 INFO L225 Difference]: With dead ends: 367 [2024-10-14 03:56:01,897 INFO L226 Difference]: Without dead ends: 361 [2024-10-14 03:56:01,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=248, Invalid=1158, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 03:56:01,897 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 554 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:01,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1783 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-14 03:56:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 232. [2024-10-14 03:56:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 230 states have (on average 1.291304347826087) internal successors, (297), 231 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 297 transitions. [2024-10-14 03:56:01,906 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 297 transitions. Word has length 72 [2024-10-14 03:56:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:01,906 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 297 transitions. [2024-10-14 03:56:01,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 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-10-14 03:56:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 297 transitions. [2024-10-14 03:56:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 03:56:01,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:01,907 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-10-14 03:56:01,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:56:01,907 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:01,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:01,907 INFO L85 PathProgramCache]: Analyzing trace with hash -389732210, now seen corresponding path program 1 times [2024-10-14 03:56:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:01,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498179549] [2024-10-14 03:56:01,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:01,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:02,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-10-14 03:56:02,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498179549] [2024-10-14 03:56:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498179549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:02,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:02,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:56:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995372237] [2024-10-14 03:56:02,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:02,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:56:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:02,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:56:02,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:56:02,309 INFO L87 Difference]: Start difference. First operand 232 states and 297 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 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-10-14 03:56:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:02,859 INFO L93 Difference]: Finished difference Result 619 states and 848 transitions. [2024-10-14 03:56:02,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:56:02,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 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-10-14 03:56:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:02,861 INFO L225 Difference]: With dead ends: 619 [2024-10-14 03:56:02,861 INFO L226 Difference]: Without dead ends: 613 [2024-10-14 03:56:02,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:56:02,862 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 808 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:02,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1670 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:56:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-10-14 03:56:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 212. [2024-10-14 03:56:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.2938388625592416) internal successors, (273), 211 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-10-14 03:56:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 273 transitions. [2024-10-14 03:56:02,867 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 273 transitions. Word has length 72 [2024-10-14 03:56:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:02,868 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 273 transitions. [2024-10-14 03:56:02,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 12 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-10-14 03:56:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 273 transitions. [2024-10-14 03:56:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:56:02,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:02,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:02,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:56:02,869 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-10-14 03:56:02,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash -668672694, now seen corresponding path program 1 times [2024-10-14 03:56:02,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936609004] [2024-10-14 03:56:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:02,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:02,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:02,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936609004] [2024-10-14 03:56:02,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936609004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:02,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:02,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:02,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282443048] [2024-10-14 03:56:02,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:02,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:02,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:02,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:02,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:02,952 INFO L87 Difference]: Start difference. First operand 212 states and 273 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:03,040 INFO L93 Difference]: Finished difference Result 1060 states and 1537 transitions. [2024-10-14 03:56:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:56:03,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-10-14 03:56:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:03,043 INFO L225 Difference]: With dead ends: 1060 [2024-10-14 03:56:03,043 INFO L226 Difference]: Without dead ends: 954 [2024-10-14 03:56:03,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:56:03,045 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 906 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:03,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 953 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:56:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-14 03:56:03,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 316. [2024-10-14 03:56:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.3523809523809525) internal successors, (426), 315 states have internal predecessors, (426), 0 states have call successors, (0), 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-10-14 03:56:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 426 transitions. [2024-10-14 03:56:03,053 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 426 transitions. Word has length 95 [2024-10-14 03:56:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:03,054 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 426 transitions. [2024-10-14 03:56:03,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 426 transitions. [2024-10-14 03:56:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:56:03,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:03,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:03,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:56:03,055 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-10-14 03:56:03,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:03,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1525557505, now seen corresponding path program 1 times [2024-10-14 03:56:03,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:03,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518077957] [2024-10-14 03:56:03,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:03,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:03,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:03,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518077957] [2024-10-14 03:56:03,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518077957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:03,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:03,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:03,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536175758] [2024-10-14 03:56:03,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:03,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:03,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:03,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:03,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:03,148 INFO L87 Difference]: Start difference. First operand 316 states and 426 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:03,208 INFO L93 Difference]: Finished difference Result 1262 states and 1824 transitions. [2024-10-14 03:56:03,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:03,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:56:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:03,211 INFO L225 Difference]: With dead ends: 1262 [2024-10-14 03:56:03,211 INFO L226 Difference]: Without dead ends: 1052 [2024-10-14 03:56:03,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:56:03,212 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 655 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:03,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 668 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-10-14 03:56:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 524. [2024-10-14 03:56:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.4034416826003824) internal successors, (734), 523 states have internal predecessors, (734), 0 states have call successors, (0), 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-10-14 03:56:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 734 transitions. [2024-10-14 03:56:03,224 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 734 transitions. Word has length 97 [2024-10-14 03:56:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:03,224 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 734 transitions. [2024-10-14 03:56:03,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 734 transitions. [2024-10-14 03:56:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:56:03,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:03,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:03,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:56:03,226 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-10-14 03:56:03,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:03,226 INFO L85 PathProgramCache]: Analyzing trace with hash -696655454, now seen corresponding path program 1 times [2024-10-14 03:56:03,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:03,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907839595] [2024-10-14 03:56:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:03,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907839595] [2024-10-14 03:56:03,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907839595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:03,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:03,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281500097] [2024-10-14 03:56:03,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:03,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:03,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:03,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:03,381 INFO L87 Difference]: Start difference. First operand 524 states and 734 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:03,444 INFO L93 Difference]: Finished difference Result 944 states and 1354 transitions. [2024-10-14 03:56:03,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:03,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:56:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:03,446 INFO L225 Difference]: With dead ends: 944 [2024-10-14 03:56:03,446 INFO L226 Difference]: Without dead ends: 526 [2024-10-14 03:56:03,447 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-10-14 03:56:03,447 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 75 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:03,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 457 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-14 03:56:03,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 524. [2024-10-14 03:56:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.395793499043977) internal successors, (730), 523 states have internal predecessors, (730), 0 states have call successors, (0), 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-10-14 03:56:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 730 transitions. [2024-10-14 03:56:03,457 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 730 transitions. Word has length 97 [2024-10-14 03:56:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:03,457 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 730 transitions. [2024-10-14 03:56:03,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 730 transitions. [2024-10-14 03:56:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:56:03,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:03,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:03,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 03:56:03,459 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-10-14 03:56:03,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash -763148966, now seen corresponding path program 1 times [2024-10-14 03:56:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010256423] [2024-10-14 03:56:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:03,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-10-14 03:56:03,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:03,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010256423] [2024-10-14 03:56:03,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010256423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:03,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:03,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:03,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658446121] [2024-10-14 03:56:03,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:03,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:03,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:03,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:03,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:03,499 INFO L87 Difference]: Start difference. First operand 524 states and 730 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:03,522 INFO L93 Difference]: Finished difference Result 1308 states and 1872 transitions. [2024-10-14 03:56:03,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:03,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:56:03,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:03,524 INFO L225 Difference]: With dead ends: 1308 [2024-10-14 03:56:03,524 INFO L226 Difference]: Without dead ends: 890 [2024-10-14 03:56:03,525 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-10-14 03:56:03,526 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 67 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 372 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-10-14 03:56:03,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 372 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-14 03:56:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2024-10-14 03:56:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 887 states have (on average 1.3979706877113867) internal successors, (1240), 887 states have internal predecessors, (1240), 0 states have call successors, (0), 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-10-14 03:56:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1240 transitions. [2024-10-14 03:56:03,537 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1240 transitions. Word has length 97 [2024-10-14 03:56:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:03,537 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1240 transitions. [2024-10-14 03:56:03,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1240 transitions. [2024-10-14 03:56:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:56:03,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:03,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:03,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 03:56:03,539 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-10-14 03:56:03,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:03,539 INFO L85 PathProgramCache]: Analyzing trace with hash -713677567, now seen corresponding path program 1 times [2024-10-14 03:56:03,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:03,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004182002] [2024-10-14 03:56:03,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:03,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:03,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004182002] [2024-10-14 03:56:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004182002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:03,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:03,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307291371] [2024-10-14 03:56:03,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:03,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:03,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:03,626 INFO L87 Difference]: Start difference. First operand 888 states and 1240 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:03,693 INFO L93 Difference]: Finished difference Result 2654 states and 3781 transitions. [2024-10-14 03:56:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:03,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:56:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:03,699 INFO L225 Difference]: With dead ends: 2654 [2024-10-14 03:56:03,699 INFO L226 Difference]: Without dead ends: 2262 [2024-10-14 03:56:03,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:56:03,701 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 622 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:03,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 682 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2024-10-14 03:56:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 1474. [2024-10-14 03:56:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1473 states have (on average 1.4120841819416157) internal successors, (2080), 1473 states have internal predecessors, (2080), 0 states have call successors, (0), 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-10-14 03:56:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2080 transitions. [2024-10-14 03:56:03,730 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2080 transitions. Word has length 97 [2024-10-14 03:56:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:03,730 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 2080 transitions. [2024-10-14 03:56:03,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2080 transitions. [2024-10-14 03:56:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:56:03,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:03,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:03,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 03:56:03,732 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-10-14 03:56:03,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:03,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1161471745, now seen corresponding path program 1 times [2024-10-14 03:56:03,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:03,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293256956] [2024-10-14 03:56:03,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:03,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:03,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:03,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293256956] [2024-10-14 03:56:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293256956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:03,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:03,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:03,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396085797] [2024-10-14 03:56:03,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:03,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:03,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:03,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:03,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:03,824 INFO L87 Difference]: Start difference. First operand 1474 states and 2080 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:03,901 INFO L93 Difference]: Finished difference Result 3044 states and 4341 transitions. [2024-10-14 03:56:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:03,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:56:03,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:03,908 INFO L225 Difference]: With dead ends: 3044 [2024-10-14 03:56:03,909 INFO L226 Difference]: Without dead ends: 2652 [2024-10-14 03:56:03,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:56:03,911 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 589 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:03,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 757 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:56:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2024-10-14 03:56:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 1864. [2024-10-14 03:56:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1863 states have (on average 1.4170692431561998) internal successors, (2640), 1863 states have internal predecessors, (2640), 0 states have call successors, (0), 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-10-14 03:56:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2640 transitions. [2024-10-14 03:56:03,938 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2640 transitions. Word has length 97 [2024-10-14 03:56:03,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:03,938 INFO L471 AbstractCegarLoop]: Abstraction has 1864 states and 2640 transitions. [2024-10-14 03:56:03,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2640 transitions. [2024-10-14 03:56:03,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:56:03,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:03,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:03,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 03:56:03,940 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-10-14 03:56:03,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:03,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2028950783, now seen corresponding path program 1 times [2024-10-14 03:56:03,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:03,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733039480] [2024-10-14 03:56:03,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:03,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:04,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733039480] [2024-10-14 03:56:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733039480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:04,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:04,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013062456] [2024-10-14 03:56:04,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:04,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:04,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:04,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:04,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:04,047 INFO L87 Difference]: Start difference. First operand 1864 states and 2640 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:04,169 INFO L93 Difference]: Finished difference Result 3434 states and 4901 transitions. [2024-10-14 03:56:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:04,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:56:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:04,177 INFO L225 Difference]: With dead ends: 3434 [2024-10-14 03:56:04,177 INFO L226 Difference]: Without dead ends: 3042 [2024-10-14 03:56:04,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:56:04,179 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 648 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:04,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 771 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:56:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2024-10-14 03:56:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2254. [2024-10-14 03:56:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 1.4203284509542833) internal successors, (3200), 2253 states have internal predecessors, (3200), 0 states have call successors, (0), 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-10-14 03:56:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3200 transitions. [2024-10-14 03:56:04,212 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3200 transitions. Word has length 97 [2024-10-14 03:56:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:04,212 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3200 transitions. [2024-10-14 03:56:04,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3200 transitions. [2024-10-14 03:56:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 03:56:04,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:04,213 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-10-14 03:56:04,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 03:56:04,213 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-10-14 03:56:04,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash -567395912, now seen corresponding path program 1 times [2024-10-14 03:56:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:04,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756253155] [2024-10-14 03:56:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:04,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:04,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756253155] [2024-10-14 03:56:04,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756253155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:04,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:04,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:04,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505516649] [2024-10-14 03:56:04,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:04,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:04,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:04,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:04,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:04,291 INFO L87 Difference]: Start difference. First operand 2254 states and 3200 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-10-14 03:56:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:04,314 INFO L93 Difference]: Finished difference Result 5714 states and 8136 transitions. [2024-10-14 03:56:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:04,315 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-10-14 03:56:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:04,326 INFO L225 Difference]: With dead ends: 5714 [2024-10-14 03:56:04,326 INFO L226 Difference]: Without dead ends: 3566 [2024-10-14 03:56:04,328 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-10-14 03:56:04,329 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 78 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:04,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2024-10-14 03:56:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 3388. [2024-10-14 03:56:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3388 states, 3387 states have (on average 1.4065544729849424) internal successors, (4764), 3387 states have internal predecessors, (4764), 0 states have call successors, (0), 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-10-14 03:56:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4764 transitions. [2024-10-14 03:56:04,374 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4764 transitions. Word has length 98 [2024-10-14 03:56:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:04,374 INFO L471 AbstractCegarLoop]: Abstraction has 3388 states and 4764 transitions. [2024-10-14 03:56:04,375 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-10-14 03:56:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4764 transitions. [2024-10-14 03:56:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:56:04,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:04,376 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-10-14 03:56:04,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 03:56:04,376 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-10-14 03:56:04,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:04,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1064867383, now seen corresponding path program 1 times [2024-10-14 03:56:04,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:04,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318251870] [2024-10-14 03:56:04,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:04,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:04,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-10-14 03:56:04,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318251870] [2024-10-14 03:56:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318251870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:04,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:04,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:04,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822483677] [2024-10-14 03:56:04,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:04,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:04,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:04,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:04,462 INFO L87 Difference]: Start difference. First operand 3388 states and 4764 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-10-14 03:56:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:04,486 INFO L93 Difference]: Finished difference Result 9688 states and 13600 transitions. [2024-10-14 03:56:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:04,487 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-10-14 03:56:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:04,495 INFO L225 Difference]: With dead ends: 9688 [2024-10-14 03:56:04,495 INFO L226 Difference]: Without dead ends: 6406 [2024-10-14 03:56:04,499 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-10-14 03:56:04,500 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:04,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 344 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2024-10-14 03:56:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 6140. [2024-10-14 03:56:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6140 states, 6139 states have (on average 1.3933865450399088) internal successors, (8554), 6139 states have internal predecessors, (8554), 0 states have call successors, (0), 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-10-14 03:56:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 8554 transitions. [2024-10-14 03:56:04,566 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 8554 transitions. Word has length 99 [2024-10-14 03:56:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:04,566 INFO L471 AbstractCegarLoop]: Abstraction has 6140 states and 8554 transitions. [2024-10-14 03:56:04,566 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-10-14 03:56:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 8554 transitions. [2024-10-14 03:56:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:56:04,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:04,567 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-10-14 03:56:04,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 03:56:04,568 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-10-14 03:56:04,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:04,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1967013372, now seen corresponding path program 1 times [2024-10-14 03:56:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:04,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49937373] [2024-10-14 03:56:04,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:04,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:04,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:04,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49937373] [2024-10-14 03:56:04,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49937373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:04,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:04,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:04,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235421339] [2024-10-14 03:56:04,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:04,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:04,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:04,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:04,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:04,664 INFO L87 Difference]: Start difference. First operand 6140 states and 8554 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-10-14 03:56:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:04,703 INFO L93 Difference]: Finished difference Result 17680 states and 24508 transitions. [2024-10-14 03:56:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:04,703 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-10-14 03:56:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:04,718 INFO L225 Difference]: With dead ends: 17680 [2024-10-14 03:56:04,718 INFO L226 Difference]: Without dead ends: 11646 [2024-10-14 03:56:04,725 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-10-14 03:56:04,726 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 64 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:04,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 344 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11646 states. [2024-10-14 03:56:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11646 to 11116. [2024-10-14 03:56:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11116 states, 11115 states have (on average 1.3743589743589744) internal successors, (15276), 11115 states have internal predecessors, (15276), 0 states have call successors, (0), 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-10-14 03:56:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11116 states to 11116 states and 15276 transitions. [2024-10-14 03:56:04,849 INFO L78 Accepts]: Start accepts. Automaton has 11116 states and 15276 transitions. Word has length 100 [2024-10-14 03:56:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:04,849 INFO L471 AbstractCegarLoop]: Abstraction has 11116 states and 15276 transitions. [2024-10-14 03:56:04,849 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-10-14 03:56:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 11116 states and 15276 transitions. [2024-10-14 03:56:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 03:56:04,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:04,850 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-10-14 03:56:04,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 03:56:04,851 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-10-14 03:56:04,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:04,851 INFO L85 PathProgramCache]: Analyzing trace with hash 28912981, now seen corresponding path program 1 times [2024-10-14 03:56:04,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:04,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865066269] [2024-10-14 03:56:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:04,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:04,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:04,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865066269] [2024-10-14 03:56:04,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865066269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:04,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:04,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754370458] [2024-10-14 03:56:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:04,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:04,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:04,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:04,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:04,927 INFO L87 Difference]: Start difference. First operand 11116 states and 15276 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-10-14 03:56:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:04,985 INFO L93 Difference]: Finished difference Result 32080 states and 43750 transitions. [2024-10-14 03:56:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:04,986 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-10-14 03:56:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:05,011 INFO L225 Difference]: With dead ends: 32080 [2024-10-14 03:56:05,012 INFO L226 Difference]: Without dead ends: 21070 [2024-10-14 03:56:05,025 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-10-14 03:56:05,025 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 54 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:05,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 343 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21070 states. [2024-10-14 03:56:05,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21070 to 20012. [2024-10-14 03:56:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20012 states, 20011 states have (on average 1.3494577982109839) internal successors, (27004), 20011 states have internal predecessors, (27004), 0 states have call successors, (0), 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-10-14 03:56:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20012 states to 20012 states and 27004 transitions. [2024-10-14 03:56:05,328 INFO L78 Accepts]: Start accepts. Automaton has 20012 states and 27004 transitions. Word has length 101 [2024-10-14 03:56:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:05,329 INFO L471 AbstractCegarLoop]: Abstraction has 20012 states and 27004 transitions. [2024-10-14 03:56:05,329 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-10-14 03:56:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 20012 states and 27004 transitions. [2024-10-14 03:56:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 03:56:05,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:05,330 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-10-14 03:56:05,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 03:56:05,330 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-10-14 03:56:05,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1790582352, now seen corresponding path program 1 times [2024-10-14 03:56:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:05,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941092204] [2024-10-14 03:56:05,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:05,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:05,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:05,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941092204] [2024-10-14 03:56:05,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941092204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:05,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:05,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:05,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011456329] [2024-10-14 03:56:05,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:05,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:05,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:05,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:05,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:05,489 INFO L87 Difference]: Start difference. First operand 20012 states and 27004 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 7 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-10-14 03:56:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:05,827 INFO L93 Difference]: Finished difference Result 60396 states and 81358 transitions. [2024-10-14 03:56:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:56:05,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 7 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-10-14 03:56:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:05,875 INFO L225 Difference]: With dead ends: 60396 [2024-10-14 03:56:05,876 INFO L226 Difference]: Without dead ends: 40476 [2024-10-14 03:56:05,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:56:05,898 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 329 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:05,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 602 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:56:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40476 states. [2024-10-14 03:56:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40476 to 20012. [2024-10-14 03:56:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20012 states, 20011 states have (on average 1.3493578531807506) internal successors, (27002), 20011 states have internal predecessors, (27002), 0 states have call successors, (0), 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-10-14 03:56:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20012 states to 20012 states and 27002 transitions. [2024-10-14 03:56:06,325 INFO L78 Accepts]: Start accepts. Automaton has 20012 states and 27002 transitions. Word has length 102 [2024-10-14 03:56:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:06,326 INFO L471 AbstractCegarLoop]: Abstraction has 20012 states and 27002 transitions. [2024-10-14 03:56:06,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 7 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-10-14 03:56:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 20012 states and 27002 transitions. [2024-10-14 03:56:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 03:56:06,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:06,326 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] [2024-10-14 03:56:06,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 03:56:06,327 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-10-14 03:56:06,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:06,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2036253269, now seen corresponding path program 1 times [2024-10-14 03:56:06,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:06,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815646975] [2024-10-14 03:56:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:06,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:06,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:06,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815646975] [2024-10-14 03:56:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815646975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:06,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915497869] [2024-10-14 03:56:06,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:06,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:06,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:06,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:06,569 INFO L87 Difference]: Start difference. First operand 20012 states and 27002 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 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-10-14 03:56:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:06,623 INFO L93 Difference]: Finished difference Result 20494 states and 27643 transitions. [2024-10-14 03:56:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:06,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-10-14 03:56:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:06,642 INFO L225 Difference]: With dead ends: 20494 [2024-10-14 03:56:06,642 INFO L226 Difference]: Without dead ends: 20492 [2024-10-14 03:56:06,648 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-10-14 03:56:06,651 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:06,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 766 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20492 states. [2024-10-14 03:56:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20492 to 20492. [2024-10-14 03:56:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20492 states, 20491 states have (on average 1.3318042067249036) internal successors, (27290), 20491 states have internal predecessors, (27290), 0 states have call successors, (0), 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-10-14 03:56:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20492 states to 20492 states and 27290 transitions. [2024-10-14 03:56:06,840 INFO L78 Accepts]: Start accepts. Automaton has 20492 states and 27290 transitions. Word has length 104 [2024-10-14 03:56:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:06,840 INFO L471 AbstractCegarLoop]: Abstraction has 20492 states and 27290 transitions. [2024-10-14 03:56:06,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 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-10-14 03:56:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 20492 states and 27290 transitions. [2024-10-14 03:56:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 03:56:06,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:06,841 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] [2024-10-14 03:56:06,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 03:56:06,841 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-10-14 03:56:06,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash 661946218, now seen corresponding path program 1 times [2024-10-14 03:56:06,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:06,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354419297] [2024-10-14 03:56:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:06,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354419297] [2024-10-14 03:56:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354419297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:06,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:06,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414353671] [2024-10-14 03:56:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:06,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:06,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:06,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:06,886 INFO L87 Difference]: Start difference. First operand 20492 states and 27290 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-10-14 03:56:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:07,030 INFO L93 Difference]: Finished difference Result 41520 states and 55332 transitions. [2024-10-14 03:56:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:07,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-10-14 03:56:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:07,050 INFO L225 Difference]: With dead ends: 41520 [2024-10-14 03:56:07,050 INFO L226 Difference]: Without dead ends: 21134 [2024-10-14 03:56:07,060 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-10-14 03:56:07,061 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 86 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:07,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 285 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21134 states. [2024-10-14 03:56:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21134 to 21132. [2024-10-14 03:56:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21132 states, 21131 states have (on average 1.3149401353461738) internal successors, (27786), 21131 states have internal predecessors, (27786), 0 states have call successors, (0), 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-10-14 03:56:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21132 states to 21132 states and 27786 transitions. [2024-10-14 03:56:07,240 INFO L78 Accepts]: Start accepts. Automaton has 21132 states and 27786 transitions. Word has length 104 [2024-10-14 03:56:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:07,240 INFO L471 AbstractCegarLoop]: Abstraction has 21132 states and 27786 transitions. [2024-10-14 03:56:07,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-10-14 03:56:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 21132 states and 27786 transitions. [2024-10-14 03:56:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 03:56:07,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:07,244 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] [2024-10-14 03:56:07,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-14 03:56:07,245 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-10-14 03:56:07,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:07,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1726707641, now seen corresponding path program 1 times [2024-10-14 03:56:07,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:07,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604771131] [2024-10-14 03:56:07,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:07,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:07,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604771131] [2024-10-14 03:56:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604771131] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:56:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801480248] [2024-10-14 03:56:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:07,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:56:07,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:56:07,712 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-10-14 03:56:07,712 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-10-14 03:56:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:07,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 03:56:07,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:56:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:08,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:56:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:10,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801480248] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:56:10,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:56:10,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2024-10-14 03:56:10,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201345218] [2024-10-14 03:56:10,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:56:10,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-14 03:56:10,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:10,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-14 03:56:10,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2024-10-14 03:56:10,326 INFO L87 Difference]: Start difference. First operand 21132 states and 27786 transitions. Second operand has 32 states, 32 states have (on average 11.21875) internal successors, (359), 31 states have internal predecessors, (359), 0 states have call successors, (0), 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-10-14 03:56:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:14,862 INFO L93 Difference]: Finished difference Result 175672 states and 229327 transitions. [2024-10-14 03:56:14,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-10-14 03:56:14,862 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.21875) internal successors, (359), 31 states have internal predecessors, (359), 0 states have call successors, (0), 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 131 [2024-10-14 03:56:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:15,045 INFO L225 Difference]: With dead ends: 175672 [2024-10-14 03:56:15,045 INFO L226 Difference]: Without dead ends: 154646 [2024-10-14 03:56:15,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4461 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2826, Invalid=13430, Unknown=0, NotChecked=0, Total=16256 [2024-10-14 03:56:15,095 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 3916 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3916 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 2590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:15,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3916 Valid, 2010 Invalid, 2590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:56:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154646 states. [2024-10-14 03:56:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154646 to 107310. [2024-10-14 03:56:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107310 states, 107309 states have (on average 1.3041403796512874) internal successors, (139946), 107309 states have internal predecessors, (139946), 0 states have call successors, (0), 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-10-14 03:56:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107310 states to 107310 states and 139946 transitions. [2024-10-14 03:56:16,882 INFO L78 Accepts]: Start accepts. Automaton has 107310 states and 139946 transitions. Word has length 131 [2024-10-14 03:56:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:16,883 INFO L471 AbstractCegarLoop]: Abstraction has 107310 states and 139946 transitions. [2024-10-14 03:56:16,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.21875) internal successors, (359), 31 states have internal predecessors, (359), 0 states have call successors, (0), 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-10-14 03:56:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 107310 states and 139946 transitions. [2024-10-14 03:56:16,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 03:56:16,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:16,898 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] [2024-10-14 03:56:16,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:56:17,099 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,SelfDestructingSolverStorable37 [2024-10-14 03:56:17,099 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-10-14 03:56:17,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1912935178, now seen corresponding path program 1 times [2024-10-14 03:56:17,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:17,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096130694] [2024-10-14 03:56:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:17,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:17,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:17,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096130694] [2024-10-14 03:56:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096130694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:56:17,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032504746] [2024-10-14 03:56:17,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:17,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:56:17,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:56:17,834 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-10-14 03:56:17,836 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-10-14 03:56:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:18,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 03:56:18,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:56:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:18,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:56:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:19,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032504746] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:56:19,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:56:19,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2024-10-14 03:56:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817531575] [2024-10-14 03:56:19,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:56:19,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-14 03:56:19,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:19,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-14 03:56:19,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-10-14 03:56:19,756 INFO L87 Difference]: Start difference. First operand 107310 states and 139946 transitions. Second operand has 32 states, 32 states have (on average 11.5) internal successors, (368), 31 states have internal predecessors, (368), 0 states have call successors, (0), 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-10-14 03:56:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:35,805 INFO L93 Difference]: Finished difference Result 1793803 states and 2379414 transitions. [2024-10-14 03:56:35,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2024-10-14 03:56:35,806 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.5) internal successors, (368), 31 states have internal predecessors, (368), 0 states have call successors, (0), 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-10-14 03:56:35,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:38,929 INFO L225 Difference]: With dead ends: 1793803 [2024-10-14 03:56:38,929 INFO L226 Difference]: Without dead ends: 1686661 [2024-10-14 03:56:39,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27224 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=8567, Invalid=62455, Unknown=0, NotChecked=0, Total=71022 [2024-10-14 03:56:39,611 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 5258 mSDsluCounter, 4424 mSDsCounter, 0 mSdLazyCounter, 7140 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5258 SdHoareTripleChecker+Valid, 4710 SdHoareTripleChecker+Invalid, 7214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 7140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:39,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5258 Valid, 4710 Invalid, 7214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 7140 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 03:56:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686661 states. [2024-10-14 03:56:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686661 to 450785.