/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 true -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-15 23:36:03,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 23:36:03,102 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-15 23:36:03,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 23:36:03,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 23:36:03,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 23:36:03,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 23:36:03,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 23:36:03,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 23:36:03,133 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 23:36:03,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 23:36:03,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 23:36:03,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 23:36:03,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 23:36:03,136 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 23:36:03,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 23:36:03,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 23:36:03,136 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 23:36:03,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 23:36:03,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 23:36:03,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 23:36:03,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 23:36:03,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 23:36:03,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 23:36:03,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 23:36:03,138 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 23:36:03,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 23:36:03,138 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 23:36:03,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 23:36:03,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 23:36:03,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 23:36:03,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 23:36:03,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:36:03,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 23:36:03,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 23:36:03,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 23:36:03,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 23:36:03,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 23:36:03,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 23:36:03,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 23:36:03,141 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 23:36:03,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 23:36:03,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 23:36:03,141 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 -> true [2023-12-15 23:36:03,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 23:36:03,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 23:36:03,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 23:36:03,351 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 23:36:03,351 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 23:36:03,352 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-15 23:36:04,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 23:36:04,609 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 23:36:04,609 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-15 23:36:04,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07da55b34/786aab6b30f94527afd65444802b5ef0/FLAGaafae9ea0 [2023-12-15 23:36:04,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07da55b34/786aab6b30f94527afd65444802b5ef0 [2023-12-15 23:36:04,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 23:36:04,638 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 23:36:04,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 23:36:04,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 23:36:04,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 23:36:04,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:36:04" (1/1) ... [2023-12-15 23:36:04,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5b21bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:04, skipping insertion in model container [2023-12-15 23:36:04,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:36:04" (1/1) ... [2023-12-15 23:36:04,716 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 23:36:04,956 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-15 23:36:04,986 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-15 23:36:04,995 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-15 23:36:05,010 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-15 23:36:05,033 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-15 23:36:05,041 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-15 23:36:05,056 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-15 23:36:05,077 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-15 23:36:05,086 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-15 23:36:05,106 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-15 23:36:05,144 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-15 23:36:05,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:36:05,184 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 23:36:05,263 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-15 23:36:05,287 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-15 23:36:05,302 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-15 23:36:05,309 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-15 23:36:05,316 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-15 23:36:05,321 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-15 23:36:05,336 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-15 23:36:05,341 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-15 23:36:05,348 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-15 23:36:05,353 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-15 23:36:05,360 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-15 23:36:05,373 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:36:05,387 INFO L206 MainTranslator]: Completed translation [2023-12-15 23:36:05,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05 WrapperNode [2023-12-15 23:36:05,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 23:36:05,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 23:36:05,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 23:36:05,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 23:36:05,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,482 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2967 [2023-12-15 23:36:05,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 23:36:05,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 23:36:05,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 23:36:05,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 23:36:05,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,522 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-15 23:36:05,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 23:36:05,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 23:36:05,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 23:36:05,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 23:36:05,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (1/1) ... [2023-12-15 23:36:05,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:36:05,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:36:05,629 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-15 23:36:05,636 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-15 23:36:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 23:36:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 23:36:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 23:36:05,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 23:36:05,823 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 23:36:05,825 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 23:36:06,914 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 23:36:06,944 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 23:36:06,944 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-15 23:36:06,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:36:06 BoogieIcfgContainer [2023-12-15 23:36:06,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 23:36:06,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 23:36:06,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 23:36:06,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 23:36:06,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:36:04" (1/3) ... [2023-12-15 23:36:06,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6d9734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:36:06, skipping insertion in model container [2023-12-15 23:36:06,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:36:05" (2/3) ... [2023-12-15 23:36:06,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6d9734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:36:06, skipping insertion in model container [2023-12-15 23:36:06,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:36:06" (3/3) ... [2023-12-15 23:36:06,950 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2023-12-15 23:36:06,961 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 23:36:06,962 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-12-15 23:36:06,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 23:36:07,002 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;@6da0cbab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 23:36:07,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-12-15 23:36:07,007 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-15 23:36:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-15 23:36:07,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:07,019 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-15 23:36:07,020 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-15 23:36:07,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:07,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1518492486, now seen corresponding path program 1 times [2023-12-15 23:36:07,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:07,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157847701] [2023-12-15 23:36:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:07,420 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-15 23:36:07,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:07,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157847701] [2023-12-15 23:36:07,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157847701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:07,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:07,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:36:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991516884] [2023-12-15 23:36:07,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:07,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:36:07,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:07,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:36:07,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:36:07,458 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-15 23:36:07,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:07,976 INFO L93 Difference]: Finished difference Result 780 states and 1329 transitions. [2023-12-15 23:36:07,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:36:07,978 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-15 23:36:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:07,994 INFO L225 Difference]: With dead ends: 780 [2023-12-15 23:36:07,994 INFO L226 Difference]: Without dead ends: 502 [2023-12-15 23:36:07,998 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-15 23:36:07,999 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 2431 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:08,000 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.4s Time] [2023-12-15 23:36:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-12-15 23:36:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2023-12-15 23:36:08,033 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-15 23:36:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 626 transitions. [2023-12-15 23:36:08,035 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 626 transitions. Word has length 59 [2023-12-15 23:36:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:08,036 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 626 transitions. [2023-12-15 23:36:08,036 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-15 23:36:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 626 transitions. [2023-12-15 23:36:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-15 23:36:08,038 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:08,038 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-15 23:36:08,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 23:36:08,040 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-15 23:36:08,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:08,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1943729877, now seen corresponding path program 1 times [2023-12-15 23:36:08,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:08,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298386488] [2023-12-15 23:36:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:08,143 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-15 23:36:08,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:08,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298386488] [2023-12-15 23:36:08,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298386488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:08,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:08,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:36:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640851632] [2023-12-15 23:36:08,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:08,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:36:08,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:36:08,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:36:08,146 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-15 23:36:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:08,343 INFO L93 Difference]: Finished difference Result 600 states and 747 transitions. [2023-12-15 23:36:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:36:08,344 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-15 23:36:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:08,345 INFO L225 Difference]: With dead ends: 600 [2023-12-15 23:36:08,345 INFO L226 Difference]: Without dead ends: 350 [2023-12-15 23:36:08,346 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-15 23:36:08,347 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 1240 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:08,347 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-15 23:36:08,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-12-15 23:36:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2023-12-15 23:36:08,354 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-15 23:36:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 433 transitions. [2023-12-15 23:36:08,355 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 433 transitions. Word has length 59 [2023-12-15 23:36:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:08,355 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 433 transitions. [2023-12-15 23:36:08,355 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-15 23:36:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 433 transitions. [2023-12-15 23:36:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-15 23:36:08,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:08,357 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-15 23:36:08,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 23:36:08,357 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-15 23:36:08,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash -19682530, now seen corresponding path program 1 times [2023-12-15 23:36:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370186283] [2023-12-15 23:36:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:08,449 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-15 23:36:08,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:08,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370186283] [2023-12-15 23:36:08,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370186283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:08,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:08,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:36:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818468754] [2023-12-15 23:36:08,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:08,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:36:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:08,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:36:08,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:36:08,452 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-15 23:36:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:08,677 INFO L93 Difference]: Finished difference Result 646 states and 817 transitions. [2023-12-15 23:36:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:36:08,678 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-15 23:36:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:08,680 INFO L225 Difference]: With dead ends: 646 [2023-12-15 23:36:08,680 INFO L226 Difference]: Without dead ends: 457 [2023-12-15 23:36:08,680 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-15 23:36:08,681 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-15 23:36:08,681 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-15 23:36:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-12-15 23:36:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 409. [2023-12-15 23:36:08,710 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-15 23:36:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 533 transitions. [2023-12-15 23:36:08,713 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 533 transitions. Word has length 59 [2023-12-15 23:36:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:08,714 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 533 transitions. [2023-12-15 23:36:08,714 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-15 23:36:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 533 transitions. [2023-12-15 23:36:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-15 23:36:08,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:08,715 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-15 23:36:08,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 23:36:08,715 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-15 23:36:08,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash -732780502, now seen corresponding path program 1 times [2023-12-15 23:36:08,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135491665] [2023-12-15 23:36:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:08,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:08,789 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-15 23:36:08,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:08,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135491665] [2023-12-15 23:36:08,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135491665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:08,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:08,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:36:08,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316134319] [2023-12-15 23:36:08,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:08,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:36:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:08,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:36:08,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:36:08,791 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-15 23:36:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:08,913 INFO L93 Difference]: Finished difference Result 596 states and 784 transitions. [2023-12-15 23:36:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:36:08,913 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-15 23:36:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:08,915 INFO L225 Difference]: With dead ends: 596 [2023-12-15 23:36:08,915 INFO L226 Difference]: Without dead ends: 356 [2023-12-15 23:36:08,915 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-15 23:36:08,916 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-15 23:36:08,916 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-15 23:36:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-12-15 23:36:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2023-12-15 23:36:08,920 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-15 23:36:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 465 transitions. [2023-12-15 23:36:08,921 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 465 transitions. Word has length 61 [2023-12-15 23:36:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:08,922 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 465 transitions. [2023-12-15 23:36:08,922 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-15 23:36:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 465 transitions. [2023-12-15 23:36:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-15 23:36:08,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:08,923 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-15 23:36:08,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 23:36:08,923 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-15 23:36:08,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1082227329, now seen corresponding path program 1 times [2023-12-15 23:36:08,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:08,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454773130] [2023-12-15 23:36:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:09,091 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-15 23:36:09,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454773130] [2023-12-15 23:36:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454773130] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:09,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:09,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:36:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065466298] [2023-12-15 23:36:09,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:09,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:36:09,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:09,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:36:09,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:36:09,093 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-15 23:36:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:09,585 INFO L93 Difference]: Finished difference Result 809 states and 1096 transitions. [2023-12-15 23:36:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:36:09,585 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-15 23:36:09,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:09,587 INFO L225 Difference]: With dead ends: 809 [2023-12-15 23:36:09,587 INFO L226 Difference]: Without dead ends: 665 [2023-12-15 23:36:09,588 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-15 23:36:09,589 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.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:09,589 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.3s Time] [2023-12-15 23:36:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-15 23:36:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 356. [2023-12-15 23:36:09,596 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-15 23:36:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 464 transitions. [2023-12-15 23:36:09,597 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 464 transitions. Word has length 63 [2023-12-15 23:36:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:09,597 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 464 transitions. [2023-12-15 23:36:09,597 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-15 23:36:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 464 transitions. [2023-12-15 23:36:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-15 23:36:09,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:09,598 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-15 23:36:09,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 23:36:09,599 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-15 23:36:09,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1413074335, now seen corresponding path program 1 times [2023-12-15 23:36:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054830474] [2023-12-15 23:36:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:09,801 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-15 23:36:09,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:09,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054830474] [2023-12-15 23:36:09,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054830474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:09,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:09,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:36:09,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434809448] [2023-12-15 23:36:09,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:09,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:36:09,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:09,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:36:09,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:36:09,803 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-15 23:36:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:10,271 INFO L93 Difference]: Finished difference Result 914 states and 1257 transitions. [2023-12-15 23:36:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:36:10,271 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-15 23:36:10,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:10,274 INFO L225 Difference]: With dead ends: 914 [2023-12-15 23:36:10,274 INFO L226 Difference]: Without dead ends: 794 [2023-12-15 23:36:10,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:36:10,275 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.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:10,275 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.3s Time] [2023-12-15 23:36:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2023-12-15 23:36:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 356. [2023-12-15 23:36:10,282 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-15 23:36:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 463 transitions. [2023-12-15 23:36:10,283 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 463 transitions. Word has length 63 [2023-12-15 23:36:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:10,283 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 463 transitions. [2023-12-15 23:36:10,283 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-15 23:36:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 463 transitions. [2023-12-15 23:36:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-15 23:36:10,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:10,284 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-15 23:36:10,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 23:36:10,284 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-15 23:36:10,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:10,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1960661089, now seen corresponding path program 1 times [2023-12-15 23:36:10,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:10,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386850800] [2023-12-15 23:36:10,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:10,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:10,464 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-15 23:36:10,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:10,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386850800] [2023-12-15 23:36:10,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386850800] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:10,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:10,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 23:36:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480288500] [2023-12-15 23:36:10,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:10,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 23:36:10,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:10,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 23:36:10,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 23:36:10,466 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-15 23:36:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:10,734 INFO L93 Difference]: Finished difference Result 723 states and 945 transitions. [2023-12-15 23:36:10,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 23:36:10,734 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-15 23:36:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:10,736 INFO L225 Difference]: With dead ends: 723 [2023-12-15 23:36:10,736 INFO L226 Difference]: Without dead ends: 530 [2023-12-15 23:36:10,737 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-15 23:36:10,737 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.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:10,737 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.2s Time] [2023-12-15 23:36:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2023-12-15 23:36:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 356. [2023-12-15 23:36:10,742 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-15 23:36:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 462 transitions. [2023-12-15 23:36:10,742 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 462 transitions. Word has length 63 [2023-12-15 23:36:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:10,743 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 462 transitions. [2023-12-15 23:36:10,743 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-15 23:36:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 462 transitions. [2023-12-15 23:36:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-15 23:36:10,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:10,743 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-15 23:36:10,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 23:36:10,744 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-15 23:36:10,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash 718759200, now seen corresponding path program 1 times [2023-12-15 23:36:10,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:10,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334452195] [2023-12-15 23:36:10,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:10,945 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-15 23:36:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:10,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334452195] [2023-12-15 23:36:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334452195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:10,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:10,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:36:10,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420602931] [2023-12-15 23:36:10,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:10,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:36:10,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:10,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:36:10,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:36:10,947 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-15 23:36:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:11,382 INFO L93 Difference]: Finished difference Result 882 states and 1206 transitions. [2023-12-15 23:36:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:36:11,383 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-15 23:36:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:11,385 INFO L225 Difference]: With dead ends: 882 [2023-12-15 23:36:11,385 INFO L226 Difference]: Without dead ends: 773 [2023-12-15 23:36:11,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:36:11,386 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.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:11,387 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.3s Time] [2023-12-15 23:36:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-12-15 23:36:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 356. [2023-12-15 23:36:11,393 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-15 23:36:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 461 transitions. [2023-12-15 23:36:11,394 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 461 transitions. Word has length 64 [2023-12-15 23:36:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:11,394 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 461 transitions. [2023-12-15 23:36:11,395 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-15 23:36:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 461 transitions. [2023-12-15 23:36:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-15 23:36:11,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:11,397 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-15 23:36:11,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 23:36:11,397 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-15 23:36:11,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1193853636, now seen corresponding path program 1 times [2023-12-15 23:36:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:11,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017444400] [2023-12-15 23:36:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:11,642 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-15 23:36:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017444400] [2023-12-15 23:36:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017444400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:11,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:11,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:36:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201599294] [2023-12-15 23:36:11,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:11,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:36:11,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:11,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:36:11,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:36:11,643 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-15 23:36:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:12,118 INFO L93 Difference]: Finished difference Result 813 states and 1100 transitions. [2023-12-15 23:36:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:36:12,119 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-15 23:36:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:12,121 INFO L225 Difference]: With dead ends: 813 [2023-12-15 23:36:12,121 INFO L226 Difference]: Without dead ends: 794 [2023-12-15 23:36:12,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:36:12,122 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.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:12,122 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.3s Time] [2023-12-15 23:36:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2023-12-15 23:36:12,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 356. [2023-12-15 23:36:12,128 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-15 23:36:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 459 transitions. [2023-12-15 23:36:12,128 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 459 transitions. Word has length 65 [2023-12-15 23:36:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:12,129 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 459 transitions. [2023-12-15 23:36:12,129 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-15 23:36:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 459 transitions. [2023-12-15 23:36:12,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-15 23:36:12,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:12,129 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-15 23:36:12,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 23:36:12,130 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-15 23:36:12,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:12,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1508275324, now seen corresponding path program 1 times [2023-12-15 23:36:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:12,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481420225] [2023-12-15 23:36:12,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:12,273 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-15 23:36:12,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:12,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481420225] [2023-12-15 23:36:12,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481420225] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:12,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:12,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:36:12,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468452885] [2023-12-15 23:36:12,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:12,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:36:12,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:36:12,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:36:12,275 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-15 23:36:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:12,741 INFO L93 Difference]: Finished difference Result 779 states and 1047 transitions. [2023-12-15 23:36:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:36:12,741 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-15 23:36:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:12,743 INFO L225 Difference]: With dead ends: 779 [2023-12-15 23:36:12,743 INFO L226 Difference]: Without dead ends: 773 [2023-12-15 23:36:12,744 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-15 23:36:12,744 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.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:12,744 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.3s Time] [2023-12-15 23:36:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-12-15 23:36:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 356. [2023-12-15 23:36:12,750 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-15 23:36:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 457 transitions. [2023-12-15 23:36:12,751 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 457 transitions. Word has length 65 [2023-12-15 23:36:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:12,751 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 457 transitions. [2023-12-15 23:36:12,751 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-15 23:36:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 457 transitions. [2023-12-15 23:36:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-15 23:36:12,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:12,752 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-15 23:36:12,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 23:36:12,752 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-15 23:36:12,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1207057476, now seen corresponding path program 1 times [2023-12-15 23:36:12,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:12,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383344084] [2023-12-15 23:36:12,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:12,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:12,892 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-15 23:36:12,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:12,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383344084] [2023-12-15 23:36:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383344084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:12,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:12,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:36:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185069569] [2023-12-15 23:36:12,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:12,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:36:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:36:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:36:12,893 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-15 23:36:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:13,217 INFO L93 Difference]: Finished difference Result 700 states and 947 transitions. [2023-12-15 23:36:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 23:36:13,218 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-15 23:36:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:13,219 INFO L225 Difference]: With dead ends: 700 [2023-12-15 23:36:13,219 INFO L226 Difference]: Without dead ends: 523 [2023-12-15 23:36:13,220 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-15 23:36:13,220 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.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:13,220 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.2s Time] [2023-12-15 23:36:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-12-15 23:36:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 356. [2023-12-15 23:36:13,225 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-15 23:36:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 455 transitions. [2023-12-15 23:36:13,226 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 455 transitions. Word has length 65 [2023-12-15 23:36:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:13,226 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 455 transitions. [2023-12-15 23:36:13,226 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-15 23:36:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 455 transitions. [2023-12-15 23:36:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-15 23:36:13,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:13,227 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-15 23:36:13,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 23:36:13,227 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-15 23:36:13,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:13,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1230734052, now seen corresponding path program 1 times [2023-12-15 23:36:13,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:13,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971897614] [2023-12-15 23:36:13,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:13,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:13,388 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-15 23:36:13,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:13,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971897614] [2023-12-15 23:36:13,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971897614] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:13,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:13,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:36:13,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562494767] [2023-12-15 23:36:13,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:13,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:36:13,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:13,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:36:13,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:36:13,389 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-15 23:36:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:13,838 INFO L93 Difference]: Finished difference Result 885 states and 1202 transitions. [2023-12-15 23:36:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:36:13,838 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-15 23:36:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:13,840 INFO L225 Difference]: With dead ends: 885 [2023-12-15 23:36:13,840 INFO L226 Difference]: Without dead ends: 773 [2023-12-15 23:36:13,841 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-15 23:36:13,841 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.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:13,842 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.3s Time] [2023-12-15 23:36:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-12-15 23:36:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 356. [2023-12-15 23:36:13,848 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-15 23:36:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 454 transitions. [2023-12-15 23:36:13,849 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 454 transitions. Word has length 65 [2023-12-15 23:36:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:13,849 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 454 transitions. [2023-12-15 23:36:13,849 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-15 23:36:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 454 transitions. [2023-12-15 23:36:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-15 23:36:13,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:13,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] [2023-12-15 23:36:13,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 23:36:13,850 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-15 23:36:13,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash -873801820, now seen corresponding path program 1 times [2023-12-15 23:36:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16775235] [2023-12-15 23:36:13,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:14,004 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-15 23:36:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16775235] [2023-12-15 23:36:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16775235] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:14,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:14,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:36:14,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673491120] [2023-12-15 23:36:14,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:14,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:36:14,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:14,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:36:14,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:36:14,006 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-15 23:36:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:14,649 INFO L93 Difference]: Finished difference Result 919 states and 1251 transitions. [2023-12-15 23:36:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:36:14,649 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-15 23:36:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:14,651 INFO L225 Difference]: With dead ends: 919 [2023-12-15 23:36:14,651 INFO L226 Difference]: Without dead ends: 794 [2023-12-15 23:36:14,652 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-15 23:36:14,652 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 934 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:14,653 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.5s Time] [2023-12-15 23:36:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2023-12-15 23:36:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 356. [2023-12-15 23:36:14,659 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-15 23:36:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 453 transitions. [2023-12-15 23:36:14,660 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 453 transitions. Word has length 65 [2023-12-15 23:36:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:14,660 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 453 transitions. [2023-12-15 23:36:14,660 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-15 23:36:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 453 transitions. [2023-12-15 23:36:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-15 23:36:14,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:14,661 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-15 23:36:14,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 23:36:14,661 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-15 23:36:14,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:14,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1099115196, now seen corresponding path program 1 times [2023-12-15 23:36:14,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:14,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588695491] [2023-12-15 23:36:14,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:14,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:14,811 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-15 23:36:14,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:14,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588695491] [2023-12-15 23:36:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588695491] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:36:14,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391857746] [2023-12-15 23:36:14,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:14,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:36:14,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:14,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:36:14,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:36:14,812 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-15 23:36:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:15,285 INFO L93 Difference]: Finished difference Result 779 states and 1041 transitions. [2023-12-15 23:36:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 23:36:15,285 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-15 23:36:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:15,287 INFO L225 Difference]: With dead ends: 779 [2023-12-15 23:36:15,287 INFO L226 Difference]: Without dead ends: 773 [2023-12-15 23:36:15,288 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-15 23:36:15,288 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.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:15,288 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.3s Time] [2023-12-15 23:36:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-12-15 23:36:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 356. [2023-12-15 23:36:15,296 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-15 23:36:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 452 transitions. [2023-12-15 23:36:15,297 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 452 transitions. Word has length 65 [2023-12-15 23:36:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:15,297 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 452 transitions. [2023-12-15 23:36:15,297 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-15 23:36:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 452 transitions. [2023-12-15 23:36:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-15 23:36:15,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:15,298 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-15 23:36:15,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 23:36:15,298 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-15 23:36:15,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:15,299 INFO L85 PathProgramCache]: Analyzing trace with hash 106808155, now seen corresponding path program 1 times [2023-12-15 23:36:15,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:15,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456499082] [2023-12-15 23:36:15,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:16,844 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-15 23:36:16,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456499082] [2023-12-15 23:36:16,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456499082] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:16,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:16,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2023-12-15 23:36:16,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496432190] [2023-12-15 23:36:16,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:16,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-15 23:36:16,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:16,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-15 23:36:16,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2023-12-15 23:36:16,846 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-15 23:36:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:19,692 INFO L93 Difference]: Finished difference Result 898 states and 1175 transitions. [2023-12-15 23:36:19,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-15 23:36:19,692 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-15 23:36:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:19,694 INFO L225 Difference]: With dead ends: 898 [2023-12-15 23:36:19,694 INFO L226 Difference]: Without dead ends: 791 [2023-12-15 23:36:19,695 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-15 23:36:19,696 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 2254 mSDsluCounter, 5808 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:19,696 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.8s Time] [2023-12-15 23:36:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2023-12-15 23:36:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 355. [2023-12-15 23:36:19,701 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-15 23:36:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 450 transitions. [2023-12-15 23:36:19,702 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 450 transitions. Word has length 66 [2023-12-15 23:36:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:19,702 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 450 transitions. [2023-12-15 23:36:19,702 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-15 23:36:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 450 transitions. [2023-12-15 23:36:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-15 23:36:19,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:19,703 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-15 23:36:19,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 23:36:19,703 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-15 23:36:19,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash -543233893, now seen corresponding path program 1 times [2023-12-15 23:36:19,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:19,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817692847] [2023-12-15 23:36:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:19,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:20,018 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-15 23:36:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817692847] [2023-12-15 23:36:20,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817692847] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:20,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:20,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 23:36:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598987425] [2023-12-15 23:36:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:20,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 23:36:20,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 23:36:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-15 23:36:20,022 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-15 23:36:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:20,349 INFO L93 Difference]: Finished difference Result 889 states and 1183 transitions. [2023-12-15 23:36:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:36:20,349 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-15 23:36:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:20,351 INFO L225 Difference]: With dead ends: 889 [2023-12-15 23:36:20,351 INFO L226 Difference]: Without dead ends: 713 [2023-12-15 23:36:20,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:36:20,352 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 1544 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 23:36:20,352 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-15 23:36:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2023-12-15 23:36:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 285. [2023-12-15 23:36:20,359 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-15 23:36:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 366 transitions. [2023-12-15 23:36:20,360 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 366 transitions. Word has length 66 [2023-12-15 23:36:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:20,360 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 366 transitions. [2023-12-15 23:36:20,360 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-15 23:36:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 366 transitions. [2023-12-15 23:36:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-15 23:36:20,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:20,361 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-15 23:36:20,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 23:36:20,361 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-15 23:36:20,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1410161897, now seen corresponding path program 1 times [2023-12-15 23:36:20,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:20,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419893720] [2023-12-15 23:36:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:20,706 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-15 23:36:20,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:20,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419893720] [2023-12-15 23:36:20,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419893720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:20,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:20,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 23:36:20,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507449499] [2023-12-15 23:36:20,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:20,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 23:36:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:20,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 23:36:20,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:36:20,708 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-15 23:36:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:21,259 INFO L93 Difference]: Finished difference Result 1043 states and 1457 transitions. [2023-12-15 23:36:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 23:36:21,260 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-15 23:36:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:21,262 INFO L225 Difference]: With dead ends: 1043 [2023-12-15 23:36:21,262 INFO L226 Difference]: Without dead ends: 914 [2023-12-15 23:36:21,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2023-12-15 23:36:21,263 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 1221 mSDsluCounter, 2676 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-15 23:36:21,263 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-15 23:36:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-12-15 23:36:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 262. [2023-12-15 23:36:21,269 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-15 23:36:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 335 transitions. [2023-12-15 23:36:21,270 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 335 transitions. Word has length 67 [2023-12-15 23:36:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:21,270 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 335 transitions. [2023-12-15 23:36:21,270 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-15 23:36:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 335 transitions. [2023-12-15 23:36:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-15 23:36:21,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:21,271 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-15 23:36:21,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 23:36:21,271 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-15 23:36:21,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash 866774441, now seen corresponding path program 1 times [2023-12-15 23:36:21,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:21,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524835393] [2023-12-15 23:36:21,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:21,968 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-15 23:36:21,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524835393] [2023-12-15 23:36:21,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524835393] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:21,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:21,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-12-15 23:36:21,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903158063] [2023-12-15 23:36:21,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:21,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-15 23:36:21,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:21,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-15 23:36:21,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:36:21,969 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-15 23:36:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:23,093 INFO L93 Difference]: Finished difference Result 299 states and 372 transitions. [2023-12-15 23:36:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-15 23:36:23,093 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-15 23:36:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:23,100 INFO L225 Difference]: With dead ends: 299 [2023-12-15 23:36:23,100 INFO L226 Difference]: Without dead ends: 286 [2023-12-15 23:36:23,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2023-12-15 23:36:23,107 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-15 23:36:23,107 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-15 23:36:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-15 23:36:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 269. [2023-12-15 23:36:23,111 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-15 23:36:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 343 transitions. [2023-12-15 23:36:23,112 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 343 transitions. Word has length 67 [2023-12-15 23:36:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:23,112 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 343 transitions. [2023-12-15 23:36:23,112 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-15 23:36:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 343 transitions. [2023-12-15 23:36:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-15 23:36:23,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:23,113 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-15 23:36:23,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 23:36:23,113 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-15 23:36:23,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1780474025, now seen corresponding path program 1 times [2023-12-15 23:36:23,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:23,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694232727] [2023-12-15 23:36:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:23,777 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-15 23:36:23,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:23,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694232727] [2023-12-15 23:36:23,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694232727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:23,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:23,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-12-15 23:36:23,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405604680] [2023-12-15 23:36:23,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:23,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-15 23:36:23,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:23,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-15 23:36:23,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2023-12-15 23:36:23,779 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-15 23:36:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:24,934 INFO L93 Difference]: Finished difference Result 291 states and 363 transitions. [2023-12-15 23:36:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 23:36:24,935 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-15 23:36:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:24,936 INFO L225 Difference]: With dead ends: 291 [2023-12-15 23:36:24,936 INFO L226 Difference]: Without dead ends: 284 [2023-12-15 23:36:24,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2023-12-15 23:36:24,936 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-15 23:36:24,937 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-15 23:36:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-12-15 23:36:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 269. [2023-12-15 23:36:24,939 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-15 23:36:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 342 transitions. [2023-12-15 23:36:24,940 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 342 transitions. Word has length 67 [2023-12-15 23:36:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:24,940 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 342 transitions. [2023-12-15 23:36:24,940 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-15 23:36:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 342 transitions. [2023-12-15 23:36:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-15 23:36:24,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:24,941 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-15 23:36:24,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 23:36:24,941 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-15 23:36:24,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:24,941 INFO L85 PathProgramCache]: Analyzing trace with hash -588581152, now seen corresponding path program 1 times [2023-12-15 23:36:24,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:24,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330226186] [2023-12-15 23:36:24,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:24,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:25,453 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-15 23:36:25,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:25,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330226186] [2023-12-15 23:36:25,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330226186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:25,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:25,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-15 23:36:25,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606358945] [2023-12-15 23:36:25,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:25,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 23:36:25,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:25,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 23:36:25,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-12-15 23:36:25,454 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-15 23:36:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:26,142 INFO L93 Difference]: Finished difference Result 781 states and 1065 transitions. [2023-12-15 23:36:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 23:36:26,142 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-15 23:36:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:26,144 INFO L225 Difference]: With dead ends: 781 [2023-12-15 23:36:26,144 INFO L226 Difference]: Without dead ends: 639 [2023-12-15 23:36:26,144 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-15 23:36:26,145 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-15 23:36:26,145 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-15 23:36:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-12-15 23:36:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 260. [2023-12-15 23:36:26,149 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-15 23:36:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 328 transitions. [2023-12-15 23:36:26,150 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 328 transitions. Word has length 67 [2023-12-15 23:36:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:26,150 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 328 transitions. [2023-12-15 23:36:26,150 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-15 23:36:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 328 transitions. [2023-12-15 23:36:26,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-15 23:36:26,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:26,150 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-15 23:36:26,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 23:36:26,151 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-15 23:36:26,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash 183577999, now seen corresponding path program 1 times [2023-12-15 23:36:26,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:26,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338303034] [2023-12-15 23:36:26,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:26,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:26,706 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-15 23:36:26,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:26,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338303034] [2023-12-15 23:36:26,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338303034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:26,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:26,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-15 23:36:26,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485873960] [2023-12-15 23:36:26,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:26,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-15 23:36:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:26,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-15 23:36:26,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2023-12-15 23:36:26,709 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-15 23:36:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:27,890 INFO L93 Difference]: Finished difference Result 836 states and 1122 transitions. [2023-12-15 23:36:27,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-15 23:36:27,890 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-15 23:36:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:27,892 INFO L225 Difference]: With dead ends: 836 [2023-12-15 23:36:27,892 INFO L226 Difference]: Without dead ends: 832 [2023-12-15 23:36:27,893 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-15 23:36:27,893 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 1604 mSDsluCounter, 2718 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-15 23:36:27,893 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-15 23:36:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-12-15 23:36:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 255. [2023-12-15 23:36:27,898 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-15 23:36:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 323 transitions. [2023-12-15 23:36:27,899 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 323 transitions. Word has length 68 [2023-12-15 23:36:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:27,899 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 323 transitions. [2023-12-15 23:36:27,899 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-15 23:36:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 323 transitions. [2023-12-15 23:36:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-15 23:36:27,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:27,900 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-15 23:36:27,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 23:36:27,900 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-15 23:36:27,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash 734420341, now seen corresponding path program 1 times [2023-12-15 23:36:27,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:27,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936536637] [2023-12-15 23:36:27,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:27,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:28,176 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-15 23:36:28,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936536637] [2023-12-15 23:36:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936536637] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:28,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:28,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 23:36:28,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910103939] [2023-12-15 23:36:28,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:28,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 23:36:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:28,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 23:36:28,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:36:28,177 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-15 23:36:28,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:28,493 INFO L93 Difference]: Finished difference Result 411 states and 540 transitions. [2023-12-15 23:36:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:36:28,493 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-15 23:36:28,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:28,494 INFO L225 Difference]: With dead ends: 411 [2023-12-15 23:36:28,494 INFO L226 Difference]: Without dead ends: 374 [2023-12-15 23:36:28,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:36:28,495 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.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:28,495 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.1s Time] [2023-12-15 23:36:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-12-15 23:36:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 218. [2023-12-15 23:36:28,498 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-15 23:36:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 282 transitions. [2023-12-15 23:36:28,499 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 282 transitions. Word has length 68 [2023-12-15 23:36:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:28,499 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 282 transitions. [2023-12-15 23:36:28,499 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-15 23:36:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 282 transitions. [2023-12-15 23:36:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-15 23:36:28,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:28,500 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-15 23:36:28,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 23:36:28,500 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-15 23:36:28,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:28,500 INFO L85 PathProgramCache]: Analyzing trace with hash -535879959, now seen corresponding path program 1 times [2023-12-15 23:36:28,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:28,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747936591] [2023-12-15 23:36:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:28,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:28,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-15 23:36:28,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:28,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747936591] [2023-12-15 23:36:28,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747936591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:28,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:28,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:36:28,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914130156] [2023-12-15 23:36:28,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:28,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:36:28,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:28,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:36:28,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:36:28,630 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-15 23:36:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:28,912 INFO L93 Difference]: Finished difference Result 518 states and 700 transitions. [2023-12-15 23:36:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 23:36:28,912 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-15 23:36:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:28,913 INFO L225 Difference]: With dead ends: 518 [2023-12-15 23:36:28,913 INFO L226 Difference]: Without dead ends: 378 [2023-12-15 23:36:28,914 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-15 23:36:28,914 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-15 23:36:28,914 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-15 23:36:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-12-15 23:36:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 218. [2023-12-15 23:36:28,917 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-15 23:36:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 280 transitions. [2023-12-15 23:36:28,918 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 280 transitions. Word has length 69 [2023-12-15 23:36:28,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:28,918 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 280 transitions. [2023-12-15 23:36:28,918 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-15 23:36:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 280 transitions. [2023-12-15 23:36:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-15 23:36:28,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:28,918 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-15 23:36:28,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 23:36:28,919 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-15 23:36:28,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:28,919 INFO L85 PathProgramCache]: Analyzing trace with hash 134483598, now seen corresponding path program 1 times [2023-12-15 23:36:28,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:28,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095104469] [2023-12-15 23:36:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:29,751 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-15 23:36:29,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:29,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095104469] [2023-12-15 23:36:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095104469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:29,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:29,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-12-15 23:36:29,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741039093] [2023-12-15 23:36:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:29,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-15 23:36:29,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:29,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-15 23:36:29,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2023-12-15 23:36:29,752 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-15 23:36:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:31,053 INFO L93 Difference]: Finished difference Result 811 states and 1136 transitions. [2023-12-15 23:36:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-15 23:36:31,054 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-15 23:36:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:31,056 INFO L225 Difference]: With dead ends: 811 [2023-12-15 23:36:31,056 INFO L226 Difference]: Without dead ends: 805 [2023-12-15 23:36:31,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2023-12-15 23:36:31,058 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 1048 mSDsluCounter, 2961 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2023-12-15 23:36:31,058 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.7s Time] [2023-12-15 23:36:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2023-12-15 23:36:31,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 231. [2023-12-15 23:36:31,076 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-15 23:36:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 296 transitions. [2023-12-15 23:36:31,077 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 296 transitions. Word has length 71 [2023-12-15 23:36:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:31,077 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 296 transitions. [2023-12-15 23:36:31,077 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-15 23:36:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 296 transitions. [2023-12-15 23:36:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 23:36:31,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:31,078 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-15 23:36:31,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 23:36:31,078 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-15 23:36:31,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:31,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1358946869, now seen corresponding path program 1 times [2023-12-15 23:36:31,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:31,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805525343] [2023-12-15 23:36:31,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:31,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:31,486 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-15 23:36:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:31,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805525343] [2023-12-15 23:36:31,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805525343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:31,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:31,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 23:36:31,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990630907] [2023-12-15 23:36:31,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:31,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 23:36:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:31,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 23:36:31,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:36:31,487 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-15 23:36:31,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:31,913 INFO L93 Difference]: Finished difference Result 611 states and 838 transitions. [2023-12-15 23:36:31,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 23:36:31,914 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-15 23:36:31,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:31,915 INFO L225 Difference]: With dead ends: 611 [2023-12-15 23:36:31,915 INFO L226 Difference]: Without dead ends: 605 [2023-12-15 23:36:31,916 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-15 23:36:31,916 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 842 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 23:36:31,916 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-15 23:36:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2023-12-15 23:36:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 212. [2023-12-15 23:36:31,920 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-15 23:36:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 273 transitions. [2023-12-15 23:36:31,920 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 273 transitions. Word has length 72 [2023-12-15 23:36:31,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:31,920 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 273 transitions. [2023-12-15 23:36:31,920 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-15 23:36:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 273 transitions. [2023-12-15 23:36:31,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 23:36:31,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:31,921 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-15 23:36:31,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-15 23:36:31,921 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-15 23:36:31,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:31,922 INFO L85 PathProgramCache]: Analyzing trace with hash -668672694, now seen corresponding path program 1 times [2023-12-15 23:36:31,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:31,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742026673] [2023-12-15 23:36:31,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:31,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:31,990 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-15 23:36:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742026673] [2023-12-15 23:36:31,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742026673] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:31,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:31,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 23:36:31,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352628212] [2023-12-15 23:36:31,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:31,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 23:36:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:31,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 23:36:31,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 23:36:31,992 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-15 23:36:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:32,075 INFO L93 Difference]: Finished difference Result 1060 states and 1537 transitions. [2023-12-15 23:36:32,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 23:36:32,076 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-15 23:36:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:32,078 INFO L225 Difference]: With dead ends: 1060 [2023-12-15 23:36:32,078 INFO L226 Difference]: Without dead ends: 954 [2023-12-15 23:36:32,078 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-15 23:36:32,079 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-15 23:36:32,079 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-15 23:36:32,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2023-12-15 23:36:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 316. [2023-12-15 23:36:32,084 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-15 23:36:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 426 transitions. [2023-12-15 23:36:32,085 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 426 transitions. Word has length 95 [2023-12-15 23:36:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:32,085 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 426 transitions. [2023-12-15 23:36:32,085 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-15 23:36:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 426 transitions. [2023-12-15 23:36:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 23:36:32,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:32,086 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-15 23:36:32,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-15 23:36:32,086 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-15 23:36:32,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1525557505, now seen corresponding path program 1 times [2023-12-15 23:36:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:32,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031651231] [2023-12-15 23:36:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:32,173 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-15 23:36:32,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:32,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031651231] [2023-12-15 23:36:32,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031651231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:32,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:32,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 23:36:32,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139136141] [2023-12-15 23:36:32,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:32,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 23:36:32,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:32,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 23:36:32,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 23:36:32,174 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-15 23:36:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:32,228 INFO L93 Difference]: Finished difference Result 1262 states and 1824 transitions. [2023-12-15 23:36:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:36:32,229 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-15 23:36:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:32,231 INFO L225 Difference]: With dead ends: 1262 [2023-12-15 23:36:32,231 INFO L226 Difference]: Without dead ends: 1052 [2023-12-15 23:36:32,232 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-15 23:36:32,232 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-15 23:36:32,232 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-15 23:36:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2023-12-15 23:36:32,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 524. [2023-12-15 23:36:32,239 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-15 23:36:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 734 transitions. [2023-12-15 23:36:32,239 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 734 transitions. Word has length 97 [2023-12-15 23:36:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:32,240 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 734 transitions. [2023-12-15 23:36:32,240 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-15 23:36:32,240 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 734 transitions. [2023-12-15 23:36:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 23:36:32,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:32,241 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-15 23:36:32,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-15 23:36:32,241 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-15 23:36:32,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash -696655454, now seen corresponding path program 1 times [2023-12-15 23:36:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:32,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607284408] [2023-12-15 23:36:32,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:32,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:32,368 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-15 23:36:32,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:32,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607284408] [2023-12-15 23:36:32,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607284408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:32,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:32,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 23:36:32,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873172779] [2023-12-15 23:36:32,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:32,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 23:36:32,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:32,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 23:36:32,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 23:36:32,370 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-15 23:36:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:32,434 INFO L93 Difference]: Finished difference Result 944 states and 1354 transitions. [2023-12-15 23:36:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:36:32,434 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-15 23:36:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:32,436 INFO L225 Difference]: With dead ends: 944 [2023-12-15 23:36:32,436 INFO L226 Difference]: Without dead ends: 526 [2023-12-15 23:36:32,436 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-15 23:36:32,437 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-15 23:36:32,437 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-15 23:36:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-12-15 23:36:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 524. [2023-12-15 23:36:32,442 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-15 23:36:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 730 transitions. [2023-12-15 23:36:32,443 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 730 transitions. Word has length 97 [2023-12-15 23:36:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:32,443 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 730 transitions. [2023-12-15 23:36:32,443 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-15 23:36:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 730 transitions. [2023-12-15 23:36:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 23:36:32,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:32,444 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-15 23:36:32,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-15 23:36:32,444 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-15 23:36:32,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash -763148966, now seen corresponding path program 1 times [2023-12-15 23:36:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:32,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745320504] [2023-12-15 23:36:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:32,486 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-15 23:36:32,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:32,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745320504] [2023-12-15 23:36:32,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745320504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:32,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:32,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:36:32,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258442270] [2023-12-15 23:36:32,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:32,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:36:32,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:32,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:36:32,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:36:32,488 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-15 23:36:32,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:32,505 INFO L93 Difference]: Finished difference Result 1308 states and 1872 transitions. [2023-12-15 23:36:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:36:32,505 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-15 23:36:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:32,507 INFO L225 Difference]: With dead ends: 1308 [2023-12-15 23:36:32,507 INFO L226 Difference]: Without dead ends: 890 [2023-12-15 23:36:32,508 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-15 23:36:32,509 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-15 23:36:32,509 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-15 23:36:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-12-15 23:36:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2023-12-15 23:36:32,527 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-15 23:36:32,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1240 transitions. [2023-12-15 23:36:32,529 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1240 transitions. Word has length 97 [2023-12-15 23:36:32,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:32,529 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1240 transitions. [2023-12-15 23:36:32,529 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-15 23:36:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1240 transitions. [2023-12-15 23:36:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 23:36:32,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:32,530 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-15 23:36:32,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-15 23:36:32,531 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-15 23:36:32,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:32,531 INFO L85 PathProgramCache]: Analyzing trace with hash -713677567, now seen corresponding path program 1 times [2023-12-15 23:36:32,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:32,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019408729] [2023-12-15 23:36:32,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:32,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:32,612 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-15 23:36:32,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:32,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019408729] [2023-12-15 23:36:32,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019408729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:32,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:32,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 23:36:32,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389454201] [2023-12-15 23:36:32,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:32,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 23:36:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:32,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 23:36:32,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 23:36:32,614 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-15 23:36:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:32,683 INFO L93 Difference]: Finished difference Result 2654 states and 3781 transitions. [2023-12-15 23:36:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:36:32,683 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-15 23:36:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:32,688 INFO L225 Difference]: With dead ends: 2654 [2023-12-15 23:36:32,688 INFO L226 Difference]: Without dead ends: 2262 [2023-12-15 23:36:32,689 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-15 23:36:32,690 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-15 23:36:32,690 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-15 23:36:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2023-12-15 23:36:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 1474. [2023-12-15 23:36:32,710 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-15 23:36:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2080 transitions. [2023-12-15 23:36:32,713 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2080 transitions. Word has length 97 [2023-12-15 23:36:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:32,713 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 2080 transitions. [2023-12-15 23:36:32,713 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-15 23:36:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2080 transitions. [2023-12-15 23:36:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 23:36:32,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:32,714 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-15 23:36:32,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-15 23:36:32,715 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-15 23:36:32,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:32,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1161471745, now seen corresponding path program 1 times [2023-12-15 23:36:32,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:32,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079528544] [2023-12-15 23:36:32,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:32,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:32,792 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-15 23:36:32,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:32,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079528544] [2023-12-15 23:36:32,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079528544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:32,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:32,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 23:36:32,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450296092] [2023-12-15 23:36:32,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:32,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 23:36:32,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:32,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 23:36:32,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 23:36:32,793 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-15 23:36:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:32,873 INFO L93 Difference]: Finished difference Result 3044 states and 4341 transitions. [2023-12-15 23:36:32,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:36:32,875 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-15 23:36:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:32,880 INFO L225 Difference]: With dead ends: 3044 [2023-12-15 23:36:32,880 INFO L226 Difference]: Without dead ends: 2652 [2023-12-15 23:36:32,881 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-15 23:36:32,881 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 589 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 23:36:32,882 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-15 23:36:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2023-12-15 23:36:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 1864. [2023-12-15 23:36:32,903 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-15 23:36:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2640 transitions. [2023-12-15 23:36:32,905 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2640 transitions. Word has length 97 [2023-12-15 23:36:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:32,906 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 2640 transitions. [2023-12-15 23:36:32,906 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-15 23:36:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2640 transitions. [2023-12-15 23:36:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 23:36:32,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:32,907 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-15 23:36:32,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-15 23:36:32,907 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-15 23:36:32,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:32,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2028950783, now seen corresponding path program 1 times [2023-12-15 23:36:32,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:32,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333173507] [2023-12-15 23:36:32,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:32,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:32,976 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-15 23:36:32,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:32,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333173507] [2023-12-15 23:36:32,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333173507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:32,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:32,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 23:36:32,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85131096] [2023-12-15 23:36:32,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:32,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 23:36:32,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:32,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 23:36:32,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 23:36:32,978 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-15 23:36:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:33,055 INFO L93 Difference]: Finished difference Result 3434 states and 4901 transitions. [2023-12-15 23:36:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 23:36:33,056 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-15 23:36:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:33,074 INFO L225 Difference]: With dead ends: 3434 [2023-12-15 23:36:33,075 INFO L226 Difference]: Without dead ends: 3042 [2023-12-15 23:36:33,076 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-15 23:36:33,076 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 648 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-15 23:36:33,076 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-15 23:36:33,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2023-12-15 23:36:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2254. [2023-12-15 23:36:33,110 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-15 23:36:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3200 transitions. [2023-12-15 23:36:33,113 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3200 transitions. Word has length 97 [2023-12-15 23:36:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:33,114 INFO L495 AbstractCegarLoop]: Abstraction has 2254 states and 3200 transitions. [2023-12-15 23:36:33,114 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-15 23:36:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3200 transitions. [2023-12-15 23:36:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 23:36:33,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:33,115 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-15 23:36:33,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-15 23:36:33,116 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-15 23:36:33,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash -567395912, now seen corresponding path program 1 times [2023-12-15 23:36:33,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:33,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053424859] [2023-12-15 23:36:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:33,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-15 23:36:33,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:33,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053424859] [2023-12-15 23:36:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053424859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:33,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:33,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:36:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707689795] [2023-12-15 23:36:33,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:33,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:36:33,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:36:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:36:33,181 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-15 23:36:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:33,201 INFO L93 Difference]: Finished difference Result 5714 states and 8136 transitions. [2023-12-15 23:36:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:36:33,201 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-15 23:36:33,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:33,205 INFO L225 Difference]: With dead ends: 5714 [2023-12-15 23:36:33,206 INFO L226 Difference]: Without dead ends: 3566 [2023-12-15 23:36:33,208 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-15 23:36:33,208 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-15 23:36:33,208 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-15 23:36:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2023-12-15 23:36:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 3388. [2023-12-15 23:36:33,247 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-15 23:36:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4764 transitions. [2023-12-15 23:36:33,252 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4764 transitions. Word has length 98 [2023-12-15 23:36:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:33,252 INFO L495 AbstractCegarLoop]: Abstraction has 3388 states and 4764 transitions. [2023-12-15 23:36:33,252 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-15 23:36:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4764 transitions. [2023-12-15 23:36:33,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 23:36:33,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:33,253 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-15 23:36:33,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-15 23:36:33,253 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-15 23:36:33,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:33,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1064867383, now seen corresponding path program 1 times [2023-12-15 23:36:33,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:33,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236799698] [2023-12-15 23:36:33,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:33,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:33,317 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-15 23:36:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236799698] [2023-12-15 23:36:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236799698] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:33,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:33,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:36:33,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875776035] [2023-12-15 23:36:33,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:33,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:36:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:33,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:36:33,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:36:33,319 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-15 23:36:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:33,349 INFO L93 Difference]: Finished difference Result 9688 states and 13600 transitions. [2023-12-15 23:36:33,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:36:33,350 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-15 23:36:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:33,385 INFO L225 Difference]: With dead ends: 9688 [2023-12-15 23:36:33,385 INFO L226 Difference]: Without dead ends: 6406 [2023-12-15 23:36:33,388 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-15 23:36:33,388 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-15 23:36:33,388 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-15 23:36:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2023-12-15 23:36:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 6140. [2023-12-15 23:36:33,438 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-15 23:36:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 8554 transitions. [2023-12-15 23:36:33,445 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 8554 transitions. Word has length 99 [2023-12-15 23:36:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:33,446 INFO L495 AbstractCegarLoop]: Abstraction has 6140 states and 8554 transitions. [2023-12-15 23:36:33,446 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-15 23:36:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 8554 transitions. [2023-12-15 23:36:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-15 23:36:33,447 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:33,447 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-15 23:36:33,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-15 23:36:33,447 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-15 23:36:33,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:33,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1967013372, now seen corresponding path program 1 times [2023-12-15 23:36:33,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:33,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934075150] [2023-12-15 23:36:33,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:33,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:33,535 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-15 23:36:33,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:33,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934075150] [2023-12-15 23:36:33,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934075150] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:33,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:33,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:36:33,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056162289] [2023-12-15 23:36:33,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:33,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:36:33,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:33,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:36:33,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:36:33,537 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-15 23:36:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:33,581 INFO L93 Difference]: Finished difference Result 17680 states and 24508 transitions. [2023-12-15 23:36:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:36:33,592 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-15 23:36:33,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:33,606 INFO L225 Difference]: With dead ends: 17680 [2023-12-15 23:36:33,606 INFO L226 Difference]: Without dead ends: 11646 [2023-12-15 23:36:33,613 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-15 23:36:33,613 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-15 23:36:33,614 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-15 23:36:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11646 states. [2023-12-15 23:36:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11646 to 11116. [2023-12-15 23:36:33,707 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-15 23:36:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11116 states to 11116 states and 15276 transitions. [2023-12-15 23:36:33,721 INFO L78 Accepts]: Start accepts. Automaton has 11116 states and 15276 transitions. Word has length 100 [2023-12-15 23:36:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:33,721 INFO L495 AbstractCegarLoop]: Abstraction has 11116 states and 15276 transitions. [2023-12-15 23:36:33,721 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-15 23:36:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 11116 states and 15276 transitions. [2023-12-15 23:36:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 23:36:33,722 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:33,722 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-15 23:36:33,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-15 23:36:33,723 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-15 23:36:33,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:33,723 INFO L85 PathProgramCache]: Analyzing trace with hash 28912981, now seen corresponding path program 1 times [2023-12-15 23:36:33,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:33,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371664006] [2023-12-15 23:36:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:33,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:33,785 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-15 23:36:33,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:33,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371664006] [2023-12-15 23:36:33,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371664006] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:33,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:33,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:36:33,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786709620] [2023-12-15 23:36:33,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:33,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:36:33,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:33,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:36:33,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:36:33,787 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-15 23:36:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:33,848 INFO L93 Difference]: Finished difference Result 32080 states and 43750 transitions. [2023-12-15 23:36:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:36:33,849 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-15 23:36:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:33,877 INFO L225 Difference]: With dead ends: 32080 [2023-12-15 23:36:33,877 INFO L226 Difference]: Without dead ends: 21070 [2023-12-15 23:36:33,889 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-15 23:36:33,890 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-15 23:36:33,890 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-15 23:36:33,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21070 states. [2023-12-15 23:36:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21070 to 20012. [2023-12-15 23:36:34,146 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-15 23:36:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20012 states to 20012 states and 27004 transitions. [2023-12-15 23:36:34,170 INFO L78 Accepts]: Start accepts. Automaton has 20012 states and 27004 transitions. Word has length 101 [2023-12-15 23:36:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:34,171 INFO L495 AbstractCegarLoop]: Abstraction has 20012 states and 27004 transitions. [2023-12-15 23:36:34,171 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-15 23:36:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 20012 states and 27004 transitions. [2023-12-15 23:36:34,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-15 23:36:34,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:34,172 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-15 23:36:34,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-15 23:36:34,172 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-15 23:36:34,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1790582352, now seen corresponding path program 1 times [2023-12-15 23:36:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:34,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494384312] [2023-12-15 23:36:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:34,310 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-15 23:36:34,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:34,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494384312] [2023-12-15 23:36:34,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494384312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:34,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:34,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 23:36:34,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685555004] [2023-12-15 23:36:34,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:34,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 23:36:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:34,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 23:36:34,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 23:36:34,312 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-15 23:36:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:34,415 INFO L93 Difference]: Finished difference Result 31022 states and 41658 transitions. [2023-12-15 23:36:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 23:36:34,415 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-15 23:36:34,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:34,448 INFO L225 Difference]: With dead ends: 31022 [2023-12-15 23:36:34,448 INFO L226 Difference]: Without dead ends: 31020 [2023-12-15 23:36:34,458 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-15 23:36:34,458 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-15 23:36:34,459 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-15 23:36:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31020 states. [2023-12-15 23:36:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31020 to 20492. [2023-12-15 23:36:34,693 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-15 23:36:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20492 states to 20492 states and 27292 transitions. [2023-12-15 23:36:34,830 INFO L78 Accepts]: Start accepts. Automaton has 20492 states and 27292 transitions. Word has length 102 [2023-12-15 23:36:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:34,830 INFO L495 AbstractCegarLoop]: Abstraction has 20492 states and 27292 transitions. [2023-12-15 23:36:34,830 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-15 23:36:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 20492 states and 27292 transitions. [2023-12-15 23:36:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-15 23:36:34,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:34,831 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-15 23:36:34,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-15 23:36:34,831 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-15 23:36:34,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash 193814543, now seen corresponding path program 1 times [2023-12-15 23:36:34,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:34,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180523015] [2023-12-15 23:36:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:34,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:34,897 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-15 23:36:34,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:34,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180523015] [2023-12-15 23:36:34,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180523015] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:36:34,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:36:34,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:36:34,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190193090] [2023-12-15 23:36:34,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:36:34,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:36:34,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:34,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:36:34,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:36:34,899 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-15 23:36:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:36:35,142 INFO L93 Difference]: Finished difference Result 41520 states and 55334 transitions. [2023-12-15 23:36:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:36:35,143 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-15 23:36:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:36:35,205 INFO L225 Difference]: With dead ends: 41520 [2023-12-15 23:36:35,206 INFO L226 Difference]: Without dead ends: 21134 [2023-12-15 23:36:35,233 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-15 23:36:35,234 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-15 23:36:35,234 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-15 23:36:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21134 states. [2023-12-15 23:36:35,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21134 to 21132. [2023-12-15 23:36:35,537 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-15 23:36:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21132 states to 21132 states and 27788 transitions. [2023-12-15 23:36:35,559 INFO L78 Accepts]: Start accepts. Automaton has 21132 states and 27788 transitions. Word has length 102 [2023-12-15 23:36:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:36:35,559 INFO L495 AbstractCegarLoop]: Abstraction has 21132 states and 27788 transitions. [2023-12-15 23:36:35,559 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-15 23:36:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 21132 states and 27788 transitions. [2023-12-15 23:36:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-15 23:36:35,562 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:36:35,562 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-15 23:36:35,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-15 23:36:35,563 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-15 23:36:35,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:36:35,563 INFO L85 PathProgramCache]: Analyzing trace with hash -788506636, now seen corresponding path program 1 times [2023-12-15 23:36:35,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:36:35,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547339155] [2023-12-15 23:36:35,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:35,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:36:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:36,073 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-15 23:36:36,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:36:36,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547339155] [2023-12-15 23:36:36,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547339155] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:36:36,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58008881] [2023-12-15 23:36:36,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:36:36,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:36:36,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:36:36,090 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-15 23:36:36,096 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-15 23:36:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:36:36,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-15 23:36:36,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:36:36,868 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-15 23:36:36,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 23:36:37,700 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-15 23:36:37,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58008881] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 23:36:37,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 23:36:37,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2023-12-15 23:36:37,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623225237] [2023-12-15 23:36:37,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 23:36:37,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-15 23:36:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:36:37,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-15 23:36:37,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2023-12-15 23:36:37,702 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-15 23:37:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 390 states. [2023-12-15 23:37:04,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75411 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=21099, Invalid=153207, Unknown=0, NotChecked=0, Total=174306 [2023-12-15 23:37:04,474 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 15800 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15800 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:37:04,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15800 Valid, 1992 Invalid, 3247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-15 23:37:04,475 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2023-12-15 23:37:04,482 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-15 23:37:04,503 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-15 23:37:04,503 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-15 23:37:04,683 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-15 23:37:04,683 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (21132states) and FLOYD_HOARE automaton (currently 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-2-1 context. [2023-12-15 23:37:04,685 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2023-12-15 23:37:04,685 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2023-12-15 23:37:04,685 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2023-12-15 23:37:04,685 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2023-12-15 23:37:04,686 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2023-12-15 23:37:04,686 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2023-12-15 23:37:04,686 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2023-12-15 23:37:04,686 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2023-12-15 23:37:04,686 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2023-12-15 23:37:04,686 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2023-12-15 23:37:04,688 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-15 23:37:04,693 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 23:37:04,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:37:04 BoogieIcfgContainer [2023-12-15 23:37:04,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 23:37:04,697 INFO L158 Benchmark]: Toolchain (without parser) took 60059.38ms. Allocated memory was 183.5MB in the beginning and 1.1GB in the end (delta: 941.6MB). Free memory was 130.4MB in the beginning and 864.9MB in the end (delta: -734.5MB). Peak memory consumption was 208.4MB. Max. memory is 8.0GB. [2023-12-15 23:37:04,697 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 183.5MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 23:37:04,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 749.66ms. Allocated memory was 183.5MB in the beginning and 251.7MB in the end (delta: 68.2MB). Free memory was 130.4MB in the beginning and 194.3MB in the end (delta: -63.9MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. [2023-12-15 23:37:04,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.98ms. Allocated memory is still 251.7MB. Free memory was 194.3MB in the beginning and 183.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-15 23:37:04,698 INFO L158 Benchmark]: Boogie Preprocessor took 111.68ms. Allocated memory is still 251.7MB. Free memory was 183.3MB in the beginning and 171.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 23:37:04,698 INFO L158 Benchmark]: RCFGBuilder took 1349.41ms. Allocated memory is still 251.7MB. Free memory was 171.8MB in the beginning and 151.8MB in the end (delta: 19.9MB). Peak memory consumption was 105.4MB. Max. memory is 8.0GB. [2023-12-15 23:37:04,698 INFO L158 Benchmark]: TraceAbstraction took 57751.04ms. Allocated memory was 251.7MB in the beginning and 1.1GB in the end (delta: 873.5MB). Free memory was 150.8MB in the beginning and 864.9MB in the end (delta: -714.1MB). Peak memory consumption was 159.4MB. Max. memory is 8.0GB. [2023-12-15 23:37:04,699 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.53ms. Allocated memory is still 183.5MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 749.66ms. Allocated memory was 183.5MB in the beginning and 251.7MB in the end (delta: 68.2MB). Free memory was 130.4MB in the beginning and 194.3MB in the end (delta: -63.9MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 92.98ms. Allocated memory is still 251.7MB. Free memory was 194.3MB in the beginning and 183.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 111.68ms. Allocated memory is still 251.7MB. Free memory was 183.3MB in the beginning and 171.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1349.41ms. Allocated memory is still 251.7MB. Free memory was 171.8MB in the beginning and 151.8MB in the end (delta: 19.9MB). Peak memory consumption was 105.4MB. Max. memory is 8.0GB. * TraceAbstraction took 57751.04ms. Allocated memory was 251.7MB in the beginning and 1.1GB in the end (delta: 873.5MB). Free memory was 150.8MB in the beginning and 864.9MB in the end (delta: -714.1MB). Peak memory consumption was 159.4MB. 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 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-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 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-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 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-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 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-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 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-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 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-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 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-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 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-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 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-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 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-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 390 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-16-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-15-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 568 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 57.7s, OverallIterations: 39, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 44.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51458 SdHoareTripleChecker+Valid, 11.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51458 mSDsluCounter, 48287 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38640 mSDsCounter, 246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22327 IncrementalHoareTripleChecker+Invalid, 22573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 246 mSolverCounterUnsat, 9647 mSDtfsCounter, 22327 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1272 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 976 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77393 ImplicationChecksByTransitivity, 32.6s 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.5s AutomataMinimizationTime, 38 MinimizatonAttempts, 23563 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.6s 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