/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 06:26:11,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 06:26:11,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 06:26:11,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 06:26:11,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 06:26:11,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 06:26:11,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 06:26:11,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 06:26:11,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 06:26:11,972 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 06:26:11,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 06:26:11,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 06:26:11,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 06:26:11,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 06:26:11,978 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 06:26:11,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 06:26:11,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 06:26:11,980 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 06:26:11,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 06:26:11,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 06:26:11,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 06:26:11,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 06:26:11,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 06:26:11,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 06:26:11,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 06:26:11,983 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 06:26:11,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 06:26:11,983 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 06:26:11,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 06:26:11,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 06:26:11,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 06:26:11,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 06:26:11,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:26:11,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 06:26:11,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 06:26:11,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 06:26:11,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 06:26:11,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 06:26:11,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 06:26:11,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 06:26:11,986 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 06:26:11,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 06:26:11,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 06:26:11,987 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: Use bitabs translation -> false [2023-12-16 06:26:12,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 06:26:12,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 06:26:12,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 06:26:12,266 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 06:26:12,267 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 06:26:12,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2023-12-16 06:26:13,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 06:26:13,739 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 06:26:13,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2023-12-16 06:26:13,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307956638/9972e9da4560450f94b1a61a5b7573cb/FLAG14a8a2375 [2023-12-16 06:26:13,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307956638/9972e9da4560450f94b1a61a5b7573cb [2023-12-16 06:26:13,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 06:26:13,793 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 06:26:13,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 06:26:13,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 06:26:13,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 06:26:13,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:26:13" (1/1) ... [2023-12-16 06:26:13,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d64020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:13, skipping insertion in model container [2023-12-16 06:26:13,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:26:13" (1/1) ... [2023-12-16 06:26:13,878 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 06:26:14,173 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2023-12-16 06:26:14,204 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2023-12-16 06:26:14,219 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2023-12-16 06:26:14,237 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2023-12-16 06:26:14,253 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2023-12-16 06:26:14,265 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2023-12-16 06:26:14,277 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2023-12-16 06:26:14,307 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2023-12-16 06:26:14,335 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2023-12-16 06:26:14,347 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2023-12-16 06:26:14,374 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2023-12-16 06:26:14,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:26:14,445 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 06:26:14,509 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18857,18870] [2023-12-16 06:26:14,529 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25957,25970] [2023-12-16 06:26:14,545 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29482,29495] [2023-12-16 06:26:14,554 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32880,32893] [2023-12-16 06:26:14,566 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36938,36951] [2023-12-16 06:26:14,573 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40412,40425] [2023-12-16 06:26:14,581 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43977,43990] [2023-12-16 06:26:14,588 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47412,47425] [2023-12-16 06:26:14,595 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[51091,51104] [2023-12-16 06:26:14,603 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54693,54706] [2023-12-16 06:26:14,610 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58222,58235] [2023-12-16 06:26:14,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:26:14,643 INFO L206 MainTranslator]: Completed translation [2023-12-16 06:26:14,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14 WrapperNode [2023-12-16 06:26:14,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 06:26:14,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 06:26:14,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 06:26:14,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 06:26:14,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,794 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2967 [2023-12-16 06:26:14,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 06:26:14,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 06:26:14,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 06:26:14,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 06:26:14,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,877 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]. [2023-12-16 06:26:14,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 06:26:14,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 06:26:14,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 06:26:14,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 06:26:14,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (1/1) ... [2023-12-16 06:26:14,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:26:14,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 06:26:15,010 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) [2023-12-16 06:26:15,020 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 [2023-12-16 06:26:15,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 06:26:15,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 06:26:15,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 06:26:15,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 06:26:15,255 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 06:26:15,257 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 06:26:16,596 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 06:26:16,656 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 06:26:16,656 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 06:26:16,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:26:16 BoogieIcfgContainer [2023-12-16 06:26:16,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 06:26:16,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 06:26:16,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 06:26:16,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 06:26:16,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:26:13" (1/3) ... [2023-12-16 06:26:16,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae173e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:26:16, skipping insertion in model container [2023-12-16 06:26:16,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:26:14" (2/3) ... [2023-12-16 06:26:16,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae173e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:26:16, skipping insertion in model container [2023-12-16 06:26:16,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:26:16" (3/3) ... [2023-12-16 06:26:16,667 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2023-12-16 06:26:16,683 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 06:26:16,683 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-12-16 06:26:16,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 06:26:16,760 INFO L357 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, mHoare=true, 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;@443abfbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 06:26:16,760 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-12-16 06:26:16,770 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) [2023-12-16 06:26:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 06:26:16,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:16,794 INFO L195 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] [2023-12-16 06:26:16,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:16,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:16,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1518492486, now seen corresponding path program 1 times [2023-12-16 06:26:16,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:16,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113508338] [2023-12-16 06:26:16,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:16,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:17,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:17,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113508338] [2023-12-16 06:26:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113508338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:17,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:17,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:26:17,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963284362] [2023-12-16 06:26:17,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:17,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:26:17,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:17,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:26:17,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:26:17,325 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) [2023-12-16 06:26:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:17,953 INFO L93 Difference]: Finished difference Result 780 states and 1329 transitions. [2023-12-16 06:26:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:26:17,955 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 [2023-12-16 06:26:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:17,968 INFO L225 Difference]: With dead ends: 780 [2023-12-16 06:26:17,969 INFO L226 Difference]: Without dead ends: 502 [2023-12-16 06:26:17,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:26:17,976 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 2431 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:17,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 537 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 06:26:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-12-16 06:26:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2023-12-16 06:26:18,028 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) [2023-12-16 06:26:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 626 transitions. [2023-12-16 06:26:18,030 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 626 transitions. Word has length 59 [2023-12-16 06:26:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:18,031 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 626 transitions. [2023-12-16 06:26:18,031 INFO L496 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) [2023-12-16 06:26:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 626 transitions. [2023-12-16 06:26:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 06:26:18,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:18,033 INFO L195 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] [2023-12-16 06:26:18,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 06:26:18,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:18,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1943729877, now seen corresponding path program 1 times [2023-12-16 06:26:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:18,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858925932] [2023-12-16 06:26:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858925932] [2023-12-16 06:26:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858925932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:18,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:18,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:26:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669132171] [2023-12-16 06:26:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:18,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:26:18,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:18,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:26:18,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:26:18,188 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) [2023-12-16 06:26:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:18,407 INFO L93 Difference]: Finished difference Result 600 states and 747 transitions. [2023-12-16 06:26:18,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:26:18,408 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 [2023-12-16 06:26:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:18,412 INFO L225 Difference]: With dead ends: 600 [2023-12-16 06:26:18,412 INFO L226 Difference]: Without dead ends: 350 [2023-12-16 06:26:18,414 INFO L412 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 [2023-12-16 06:26:18,416 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 1240 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2023-12-16 06:26:18,416 INFO L414 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] [2023-12-16 06:26:18,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-12-16 06:26:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2023-12-16 06:26:18,438 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) [2023-12-16 06:26:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 433 transitions. [2023-12-16 06:26:18,439 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 433 transitions. Word has length 59 [2023-12-16 06:26:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:18,440 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 433 transitions. [2023-12-16 06:26:18,442 INFO L496 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) [2023-12-16 06:26:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 433 transitions. [2023-12-16 06:26:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 06:26:18,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:18,445 INFO L195 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] [2023-12-16 06:26:18,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 06:26:18,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:18,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash -19682530, now seen corresponding path program 1 times [2023-12-16 06:26:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:18,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641690340] [2023-12-16 06:26:18,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:18,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:18,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:18,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641690340] [2023-12-16 06:26:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641690340] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:18,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:26:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515887364] [2023-12-16 06:26:18,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:18,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:26:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:18,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:26:18,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:26:18,641 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) [2023-12-16 06:26:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:18,895 INFO L93 Difference]: Finished difference Result 646 states and 817 transitions. [2023-12-16 06:26:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:26:18,896 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 [2023-12-16 06:26:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:18,898 INFO L225 Difference]: With dead ends: 646 [2023-12-16 06:26:18,898 INFO L226 Difference]: Without dead ends: 457 [2023-12-16 06:26:18,898 INFO L412 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 [2023-12-16 06:26:18,899 INFO L413 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 [2023-12-16 06:26:18,899 INFO L414 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] [2023-12-16 06:26:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-12-16 06:26:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 409. [2023-12-16 06:26:18,907 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) [2023-12-16 06:26:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 533 transitions. [2023-12-16 06:26:18,908 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 533 transitions. Word has length 59 [2023-12-16 06:26:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:18,908 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 533 transitions. [2023-12-16 06:26:18,909 INFO L496 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) [2023-12-16 06:26:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 533 transitions. [2023-12-16 06:26:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 06:26:18,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:18,910 INFO L195 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] [2023-12-16 06:26:18,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 06:26:18,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:18,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash -732780502, now seen corresponding path program 1 times [2023-12-16 06:26:18,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:18,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565107220] [2023-12-16 06:26:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:18,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:19,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:19,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565107220] [2023-12-16 06:26:19,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565107220] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:19,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:19,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:26:19,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267471865] [2023-12-16 06:26:19,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:19,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:26:19,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:19,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:26:19,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:26:19,007 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) [2023-12-16 06:26:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:19,157 INFO L93 Difference]: Finished difference Result 596 states and 784 transitions. [2023-12-16 06:26:19,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:26:19,158 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 [2023-12-16 06:26:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:19,159 INFO L225 Difference]: With dead ends: 596 [2023-12-16 06:26:19,160 INFO L226 Difference]: Without dead ends: 356 [2023-12-16 06:26:19,160 INFO L412 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 [2023-12-16 06:26:19,161 INFO L413 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 [2023-12-16 06:26:19,161 INFO L414 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] [2023-12-16 06:26:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-12-16 06:26:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2023-12-16 06:26:19,167 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) [2023-12-16 06:26:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 465 transitions. [2023-12-16 06:26:19,167 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 465 transitions. Word has length 61 [2023-12-16 06:26:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:19,168 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 465 transitions. [2023-12-16 06:26:19,168 INFO L496 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) [2023-12-16 06:26:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 465 transitions. [2023-12-16 06:26:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 06:26:19,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:19,169 INFO L195 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] [2023-12-16 06:26:19,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 06:26:19,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:19,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:19,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1082227329, now seen corresponding path program 1 times [2023-12-16 06:26:19,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:19,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900335504] [2023-12-16 06:26:19,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:19,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:19,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:19,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900335504] [2023-12-16 06:26:19,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900335504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:19,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:19,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:26:19,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534095959] [2023-12-16 06:26:19,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:19,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:26:19,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:26:19,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:26:19,470 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) [2023-12-16 06:26:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:20,045 INFO L93 Difference]: Finished difference Result 809 states and 1096 transitions. [2023-12-16 06:26:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:26:20,045 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 [2023-12-16 06:26:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:20,048 INFO L225 Difference]: With dead ends: 809 [2023-12-16 06:26:20,048 INFO L226 Difference]: Without dead ends: 665 [2023-12-16 06:26:20,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:26:20,049 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 1643 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:20,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 921 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 06:26:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-16 06:26:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 356. [2023-12-16 06:26:20,060 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) [2023-12-16 06:26:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 464 transitions. [2023-12-16 06:26:20,061 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 464 transitions. Word has length 63 [2023-12-16 06:26:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:20,062 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 464 transitions. [2023-12-16 06:26:20,062 INFO L496 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) [2023-12-16 06:26:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 464 transitions. [2023-12-16 06:26:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 06:26:20,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:20,063 INFO L195 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] [2023-12-16 06:26:20,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 06:26:20,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:20,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:20,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1413074335, now seen corresponding path program 1 times [2023-12-16 06:26:20,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:20,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574498652] [2023-12-16 06:26:20,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:20,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:20,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:20,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574498652] [2023-12-16 06:26:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574498652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:20,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:26:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414776229] [2023-12-16 06:26:20,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:20,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:26:20,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:20,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:26:20,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:26:20,363 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) [2023-12-16 06:26:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:20,992 INFO L93 Difference]: Finished difference Result 914 states and 1257 transitions. [2023-12-16 06:26:20,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:26:20,993 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 [2023-12-16 06:26:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:20,996 INFO L225 Difference]: With dead ends: 914 [2023-12-16 06:26:20,996 INFO L226 Difference]: Without dead ends: 794 [2023-12-16 06:26:20,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-16 06:26:20,997 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 1492 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:20,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1068 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 06:26:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2023-12-16 06:26:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 356. [2023-12-16 06:26:21,008 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) [2023-12-16 06:26:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 463 transitions. [2023-12-16 06:26:21,009 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 463 transitions. Word has length 63 [2023-12-16 06:26:21,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:21,009 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 463 transitions. [2023-12-16 06:26:21,009 INFO L496 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) [2023-12-16 06:26:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 463 transitions. [2023-12-16 06:26:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 06:26:21,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:21,011 INFO L195 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] [2023-12-16 06:26:21,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 06:26:21,011 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:21,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1960661089, now seen corresponding path program 1 times [2023-12-16 06:26:21,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:21,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632324903] [2023-12-16 06:26:21,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:21,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:21,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:21,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632324903] [2023-12-16 06:26:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632324903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:21,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:21,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 06:26:21,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768021160] [2023-12-16 06:26:21,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:21,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 06:26:21,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:21,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 06:26:21,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:26:21,308 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) [2023-12-16 06:26:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:21,641 INFO L93 Difference]: Finished difference Result 723 states and 945 transitions. [2023-12-16 06:26:21,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 06:26:21,641 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 [2023-12-16 06:26:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:21,644 INFO L225 Difference]: With dead ends: 723 [2023-12-16 06:26:21,644 INFO L226 Difference]: Without dead ends: 530 [2023-12-16 06:26:21,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:26:21,646 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 1295 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:21,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 671 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 06:26:21,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2023-12-16 06:26:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 356. [2023-12-16 06:26:21,653 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) [2023-12-16 06:26:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 462 transitions. [2023-12-16 06:26:21,654 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 462 transitions. Word has length 63 [2023-12-16 06:26:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:21,655 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 462 transitions. [2023-12-16 06:26:21,656 INFO L496 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) [2023-12-16 06:26:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 462 transitions. [2023-12-16 06:26:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-16 06:26:21,657 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:21,657 INFO L195 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] [2023-12-16 06:26:21,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 06:26:21,657 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:21,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:21,658 INFO L85 PathProgramCache]: Analyzing trace with hash 718759200, now seen corresponding path program 1 times [2023-12-16 06:26:21,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:21,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622774830] [2023-12-16 06:26:21,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:21,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:21,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:21,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622774830] [2023-12-16 06:26:21,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622774830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:21,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:21,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:26:21,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206455154] [2023-12-16 06:26:21,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:21,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:26:21,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:21,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:26:21,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:26:21,933 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) [2023-12-16 06:26:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:22,515 INFO L93 Difference]: Finished difference Result 882 states and 1206 transitions. [2023-12-16 06:26:22,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:26:22,516 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 [2023-12-16 06:26:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:22,519 INFO L225 Difference]: With dead ends: 882 [2023-12-16 06:26:22,519 INFO L226 Difference]: Without dead ends: 773 [2023-12-16 06:26:22,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-16 06:26:22,520 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1499 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:22,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 983 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 06:26:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-12-16 06:26:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 356. [2023-12-16 06:26:22,528 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) [2023-12-16 06:26:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 461 transitions. [2023-12-16 06:26:22,529 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 461 transitions. Word has length 64 [2023-12-16 06:26:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:22,530 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 461 transitions. [2023-12-16 06:26:22,530 INFO L496 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) [2023-12-16 06:26:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 461 transitions. [2023-12-16 06:26:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 06:26:22,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:22,531 INFO L195 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] [2023-12-16 06:26:22,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 06:26:22,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:22,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:22,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1193853636, now seen corresponding path program 1 times [2023-12-16 06:26:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:22,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801100276] [2023-12-16 06:26:22,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:22,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801100276] [2023-12-16 06:26:22,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801100276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:22,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:22,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:26:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38418637] [2023-12-16 06:26:22,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:22,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:26:22,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:22,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:26:22,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:26:22,797 INFO L87 Difference]: Start difference. First operand 356 states and 461 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) [2023-12-16 06:26:23,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:23,405 INFO L93 Difference]: Finished difference Result 813 states and 1100 transitions. [2023-12-16 06:26:23,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:26:23,406 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 [2023-12-16 06:26:23,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:23,409 INFO L225 Difference]: With dead ends: 813 [2023-12-16 06:26:23,409 INFO L226 Difference]: Without dead ends: 794 [2023-12-16 06:26:23,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-16 06:26:23,410 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 1443 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:23,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1443 Valid, 1101 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 06:26:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2023-12-16 06:26:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 356. [2023-12-16 06:26:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3304347826086957) internal successors, (459), 355 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 459 transitions. [2023-12-16 06:26:23,419 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 459 transitions. Word has length 65 [2023-12-16 06:26:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:23,419 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 459 transitions. [2023-12-16 06:26:23,420 INFO L496 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) [2023-12-16 06:26:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 459 transitions. [2023-12-16 06:26:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 06:26:23,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:23,420 INFO L195 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] [2023-12-16 06:26:23,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 06:26:23,421 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:23,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:23,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1508275324, now seen corresponding path program 1 times [2023-12-16 06:26:23,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:23,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792328236] [2023-12-16 06:26:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:23,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:23,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792328236] [2023-12-16 06:26:23,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792328236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:23,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:23,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:26:23,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799105246] [2023-12-16 06:26:23,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:23,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:26:23,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:23,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:26:23,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:26:23,634 INFO L87 Difference]: Start difference. First operand 356 states and 459 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) [2023-12-16 06:26:24,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:24,152 INFO L93 Difference]: Finished difference Result 779 states and 1047 transitions. [2023-12-16 06:26:24,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:26:24,153 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 [2023-12-16 06:26:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:24,155 INFO L225 Difference]: With dead ends: 779 [2023-12-16 06:26:24,155 INFO L226 Difference]: Without dead ends: 773 [2023-12-16 06:26:24,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:26:24,156 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 1425 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 1059 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.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:24,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1425 Valid, 1059 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 06:26:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-12-16 06:26:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 356. [2023-12-16 06:26:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3246376811594203) internal successors, (457), 355 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 457 transitions. [2023-12-16 06:26:24,165 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 457 transitions. Word has length 65 [2023-12-16 06:26:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:24,165 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 457 transitions. [2023-12-16 06:26:24,166 INFO L496 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) [2023-12-16 06:26:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 457 transitions. [2023-12-16 06:26:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 06:26:24,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:24,166 INFO L195 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] [2023-12-16 06:26:24,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 06:26:24,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:24,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1207057476, now seen corresponding path program 1 times [2023-12-16 06:26:24,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:24,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616106448] [2023-12-16 06:26:24,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:24,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:24,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:24,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616106448] [2023-12-16 06:26:24,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616106448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:24,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:24,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:26:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803542529] [2023-12-16 06:26:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:24,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:26:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:26:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:26:24,375 INFO L87 Difference]: Start difference. First operand 356 states and 457 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) [2023-12-16 06:26:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:24,806 INFO L93 Difference]: Finished difference Result 700 states and 947 transitions. [2023-12-16 06:26:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 06:26:24,807 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 [2023-12-16 06:26:24,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:24,809 INFO L225 Difference]: With dead ends: 700 [2023-12-16 06:26:24,809 INFO L226 Difference]: Without dead ends: 523 [2023-12-16 06:26:24,809 INFO L412 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 [2023-12-16 06:26:24,810 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 1359 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:24,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 907 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 06:26:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-12-16 06:26:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 356. [2023-12-16 06:26:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.318840579710145) internal successors, (455), 355 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 455 transitions. [2023-12-16 06:26:24,817 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 455 transitions. Word has length 65 [2023-12-16 06:26:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:24,817 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 455 transitions. [2023-12-16 06:26:24,817 INFO L496 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) [2023-12-16 06:26:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 455 transitions. [2023-12-16 06:26:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 06:26:24,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:24,818 INFO L195 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] [2023-12-16 06:26:24,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 06:26:24,818 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:24,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:24,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1230734052, now seen corresponding path program 1 times [2023-12-16 06:26:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:24,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199536139] [2023-12-16 06:26:24,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:24,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:24,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:24,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199536139] [2023-12-16 06:26:24,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199536139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:24,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:24,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:26:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524714688] [2023-12-16 06:26:24,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:24,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:26:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:24,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:26:24,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:26:24,997 INFO L87 Difference]: Start difference. First operand 356 states and 455 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) [2023-12-16 06:26:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:25,520 INFO L93 Difference]: Finished difference Result 885 states and 1202 transitions. [2023-12-16 06:26:25,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:26:25,520 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 [2023-12-16 06:26:25,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:25,523 INFO L225 Difference]: With dead ends: 885 [2023-12-16 06:26:25,523 INFO L226 Difference]: Without dead ends: 773 [2023-12-16 06:26:25,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:26:25,524 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 1407 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:25,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 1070 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 06:26:25,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-12-16 06:26:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 356. [2023-12-16 06:26:25,531 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) [2023-12-16 06:26:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 454 transitions. [2023-12-16 06:26:25,532 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 454 transitions. Word has length 65 [2023-12-16 06:26:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:25,532 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 454 transitions. [2023-12-16 06:26:25,533 INFO L496 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) [2023-12-16 06:26:25,533 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 454 transitions. [2023-12-16 06:26:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 06:26:25,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:25,533 INFO L195 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] [2023-12-16 06:26:25,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 06:26:25,534 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:25,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash -873801820, now seen corresponding path program 1 times [2023-12-16 06:26:25,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:25,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137547195] [2023-12-16 06:26:25,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:25,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:25,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137547195] [2023-12-16 06:26:25,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137547195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:25,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:25,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:26:25,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388544695] [2023-12-16 06:26:25,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:25,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:26:25,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:25,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:26:25,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:26:25,720 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) [2023-12-16 06:26:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:26,265 INFO L93 Difference]: Finished difference Result 919 states and 1251 transitions. [2023-12-16 06:26:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:26:26,265 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 [2023-12-16 06:26:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:26,268 INFO L225 Difference]: With dead ends: 919 [2023-12-16 06:26:26,268 INFO L226 Difference]: Without dead ends: 794 [2023-12-16 06:26:26,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:26:26,269 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 934 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:26,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1295 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 06:26:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2023-12-16 06:26:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 356. [2023-12-16 06:26:26,277 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) [2023-12-16 06:26:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 453 transitions. [2023-12-16 06:26:26,278 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 453 transitions. Word has length 65 [2023-12-16 06:26:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:26,278 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 453 transitions. [2023-12-16 06:26:26,278 INFO L496 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) [2023-12-16 06:26:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 453 transitions. [2023-12-16 06:26:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 06:26:26,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:26,279 INFO L195 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] [2023-12-16 06:26:26,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 06:26:26,279 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:26,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1099115196, now seen corresponding path program 1 times [2023-12-16 06:26:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:26,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200881530] [2023-12-16 06:26:26,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:26,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:26,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:26,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200881530] [2023-12-16 06:26:26,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200881530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:26,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:26,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:26:26,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505607958] [2023-12-16 06:26:26,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:26,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:26:26,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:26,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:26:26,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:26:26,476 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) [2023-12-16 06:26:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:27,011 INFO L93 Difference]: Finished difference Result 779 states and 1041 transitions. [2023-12-16 06:26:27,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:26:27,012 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 [2023-12-16 06:26:27,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:27,015 INFO L225 Difference]: With dead ends: 779 [2023-12-16 06:26:27,015 INFO L226 Difference]: Without dead ends: 773 [2023-12-16 06:26:27,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:26:27,016 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 1434 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:27,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 1199 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 06:26:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-12-16 06:26:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 356. [2023-12-16 06:26:27,023 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) [2023-12-16 06:26:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 452 transitions. [2023-12-16 06:26:27,024 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 452 transitions. Word has length 65 [2023-12-16 06:26:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:27,025 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 452 transitions. [2023-12-16 06:26:27,025 INFO L496 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) [2023-12-16 06:26:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 452 transitions. [2023-12-16 06:26:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 06:26:27,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:27,026 INFO L195 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] [2023-12-16 06:26:27,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 06:26:27,026 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:27,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash 106808155, now seen corresponding path program 1 times [2023-12-16 06:26:27,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:27,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307623521] [2023-12-16 06:26:27,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:28,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:28,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307623521] [2023-12-16 06:26:28,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307623521] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:28,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:28,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2023-12-16 06:26:28,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847058480] [2023-12-16 06:26:28,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:28,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-16 06:26:28,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:28,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-16 06:26:28,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2023-12-16 06:26:28,627 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) [2023-12-16 06:26:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:31,754 INFO L93 Difference]: Finished difference Result 898 states and 1175 transitions. [2023-12-16 06:26:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-16 06:26:31,754 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 [2023-12-16 06:26:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:31,758 INFO L225 Difference]: With dead ends: 898 [2023-12-16 06:26:31,758 INFO L226 Difference]: Without dead ends: 791 [2023-12-16 06:26:31,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=323, Invalid=1933, Unknown=0, NotChecked=0, Total=2256 [2023-12-16 06:26:31,760 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 2254 mSDsluCounter, 5808 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2254 SdHoareTripleChecker+Valid, 6232 SdHoareTripleChecker+Invalid, 3314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:31,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2254 Valid, 6232 Invalid, 3314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-16 06:26:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2023-12-16 06:26:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 355. [2023-12-16 06:26:31,767 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) [2023-12-16 06:26:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 450 transitions. [2023-12-16 06:26:31,768 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 450 transitions. Word has length 66 [2023-12-16 06:26:31,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:31,768 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 450 transitions. [2023-12-16 06:26:31,768 INFO L496 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) [2023-12-16 06:26:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 450 transitions. [2023-12-16 06:26:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 06:26:31,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:31,769 INFO L195 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] [2023-12-16 06:26:31,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 06:26:31,770 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:31,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash -543233893, now seen corresponding path program 1 times [2023-12-16 06:26:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:31,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011684607] [2023-12-16 06:26:31,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:32,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011684607] [2023-12-16 06:26:32,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011684607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:32,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:32,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 06:26:32,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180360630] [2023-12-16 06:26:32,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:32,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 06:26:32,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:32,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 06:26:32,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-16 06:26:32,182 INFO L87 Difference]: Start difference. First operand 355 states and 450 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) [2023-12-16 06:26:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:32,611 INFO L93 Difference]: Finished difference Result 889 states and 1183 transitions. [2023-12-16 06:26:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:26:32,612 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 [2023-12-16 06:26:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:32,614 INFO L225 Difference]: With dead ends: 889 [2023-12-16 06:26:32,614 INFO L226 Difference]: Without dead ends: 713 [2023-12-16 06:26:32,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2023-12-16 06:26:32,616 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 1544 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:32,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 1303 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:26:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2023-12-16 06:26:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 285. [2023-12-16 06:26:32,627 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) [2023-12-16 06:26:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 366 transitions. [2023-12-16 06:26:32,628 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 366 transitions. Word has length 66 [2023-12-16 06:26:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:32,628 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 366 transitions. [2023-12-16 06:26:32,628 INFO L496 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) [2023-12-16 06:26:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 366 transitions. [2023-12-16 06:26:32,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 06:26:32,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:32,631 INFO L195 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] [2023-12-16 06:26:32,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 06:26:32,631 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:32,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1410161897, now seen corresponding path program 1 times [2023-12-16 06:26:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:32,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372113208] [2023-12-16 06:26:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:33,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:33,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372113208] [2023-12-16 06:26:33,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372113208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:33,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:33,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 06:26:33,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253970469] [2023-12-16 06:26:33,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:33,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 06:26:33,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:33,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 06:26:33,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:26:33,089 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) [2023-12-16 06:26:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:33,757 INFO L93 Difference]: Finished difference Result 1043 states and 1457 transitions. [2023-12-16 06:26:33,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 06:26:33,760 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 [2023-12-16 06:26:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:33,764 INFO L225 Difference]: With dead ends: 1043 [2023-12-16 06:26:33,764 INFO L226 Difference]: Without dead ends: 914 [2023-12-16 06:26:33,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2023-12-16 06:26:33,765 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 1221 mSDsluCounter, 2676 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 3204 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:33,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 3204 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 06:26:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-12-16 06:26:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 262. [2023-12-16 06:26:33,773 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) [2023-12-16 06:26:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 335 transitions. [2023-12-16 06:26:33,774 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 335 transitions. Word has length 67 [2023-12-16 06:26:33,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:33,774 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 335 transitions. [2023-12-16 06:26:33,775 INFO L496 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) [2023-12-16 06:26:33,775 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 335 transitions. [2023-12-16 06:26:33,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 06:26:33,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:33,775 INFO L195 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] [2023-12-16 06:26:33,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 06:26:33,776 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:33,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash 866774441, now seen corresponding path program 1 times [2023-12-16 06:26:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:33,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527065920] [2023-12-16 06:26:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:33,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:34,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:34,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527065920] [2023-12-16 06:26:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527065920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:34,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:34,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-12-16 06:26:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127660837] [2023-12-16 06:26:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:34,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-16 06:26:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:34,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-16 06:26:34,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2023-12-16 06:26:34,669 INFO L87 Difference]: Start difference. First operand 262 states and 335 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 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) [2023-12-16 06:26:35,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:35,856 INFO L93 Difference]: Finished difference Result 299 states and 372 transitions. [2023-12-16 06:26:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 06:26:35,857 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 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 [2023-12-16 06:26:35,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:35,858 INFO L225 Difference]: With dead ends: 299 [2023-12-16 06:26:35,858 INFO L226 Difference]: Without dead ends: 286 [2023-12-16 06:26:35,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 06:26:35,859 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 465 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2319 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:35,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 2319 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 06:26:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-16 06:26:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 269. [2023-12-16 06:26:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.2992424242424243) internal successors, (343), 268 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 343 transitions. [2023-12-16 06:26:35,864 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 343 transitions. Word has length 67 [2023-12-16 06:26:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:35,865 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 343 transitions. [2023-12-16 06:26:35,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 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) [2023-12-16 06:26:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 343 transitions. [2023-12-16 06:26:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 06:26:35,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:35,866 INFO L195 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] [2023-12-16 06:26:35,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 06:26:35,866 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:35,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:35,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1780474025, now seen corresponding path program 1 times [2023-12-16 06:26:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:35,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32630656] [2023-12-16 06:26:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:35,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:36,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:36,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32630656] [2023-12-16 06:26:36,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32630656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:36,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:36,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-12-16 06:26:36,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572631962] [2023-12-16 06:26:36,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:36,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 06:26:36,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:36,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 06:26:36,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2023-12-16 06:26:36,613 INFO L87 Difference]: Start difference. First operand 269 states and 343 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 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) [2023-12-16 06:26:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:37,665 INFO L93 Difference]: Finished difference Result 291 states and 363 transitions. [2023-12-16 06:26:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 06:26:37,666 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 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 [2023-12-16 06:26:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:37,668 INFO L225 Difference]: With dead ends: 291 [2023-12-16 06:26:37,668 INFO L226 Difference]: Without dead ends: 284 [2023-12-16 06:26:37,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 06:26:37,669 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 403 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:37,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 2376 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 06:26:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-12-16 06:26:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 269. [2023-12-16 06:26:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.2954545454545454) internal successors, (342), 268 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 342 transitions. [2023-12-16 06:26:37,674 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 342 transitions. Word has length 67 [2023-12-16 06:26:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:37,674 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 342 transitions. [2023-12-16 06:26:37,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 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) [2023-12-16 06:26:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 342 transitions. [2023-12-16 06:26:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 06:26:37,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:37,675 INFO L195 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] [2023-12-16 06:26:37,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 06:26:37,675 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:37,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:37,676 INFO L85 PathProgramCache]: Analyzing trace with hash -588581152, now seen corresponding path program 1 times [2023-12-16 06:26:37,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:37,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668001510] [2023-12-16 06:26:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:37,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:38,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:38,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668001510] [2023-12-16 06:26:38,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668001510] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:38,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:38,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-16 06:26:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719816353] [2023-12-16 06:26:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:38,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 06:26:38,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:38,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 06:26:38,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-12-16 06:26:38,285 INFO L87 Difference]: Start difference. First operand 269 states and 342 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 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) [2023-12-16 06:26:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:38,970 INFO L93 Difference]: Finished difference Result 781 states and 1065 transitions. [2023-12-16 06:26:38,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 06:26:38,971 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 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 [2023-12-16 06:26:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:38,973 INFO L225 Difference]: With dead ends: 781 [2023-12-16 06:26:38,973 INFO L226 Difference]: Without dead ends: 639 [2023-12-16 06:26:38,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2023-12-16 06:26:38,975 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 719 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:38,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2215 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 06:26:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-12-16 06:26:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 260. [2023-12-16 06:26:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 255 states have (on average 1.2862745098039217) internal successors, (328), 259 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 328 transitions. [2023-12-16 06:26:38,985 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 328 transitions. Word has length 67 [2023-12-16 06:26:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:38,985 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 328 transitions. [2023-12-16 06:26:38,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 14 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) [2023-12-16 06:26:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 328 transitions. [2023-12-16 06:26:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-16 06:26:38,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:38,986 INFO L195 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] [2023-12-16 06:26:38,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 06:26:38,987 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:38,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash 183577999, now seen corresponding path program 1 times [2023-12-16 06:26:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:38,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454118903] [2023-12-16 06:26:38,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:38,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:39,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:39,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454118903] [2023-12-16 06:26:39,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454118903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:39,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:39,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-16 06:26:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848086329] [2023-12-16 06:26:39,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:39,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 06:26:39,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:39,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 06:26:39,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2023-12-16 06:26:39,653 INFO L87 Difference]: Start difference. First operand 260 states and 328 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:40,879 INFO L93 Difference]: Finished difference Result 836 states and 1122 transitions. [2023-12-16 06:26:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 06:26:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-12-16 06:26:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:40,887 INFO L225 Difference]: With dead ends: 836 [2023-12-16 06:26:40,887 INFO L226 Difference]: Without dead ends: 832 [2023-12-16 06:26:40,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 06:26:40,888 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 1604 mSDsluCounter, 2718 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:40,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 2981 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 06:26:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-12-16 06:26:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 255. [2023-12-16 06:26:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.2868525896414342) internal successors, (323), 254 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 323 transitions. [2023-12-16 06:26:40,896 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 323 transitions. Word has length 68 [2023-12-16 06:26:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:40,896 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 323 transitions. [2023-12-16 06:26:40,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 323 transitions. [2023-12-16 06:26:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-16 06:26:40,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:40,897 INFO L195 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] [2023-12-16 06:26:40,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 06:26:40,897 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:40,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:40,898 INFO L85 PathProgramCache]: Analyzing trace with hash 734420341, now seen corresponding path program 1 times [2023-12-16 06:26:40,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:40,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933539855] [2023-12-16 06:26:40,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:40,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:41,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:41,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933539855] [2023-12-16 06:26:41,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933539855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:41,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:41,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 06:26:41,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643434520] [2023-12-16 06:26:41,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:41,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 06:26:41,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:41,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 06:26:41,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:26:41,297 INFO L87 Difference]: Start difference. First operand 255 states and 323 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:41,687 INFO L93 Difference]: Finished difference Result 411 states and 540 transitions. [2023-12-16 06:26:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:26:41,689 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-12-16 06:26:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:41,690 INFO L225 Difference]: With dead ends: 411 [2023-12-16 06:26:41,691 INFO L226 Difference]: Without dead ends: 374 [2023-12-16 06:26:41,691 INFO L412 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 [2023-12-16 06:26:41,691 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 625 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:41,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1686 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:26:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-12-16 06:26:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 218. [2023-12-16 06:26:41,696 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) [2023-12-16 06:26:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 282 transitions. [2023-12-16 06:26:41,696 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 282 transitions. Word has length 68 [2023-12-16 06:26:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:41,697 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 282 transitions. [2023-12-16 06:26:41,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 282 transitions. [2023-12-16 06:26:41,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-16 06:26:41,697 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:41,697 INFO L195 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] [2023-12-16 06:26:41,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 06:26:41,698 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:41,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash -535879959, now seen corresponding path program 1 times [2023-12-16 06:26:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:41,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602134886] [2023-12-16 06:26:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:41,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:41,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602134886] [2023-12-16 06:26:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602134886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:41,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:41,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:26:41,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367409931] [2023-12-16 06:26:41,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:41,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:26:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:41,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:26:41,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:26:41,863 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) [2023-12-16 06:26:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:42,149 INFO L93 Difference]: Finished difference Result 518 states and 700 transitions. [2023-12-16 06:26:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 06:26:42,150 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 [2023-12-16 06:26:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:42,151 INFO L225 Difference]: With dead ends: 518 [2023-12-16 06:26:42,151 INFO L226 Difference]: Without dead ends: 378 [2023-12-16 06:26:42,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2023-12-16 06:26:42,153 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 613 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:42,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 542 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:26:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-12-16 06:26:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 218. [2023-12-16 06:26:42,157 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) [2023-12-16 06:26:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 280 transitions. [2023-12-16 06:26:42,158 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 280 transitions. Word has length 69 [2023-12-16 06:26:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:42,158 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 280 transitions. [2023-12-16 06:26:42,158 INFO L496 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) [2023-12-16 06:26:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 280 transitions. [2023-12-16 06:26:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-16 06:26:42,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:42,159 INFO L195 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] [2023-12-16 06:26:42,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 06:26:42,159 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:42,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash 134483598, now seen corresponding path program 1 times [2023-12-16 06:26:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:42,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85336037] [2023-12-16 06:26:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:43,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:43,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85336037] [2023-12-16 06:26:43,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85336037] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:43,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:43,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-12-16 06:26:43,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037456594] [2023-12-16 06:26:43,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:43,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 06:26:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 06:26:43,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2023-12-16 06:26:43,162 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) [2023-12-16 06:26:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:44,752 INFO L93 Difference]: Finished difference Result 811 states and 1136 transitions. [2023-12-16 06:26:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-16 06:26:44,752 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 [2023-12-16 06:26:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:44,755 INFO L225 Difference]: With dead ends: 811 [2023-12-16 06:26:44,755 INFO L226 Difference]: Without dead ends: 805 [2023-12-16 06:26:44,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2023-12-16 06:26:44,757 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 1048 mSDsluCounter, 2961 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 3158 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:44,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 3158 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 06:26:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2023-12-16 06:26:44,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 231. [2023-12-16 06:26:44,765 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) [2023-12-16 06:26:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 296 transitions. [2023-12-16 06:26:44,765 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 296 transitions. Word has length 71 [2023-12-16 06:26:44,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:44,766 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 296 transitions. [2023-12-16 06:26:44,766 INFO L496 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) [2023-12-16 06:26:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 296 transitions. [2023-12-16 06:26:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 06:26:44,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:44,766 INFO L195 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] [2023-12-16 06:26:44,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-16 06:26:44,767 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:44,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1358946869, now seen corresponding path program 1 times [2023-12-16 06:26:44,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:44,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215206857] [2023-12-16 06:26:44,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:45,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215206857] [2023-12-16 06:26:45,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215206857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:45,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:45,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 06:26:45,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127198583] [2023-12-16 06:26:45,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:45,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 06:26:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:45,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 06:26:45,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:26:45,153 INFO L87 Difference]: Start difference. First operand 231 states and 296 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 11 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) [2023-12-16 06:26:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:45,627 INFO L93 Difference]: Finished difference Result 611 states and 838 transitions. [2023-12-16 06:26:45,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 06:26:45,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 11 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 [2023-12-16 06:26:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:45,629 INFO L225 Difference]: With dead ends: 611 [2023-12-16 06:26:45,629 INFO L226 Difference]: Without dead ends: 605 [2023-12-16 06:26:45,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2023-12-16 06:26:45,630 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 842 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:45,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1607 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:26:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2023-12-16 06:26:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 212. [2023-12-16 06:26:45,640 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) [2023-12-16 06:26:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 273 transitions. [2023-12-16 06:26:45,641 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 273 transitions. Word has length 72 [2023-12-16 06:26:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:45,641 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 273 transitions. [2023-12-16 06:26:45,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 11 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) [2023-12-16 06:26:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 273 transitions. [2023-12-16 06:26:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 06:26:45,642 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:45,642 INFO L195 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] [2023-12-16 06:26:45,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 06:26:45,643 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:45,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash -668672694, now seen corresponding path program 1 times [2023-12-16 06:26:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679922376] [2023-12-16 06:26:45,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:45,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:45,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679922376] [2023-12-16 06:26:45,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679922376] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:45,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:45,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 06:26:45,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118627008] [2023-12-16 06:26:45,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:45,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:26:45,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:45,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:26:45,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:26:45,748 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) [2023-12-16 06:26:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:45,839 INFO L93 Difference]: Finished difference Result 1060 states and 1537 transitions. [2023-12-16 06:26:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 06:26:45,840 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 [2023-12-16 06:26:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:45,843 INFO L225 Difference]: With dead ends: 1060 [2023-12-16 06:26:45,843 INFO L226 Difference]: Without dead ends: 954 [2023-12-16 06:26:45,843 INFO L412 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 [2023-12-16 06:26:45,844 INFO L413 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 [2023-12-16 06:26:45,845 INFO L414 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] [2023-12-16 06:26:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2023-12-16 06:26:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 316. [2023-12-16 06:26:45,857 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) [2023-12-16 06:26:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 426 transitions. [2023-12-16 06:26:45,858 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 426 transitions. Word has length 95 [2023-12-16 06:26:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:45,858 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 426 transitions. [2023-12-16 06:26:45,859 INFO L496 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) [2023-12-16 06:26:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 426 transitions. [2023-12-16 06:26:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 06:26:45,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:45,860 INFO L195 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] [2023-12-16 06:26:45,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-16 06:26:45,860 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:45,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1525557505, now seen corresponding path program 1 times [2023-12-16 06:26:45,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:45,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651523354] [2023-12-16 06:26:45,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:45,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:45,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651523354] [2023-12-16 06:26:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651523354] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:45,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 06:26:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906615408] [2023-12-16 06:26:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:45,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:26:45,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:45,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:26:45,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:26:45,973 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) [2023-12-16 06:26:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:46,036 INFO L93 Difference]: Finished difference Result 1262 states and 1824 transitions. [2023-12-16 06:26:46,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:26:46,040 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 [2023-12-16 06:26:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:46,044 INFO L225 Difference]: With dead ends: 1262 [2023-12-16 06:26:46,044 INFO L226 Difference]: Without dead ends: 1052 [2023-12-16 06:26:46,045 INFO L412 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 [2023-12-16 06:26:46,045 INFO L413 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 [2023-12-16 06:26:46,046 INFO L414 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] [2023-12-16 06:26:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2023-12-16 06:26:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 524. [2023-12-16 06:26:46,056 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) [2023-12-16 06:26:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 734 transitions. [2023-12-16 06:26:46,057 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 734 transitions. Word has length 97 [2023-12-16 06:26:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:46,058 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 734 transitions. [2023-12-16 06:26:46,058 INFO L496 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) [2023-12-16 06:26:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 734 transitions. [2023-12-16 06:26:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 06:26:46,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:46,059 INFO L195 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] [2023-12-16 06:26:46,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-16 06:26:46,059 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:46,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:46,059 INFO L85 PathProgramCache]: Analyzing trace with hash -696655454, now seen corresponding path program 1 times [2023-12-16 06:26:46,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:46,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090309404] [2023-12-16 06:26:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:46,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:46,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090309404] [2023-12-16 06:26:46,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090309404] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:46,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:46,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 06:26:46,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426139977] [2023-12-16 06:26:46,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:46,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:26:46,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:46,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:26:46,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:26:46,238 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) [2023-12-16 06:26:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:46,307 INFO L93 Difference]: Finished difference Result 944 states and 1354 transitions. [2023-12-16 06:26:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:26:46,308 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 [2023-12-16 06:26:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:46,309 INFO L225 Difference]: With dead ends: 944 [2023-12-16 06:26:46,310 INFO L226 Difference]: Without dead ends: 526 [2023-12-16 06:26:46,310 INFO L412 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 [2023-12-16 06:26:46,311 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 201 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:46,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 382 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:26:46,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-12-16 06:26:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 524. [2023-12-16 06:26:46,318 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) [2023-12-16 06:26:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 730 transitions. [2023-12-16 06:26:46,319 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 730 transitions. Word has length 97 [2023-12-16 06:26:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:46,319 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 730 transitions. [2023-12-16 06:26:46,319 INFO L496 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) [2023-12-16 06:26:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 730 transitions. [2023-12-16 06:26:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 06:26:46,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:46,320 INFO L195 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] [2023-12-16 06:26:46,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-16 06:26:46,321 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:46,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:46,321 INFO L85 PathProgramCache]: Analyzing trace with hash -763148966, now seen corresponding path program 1 times [2023-12-16 06:26:46,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:46,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900710555] [2023-12-16 06:26:46,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:46,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:46,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900710555] [2023-12-16 06:26:46,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900710555] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:46,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:46,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:26:46,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599352734] [2023-12-16 06:26:46,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:46,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:26:46,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:46,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:26:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:26:46,369 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) [2023-12-16 06:26:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:46,388 INFO L93 Difference]: Finished difference Result 1308 states and 1872 transitions. [2023-12-16 06:26:46,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:26:46,388 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 [2023-12-16 06:26:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:46,391 INFO L225 Difference]: With dead ends: 1308 [2023-12-16 06:26:46,391 INFO L226 Difference]: Without dead ends: 890 [2023-12-16 06:26:46,392 INFO L412 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 [2023-12-16 06:26:46,393 INFO L413 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 [2023-12-16 06:26:46,393 INFO L414 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] [2023-12-16 06:26:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-12-16 06:26:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2023-12-16 06:26:46,404 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) [2023-12-16 06:26:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1240 transitions. [2023-12-16 06:26:46,406 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1240 transitions. Word has length 97 [2023-12-16 06:26:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:46,406 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1240 transitions. [2023-12-16 06:26:46,406 INFO L496 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) [2023-12-16 06:26:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1240 transitions. [2023-12-16 06:26:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 06:26:46,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:46,408 INFO L195 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] [2023-12-16 06:26:46,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-16 06:26:46,408 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:46,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash -713677567, now seen corresponding path program 1 times [2023-12-16 06:26:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:46,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044074287] [2023-12-16 06:26:46,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:46,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044074287] [2023-12-16 06:26:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044074287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:46,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:46,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 06:26:46,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725842368] [2023-12-16 06:26:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:46,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:26:46,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:26:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:26:46,510 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) [2023-12-16 06:26:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:46,579 INFO L93 Difference]: Finished difference Result 2654 states and 3781 transitions. [2023-12-16 06:26:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:26:46,579 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 [2023-12-16 06:26:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:46,586 INFO L225 Difference]: With dead ends: 2654 [2023-12-16 06:26:46,586 INFO L226 Difference]: Without dead ends: 2262 [2023-12-16 06:26:46,587 INFO L412 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 [2023-12-16 06:26:46,588 INFO L413 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 [2023-12-16 06:26:46,588 INFO L414 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] [2023-12-16 06:26:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2023-12-16 06:26:46,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 1474. [2023-12-16 06:26:46,610 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) [2023-12-16 06:26:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2080 transitions. [2023-12-16 06:26:46,612 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2080 transitions. Word has length 97 [2023-12-16 06:26:46,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:46,612 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 2080 transitions. [2023-12-16 06:26:46,613 INFO L496 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) [2023-12-16 06:26:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2080 transitions. [2023-12-16 06:26:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 06:26:46,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:46,614 INFO L195 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] [2023-12-16 06:26:46,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-16 06:26:46,614 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:46,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:46,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1161471745, now seen corresponding path program 1 times [2023-12-16 06:26:46,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:46,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721619560] [2023-12-16 06:26:46,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:46,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:46,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:46,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:46,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721619560] [2023-12-16 06:26:46,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721619560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:46,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:46,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 06:26:46,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191771630] [2023-12-16 06:26:46,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:46,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:26:46,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:46,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:26:46,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:26:46,717 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) [2023-12-16 06:26:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:46,802 INFO L93 Difference]: Finished difference Result 3044 states and 4341 transitions. [2023-12-16 06:26:46,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:26:46,802 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 [2023-12-16 06:26:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:46,810 INFO L225 Difference]: With dead ends: 3044 [2023-12-16 06:26:46,810 INFO L226 Difference]: Without dead ends: 2652 [2023-12-16 06:26:46,812 INFO L412 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 [2023-12-16 06:26:46,812 INFO L413 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 [2023-12-16 06:26:46,812 INFO L414 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] [2023-12-16 06:26:46,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2023-12-16 06:26:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 1864. [2023-12-16 06:26:46,844 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) [2023-12-16 06:26:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2640 transitions. [2023-12-16 06:26:46,848 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2640 transitions. Word has length 97 [2023-12-16 06:26:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:46,848 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 2640 transitions. [2023-12-16 06:26:46,848 INFO L496 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) [2023-12-16 06:26:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2640 transitions. [2023-12-16 06:26:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 06:26:46,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:46,850 INFO L195 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] [2023-12-16 06:26:46,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-16 06:26:46,850 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:46,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:46,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2028950783, now seen corresponding path program 1 times [2023-12-16 06:26:46,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:46,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606303802] [2023-12-16 06:26:46,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:46,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:46,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606303802] [2023-12-16 06:26:46,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606303802] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:46,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:46,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 06:26:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820988125] [2023-12-16 06:26:46,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:46,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:26:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:46,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:26:46,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:26:46,954 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) [2023-12-16 06:26:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:47,047 INFO L93 Difference]: Finished difference Result 3434 states and 4901 transitions. [2023-12-16 06:26:47,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:26:47,048 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 [2023-12-16 06:26:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:47,072 INFO L225 Difference]: With dead ends: 3434 [2023-12-16 06:26:47,072 INFO L226 Difference]: Without dead ends: 3042 [2023-12-16 06:26:47,074 INFO L412 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 [2023-12-16 06:26:47,074 INFO L413 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 [2023-12-16 06:26:47,074 INFO L414 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] [2023-12-16 06:26:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2023-12-16 06:26:47,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2254. [2023-12-16 06:26:47,119 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) [2023-12-16 06:26:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3200 transitions. [2023-12-16 06:26:47,124 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3200 transitions. Word has length 97 [2023-12-16 06:26:47,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:47,125 INFO L495 AbstractCegarLoop]: Abstraction has 2254 states and 3200 transitions. [2023-12-16 06:26:47,125 INFO L496 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) [2023-12-16 06:26:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3200 transitions. [2023-12-16 06:26:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 06:26:47,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:47,126 INFO L195 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] [2023-12-16 06:26:47,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-16 06:26:47,127 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:47,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash -567395912, now seen corresponding path program 1 times [2023-12-16 06:26:47,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:47,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116902684] [2023-12-16 06:26:47,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:47,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116902684] [2023-12-16 06:26:47,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116902684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:47,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:47,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:26:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873320732] [2023-12-16 06:26:47,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:47,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:26:47,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:47,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:26:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:26:47,235 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) [2023-12-16 06:26:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:47,258 INFO L93 Difference]: Finished difference Result 5714 states and 8136 transitions. [2023-12-16 06:26:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:26:47,259 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 [2023-12-16 06:26:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:47,264 INFO L225 Difference]: With dead ends: 5714 [2023-12-16 06:26:47,264 INFO L226 Difference]: Without dead ends: 3566 [2023-12-16 06:26:47,266 INFO L412 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 [2023-12-16 06:26:47,266 INFO L413 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 [2023-12-16 06:26:47,267 INFO L414 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] [2023-12-16 06:26:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2023-12-16 06:26:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 3388. [2023-12-16 06:26:47,311 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) [2023-12-16 06:26:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4764 transitions. [2023-12-16 06:26:47,318 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4764 transitions. Word has length 98 [2023-12-16 06:26:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:47,318 INFO L495 AbstractCegarLoop]: Abstraction has 3388 states and 4764 transitions. [2023-12-16 06:26:47,318 INFO L496 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) [2023-12-16 06:26:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4764 transitions. [2023-12-16 06:26:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 06:26:47,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:47,320 INFO L195 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] [2023-12-16 06:26:47,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-16 06:26:47,320 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:47,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1064867383, now seen corresponding path program 1 times [2023-12-16 06:26:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:47,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072235408] [2023-12-16 06:26:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:47,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:47,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:47,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072235408] [2023-12-16 06:26:47,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072235408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:47,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:47,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:26:47,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251325804] [2023-12-16 06:26:47,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:47,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:26:47,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:47,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:26:47,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:26:47,409 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) [2023-12-16 06:26:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:47,441 INFO L93 Difference]: Finished difference Result 9688 states and 13600 transitions. [2023-12-16 06:26:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:26:47,442 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 [2023-12-16 06:26:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:47,452 INFO L225 Difference]: With dead ends: 9688 [2023-12-16 06:26:47,452 INFO L226 Difference]: Without dead ends: 6406 [2023-12-16 06:26:47,457 INFO L412 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 [2023-12-16 06:26:47,458 INFO L413 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 [2023-12-16 06:26:47,458 INFO L414 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] [2023-12-16 06:26:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2023-12-16 06:26:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 6140. [2023-12-16 06:26:47,531 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) [2023-12-16 06:26:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 8554 transitions. [2023-12-16 06:26:47,541 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 8554 transitions. Word has length 99 [2023-12-16 06:26:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:47,541 INFO L495 AbstractCegarLoop]: Abstraction has 6140 states and 8554 transitions. [2023-12-16 06:26:47,542 INFO L496 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) [2023-12-16 06:26:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 8554 transitions. [2023-12-16 06:26:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 06:26:47,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:47,543 INFO L195 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] [2023-12-16 06:26:47,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-16 06:26:47,543 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:47,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:47,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1967013372, now seen corresponding path program 1 times [2023-12-16 06:26:47,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:47,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491407585] [2023-12-16 06:26:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:47,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:47,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:47,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491407585] [2023-12-16 06:26:47,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491407585] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:47,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:47,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:26:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138046731] [2023-12-16 06:26:47,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:47,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:26:47,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:26:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:26:47,632 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) [2023-12-16 06:26:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:47,679 INFO L93 Difference]: Finished difference Result 17680 states and 24508 transitions. [2023-12-16 06:26:47,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:26:47,679 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 [2023-12-16 06:26:47,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:47,700 INFO L225 Difference]: With dead ends: 17680 [2023-12-16 06:26:47,700 INFO L226 Difference]: Without dead ends: 11646 [2023-12-16 06:26:47,710 INFO L412 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 [2023-12-16 06:26:47,711 INFO L413 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 [2023-12-16 06:26:47,711 INFO L414 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] [2023-12-16 06:26:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11646 states. [2023-12-16 06:26:47,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11646 to 11116. [2023-12-16 06:26:47,854 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) [2023-12-16 06:26:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11116 states to 11116 states and 15276 transitions. [2023-12-16 06:26:47,873 INFO L78 Accepts]: Start accepts. Automaton has 11116 states and 15276 transitions. Word has length 100 [2023-12-16 06:26:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:47,874 INFO L495 AbstractCegarLoop]: Abstraction has 11116 states and 15276 transitions. [2023-12-16 06:26:47,874 INFO L496 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) [2023-12-16 06:26:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 11116 states and 15276 transitions. [2023-12-16 06:26:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-16 06:26:47,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:47,875 INFO L195 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] [2023-12-16 06:26:47,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-16 06:26:47,875 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:47,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 28912981, now seen corresponding path program 1 times [2023-12-16 06:26:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903053974] [2023-12-16 06:26:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:47,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:47,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903053974] [2023-12-16 06:26:47,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903053974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:47,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:47,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:26:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27524012] [2023-12-16 06:26:47,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:47,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:26:47,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:26:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:26:47,965 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) [2023-12-16 06:26:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:48,073 INFO L93 Difference]: Finished difference Result 32080 states and 43750 transitions. [2023-12-16 06:26:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:26:48,073 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 [2023-12-16 06:26:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:48,110 INFO L225 Difference]: With dead ends: 32080 [2023-12-16 06:26:48,111 INFO L226 Difference]: Without dead ends: 21070 [2023-12-16 06:26:48,129 INFO L412 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 [2023-12-16 06:26:48,129 INFO L413 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 [2023-12-16 06:26:48,130 INFO L414 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] [2023-12-16 06:26:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21070 states. [2023-12-16 06:26:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21070 to 20012. [2023-12-16 06:26:48,414 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) [2023-12-16 06:26:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20012 states to 20012 states and 27004 transitions. [2023-12-16 06:26:48,452 INFO L78 Accepts]: Start accepts. Automaton has 20012 states and 27004 transitions. Word has length 101 [2023-12-16 06:26:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:48,452 INFO L495 AbstractCegarLoop]: Abstraction has 20012 states and 27004 transitions. [2023-12-16 06:26:48,452 INFO L496 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) [2023-12-16 06:26:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 20012 states and 27004 transitions. [2023-12-16 06:26:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-16 06:26:48,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:48,453 INFO L195 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] [2023-12-16 06:26:48,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-16 06:26:48,453 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:48,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1790582352, now seen corresponding path program 1 times [2023-12-16 06:26:48,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:48,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821897535] [2023-12-16 06:26:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:48,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821897535] [2023-12-16 06:26:48,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821897535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:48,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:48,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 06:26:48,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203270217] [2023-12-16 06:26:48,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:48,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:26:48,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:48,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:26:48,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:26:48,629 INFO L87 Difference]: Start difference. First operand 20012 states and 27004 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 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) [2023-12-16 06:26:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:48,763 INFO L93 Difference]: Finished difference Result 31022 states and 41658 transitions. [2023-12-16 06:26:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 06:26:48,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 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 [2023-12-16 06:26:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:48,824 INFO L225 Difference]: With dead ends: 31022 [2023-12-16 06:26:48,825 INFO L226 Difference]: Without dead ends: 31020 [2023-12-16 06:26:48,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-16 06:26:48,841 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 262 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:26:48,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 816 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:26:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31020 states. [2023-12-16 06:26:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31020 to 20492. [2023-12-16 06:26:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20492 states, 20491 states have (on average 1.3319018105509737) internal successors, (27292), 20491 states have internal predecessors, (27292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20492 states to 20492 states and 27292 transitions. [2023-12-16 06:26:49,253 INFO L78 Accepts]: Start accepts. Automaton has 20492 states and 27292 transitions. Word has length 102 [2023-12-16 06:26:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:49,253 INFO L495 AbstractCegarLoop]: Abstraction has 20492 states and 27292 transitions. [2023-12-16 06:26:49,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 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) [2023-12-16 06:26:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 20492 states and 27292 transitions. [2023-12-16 06:26:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-16 06:26:49,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:49,255 INFO L195 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] [2023-12-16 06:26:49,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-16 06:26:49,256 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:49,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash 193814543, now seen corresponding path program 1 times [2023-12-16 06:26:49,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:49,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383466246] [2023-12-16 06:26:49,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:49,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383466246] [2023-12-16 06:26:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383466246] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:26:49,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:26:49,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 06:26:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405355913] [2023-12-16 06:26:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:26:49,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:26:49,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:49,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:26:49,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:26:49,317 INFO L87 Difference]: Start difference. First operand 20492 states and 27292 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:26:49,420 INFO L93 Difference]: Finished difference Result 41520 states and 55334 transitions. [2023-12-16 06:26:49,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:26:49,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-12-16 06:26:49,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:26:49,455 INFO L225 Difference]: With dead ends: 41520 [2023-12-16 06:26:49,455 INFO L226 Difference]: Without dead ends: 21134 [2023-12-16 06:26:49,481 INFO L412 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 [2023-12-16 06:26:49,481 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 86 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 287 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 [2023-12-16 06:26:49,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 287 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:26:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21134 states. [2023-12-16 06:26:49,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21134 to 21132. [2023-12-16 06:26:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21132 states, 21131 states have (on average 1.3150347830202074) internal successors, (27788), 21131 states have internal predecessors, (27788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21132 states to 21132 states and 27788 transitions. [2023-12-16 06:26:49,819 INFO L78 Accepts]: Start accepts. Automaton has 21132 states and 27788 transitions. Word has length 102 [2023-12-16 06:26:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:26:49,819 INFO L495 AbstractCegarLoop]: Abstraction has 21132 states and 27788 transitions. [2023-12-16 06:26:49,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:26:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 21132 states and 27788 transitions. [2023-12-16 06:26:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 06:26:49,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:26:49,824 INFO L195 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] [2023-12-16 06:26:49,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-16 06:26:49,824 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-12-16 06:26:49,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:26:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash -788506636, now seen corresponding path program 1 times [2023-12-16 06:26:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:26:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847739689] [2023-12-16 06:26:49,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:26:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:50,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:26:50,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847739689] [2023-12-16 06:26:50,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847739689] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 06:26:50,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046491172] [2023-12-16 06:26:50,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:26:50,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 06:26:50,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 06:26:50,313 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) [2023-12-16 06:26:50,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 06:26:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:26:50,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 06:26:50,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:26:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:51,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:26:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:26:52,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046491172] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:26:52,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 06:26:52,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2023-12-16 06:26:52,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127934714] [2023-12-16 06:26:52,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 06:26:52,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-16 06:26:52,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:26:52,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-16 06:26:52,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2023-12-16 06:26:52,339 INFO L87 Difference]: Start difference. First operand 21132 states and 27788 transitions. Second operand has 30 states, 30 states have (on average 11.633333333333333) internal successors, (349), 29 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-16 06:27:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2023-12-16 06:27:00,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7035 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=4443, Invalid=17907, Unknown=0, NotChecked=0, Total=22350 [2023-12-16 06:27:00,943 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 7092 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7092 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 06:27:00,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7092 Valid, 1053 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 06:27:00,946 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2023-12-16 06:27:00,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 06:27:00,963 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 06:27:00,975 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 06:27:01,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-12-16 06:27:01,147 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. [2023-12-16 06:27:01,149 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2023-12-16 06:27:01,152 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2023-12-16 06:27:01,152 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2023-12-16 06:27:01,152 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2023-12-16 06:27:01,152 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2023-12-16 06:27:01,153 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2023-12-16 06:27:01,153 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2023-12-16 06:27:01,153 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2023-12-16 06:27:01,153 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2023-12-16 06:27:01,153 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2023-12-16 06:27:01,157 INFO L445 BasicCegarLoop]: Path program 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] [2023-12-16 06:27:01,159 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 06:27:01,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:27:01 BoogieIcfgContainer [2023-12-16 06:27:01,162 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 06:27:01,167 INFO L158 Benchmark]: Toolchain (without parser) took 47370.30ms. Allocated memory was 400.6MB in the beginning and 976.2MB in the end (delta: 575.7MB). Free memory was 345.3MB in the beginning and 634.4MB in the end (delta: -289.1MB). Peak memory consumption was 288.2MB. Max. memory is 8.0GB. [2023-12-16 06:27:01,167 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 230.7MB. Free memory is still 178.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:27:01,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 849.11ms. Allocated memory is still 400.6MB. Free memory was 345.3MB in the beginning and 281.7MB in the end (delta: 63.6MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. [2023-12-16 06:27:01,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.69ms. Allocated memory is still 400.6MB. Free memory was 281.7MB in the beginning and 270.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 06:27:01,168 INFO L158 Benchmark]: Boogie Preprocessor took 178.86ms. Allocated memory is still 400.6MB. Free memory was 270.8MB in the beginning and 259.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 06:27:01,168 INFO L158 Benchmark]: RCFGBuilder took 1682.29ms. Allocated memory is still 400.6MB. Free memory was 259.3MB in the beginning and 210.9MB in the end (delta: 48.4MB). Peak memory consumption was 49.5MB. Max. memory is 8.0GB. [2023-12-16 06:27:01,168 INFO L158 Benchmark]: TraceAbstraction took 44500.64ms. Allocated memory was 400.6MB in the beginning and 976.2MB in the end (delta: 575.7MB). Free memory was 210.4MB in the beginning and 634.4MB in the end (delta: -424.0MB). Peak memory consumption was 151.7MB. Max. memory is 8.0GB. [2023-12-16 06:27:01,169 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.63ms. Allocated memory is still 230.7MB. Free memory is still 178.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 849.11ms. Allocated memory is still 400.6MB. Free memory was 345.3MB in the beginning and 281.7MB in the end (delta: 63.6MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 149.69ms. Allocated memory is still 400.6MB. Free memory was 281.7MB in the beginning and 270.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 178.86ms. Allocated memory is still 400.6MB. Free memory was 270.8MB in the beginning and 259.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1682.29ms. Allocated memory is still 400.6MB. Free memory was 259.3MB in the beginning and 210.9MB in the end (delta: 48.4MB). Peak memory consumption was 49.5MB. Max. memory is 8.0GB. * TraceAbstraction took 44500.64ms. Allocated memory was 400.6MB in the beginning and 976.2MB in the end (delta: 575.7MB). Free memory was 210.4MB in the beginning and 634.4MB in the end (delta: -424.0MB). Peak memory consumption was 151.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 2603]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2603). Cancelled while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. - TimeoutResultAtElement [Line: 1254]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1254). Cancelled while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. - TimeoutResultAtElement [Line: 1788]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1788). Cancelled while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. - TimeoutResultAtElement [Line: 2052]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2052). Cancelled while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. - TimeoutResultAtElement [Line: 2302]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2302). Cancelled while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. - TimeoutResultAtElement [Line: 2864]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2864). Cancelled while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. - TimeoutResultAtElement [Line: 3129]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3129). Cancelled while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. - TimeoutResultAtElement [Line: 3380]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3380). Cancelled while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. - TimeoutResultAtElement [Line: 3655]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3655). Cancelled while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. - TimeoutResultAtElement [Line: 3911]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3911). Cancelled while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. - TimeoutResultAtElement [Line: 4171]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4171). Cancelled while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 122 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 568 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 44.4s, OverallIterations: 39, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42750 SdHoareTripleChecker+Valid, 11.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42750 mSDsluCounter, 47348 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37779 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20691 IncrementalHoareTripleChecker+Invalid, 20923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 9569 mSDtfsCounter, 20691 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1004 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 708 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9017 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21132occurred in iteration=38, InterpolantAutomatonStates: 429, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 38 MinimizatonAttempts, 23563 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 3166 NumberOfCodeBlocks, 3166 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3254 ConstructedInterpolants, 0 QuantifiedInterpolants, 31476 SizeOfPredicates, 9 NumberOfNonLiveVariables, 685 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 41 InterpolantComputations, 38 PerfectInterpolantSequences, 38/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown