/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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 23:25:48,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 23:25:48,400 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:25:48,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 23:25:48,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 23:25:48,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 23:25:48,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 23:25:48,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 23:25:48,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 23:25:48,441 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 23:25:48,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 23:25:48,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 23:25:48,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 23:25:48,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 23:25:48,444 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 23:25:48,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 23:25:48,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 23:25:48,445 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 23:25:48,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 23:25:48,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 23:25:48,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 23:25:48,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 23:25:48,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 23:25:48,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 23:25:48,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 23:25:48,447 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 23:25:48,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 23:25:48,448 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 23:25:48,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 23:25:48,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 23:25:48,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 23:25:48,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 23:25:48,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:25:48,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 23:25:48,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 23:25:48,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 23:25:48,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 23:25:48,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 23:25:48,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 23:25:48,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 23:25:48,452 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 23:25:48,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 23:25:48,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 23:25:48,453 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:25:48,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 23:25:48,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 23:25:48,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 23:25:48,718 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 23:25:48,718 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 23:25:48,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-15 23:25:49,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 23:25:50,337 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 23:25:50,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-15 23:25:50,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713f75f9f/2e8fd8db696c4b648537b81655e02eb4/FLAG71503c64b [2023-12-15 23:25:50,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713f75f9f/2e8fd8db696c4b648537b81655e02eb4 [2023-12-15 23:25:50,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 23:25:50,385 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 23:25:50,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 23:25:50,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 23:25:50,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 23:25:50,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:25:50" (1/1) ... [2023-12-15 23:25:50,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68212d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:50, skipping insertion in model container [2023-12-15 23:25:50,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:25:50" (1/1) ... [2023-12-15 23:25:50,510 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 23:25:51,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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31400,31413] [2023-12-15 23:25:51,104 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32290,32303] [2023-12-15 23:25:51,125 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33992,34005] [2023-12-15 23:25:51,136 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34882,34895] [2023-12-15 23:25:51,163 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37399,37412] [2023-12-15 23:25:51,177 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38292,38305] [2023-12-15 23:25:51,199 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[39997,40010] [2023-12-15 23:25:51,213 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41274,41287] [2023-12-15 23:25:51,338 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55323,55336] [2023-12-15 23:25:51,354 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[56216,56229] [2023-12-15 23:25:51,370 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[57921,57934] [2023-12-15 23:25:51,411 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[62122,62135] [2023-12-15 23:25:51,527 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:25:51,542 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 23:25:51,759 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31400,31413] [2023-12-15 23:25:51,769 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32290,32303] [2023-12-15 23:25:51,786 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33992,34005] [2023-12-15 23:25:51,797 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34882,34895] [2023-12-15 23:25:51,820 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37399,37412] [2023-12-15 23:25:51,831 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38292,38305] [2023-12-15 23:25:51,847 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[39997,40010] [2023-12-15 23:25:51,873 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41274,41287] [2023-12-15 23:25:51,955 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55323,55336] [2023-12-15 23:25:51,966 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[56216,56229] [2023-12-15 23:25:51,982 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[57921,57934] [2023-12-15 23:25:52,018 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_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[62122,62135] [2023-12-15 23:25:52,089 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:25:52,112 INFO L206 MainTranslator]: Completed translation [2023-12-15 23:25:52,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52 WrapperNode [2023-12-15 23:25:52,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 23:25:52,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 23:25:52,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 23:25:52,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 23:25:52,121 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:25:52" (1/1) ... [2023-12-15 23:25:52,166 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:25:52" (1/1) ... [2023-12-15 23:25:52,252 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3937 [2023-12-15 23:25:52,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 23:25:52,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 23:25:52,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 23:25:52,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 23:25:52,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52" (1/1) ... [2023-12-15 23:25:52,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52" (1/1) ... [2023-12-15 23:25:52,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52" (1/1) ... [2023-12-15 23:25:52,330 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:25:52,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52" (1/1) ... [2023-12-15 23:25:52,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52" (1/1) ... [2023-12-15 23:25:52,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52" (1/1) ... [2023-12-15 23:25:52,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52" (1/1) ... [2023-12-15 23:25:52,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52" (1/1) ... [2023-12-15 23:25:52,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52" (1/1) ... [2023-12-15 23:25:52,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 23:25:52,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 23:25:52,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 23:25:52,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 23:25:52,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52" (1/1) ... [2023-12-15 23:25:52,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:25:52,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:25:52,463 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:25:52,469 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:25:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 23:25:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 23:25:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 23:25:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 23:25:52,679 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 23:25:52,681 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 23:25:54,679 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 23:25:54,746 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 23:25:54,746 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-15 23:25:54,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:25:54 BoogieIcfgContainer [2023-12-15 23:25:54,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 23:25:54,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 23:25:54,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 23:25:54,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 23:25:54,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:25:50" (1/3) ... [2023-12-15 23:25:54,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3ab71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:25:54, skipping insertion in model container [2023-12-15 23:25:54,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:25:52" (2/3) ... [2023-12-15 23:25:54,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3ab71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:25:54, skipping insertion in model container [2023-12-15 23:25:54,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:25:54" (3/3) ... [2023-12-15 23:25:54,755 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-15 23:25:54,772 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 23:25:54,772 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-12-15 23:25:54,843 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 23:25:54,850 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;@362f0bbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 23:25:54,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-12-15 23:25:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 915 states, 902 states have (on average 1.8303769401330376) internal successors, (1651), 914 states have internal predecessors, (1651), 0 states have call successors, (0), 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:25:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2023-12-15 23:25:54,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:25:54,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:54,892 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:25:54,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:25:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash 237538822, now seen corresponding path program 1 times [2023-12-15 23:25:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:25:54,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341129984] [2023-12-15 23:25:54,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:25:54,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:25:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:25:55,747 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:25:55,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:25:55,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341129984] [2023-12-15 23:25:55,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341129984] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:25:55,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:25:55,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:25:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045820974] [2023-12-15 23:25:55,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:25:55,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:25:55,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:25:55,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:25:55,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:25:55,797 INFO L87 Difference]: Start difference. First operand has 915 states, 902 states have (on average 1.8303769401330376) internal successors, (1651), 914 states have internal predecessors, (1651), 0 states have call successors, (0), 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 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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:25:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:25:56,049 INFO L93 Difference]: Finished difference Result 1592 states and 2850 transitions. [2023-12-15 23:25:56,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:25:56,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 291 [2023-12-15 23:25:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:25:56,098 INFO L225 Difference]: With dead ends: 1592 [2023-12-15 23:25:56,098 INFO L226 Difference]: Without dead ends: 1318 [2023-12-15 23:25:56,106 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:25:56,110 INFO L413 NwaCegarLoop]: 1802 mSDtfsCounter, 876 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:25:56,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 2996 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 23:25:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2023-12-15 23:25:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2023-12-15 23:25:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1304 states have (on average 1.5429447852760736) internal successors, (2012), 1315 states have internal predecessors, (2012), 0 states have call successors, (0), 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:25:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2012 transitions. [2023-12-15 23:25:56,211 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2012 transitions. Word has length 291 [2023-12-15 23:25:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:25:56,215 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 2012 transitions. [2023-12-15 23:25:56,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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:25:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2012 transitions. [2023-12-15 23:25:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2023-12-15 23:25:56,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:25:56,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:56,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 23:25:56,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:25:56,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:25:56,223 INFO L85 PathProgramCache]: Analyzing trace with hash 835633056, now seen corresponding path program 1 times [2023-12-15 23:25:56,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:25:56,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949509221] [2023-12-15 23:25:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:25:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:25:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:25:56,551 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:25:56,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:25:56,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949509221] [2023-12-15 23:25:56,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949509221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:25:56,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:25:56,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:25:56,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086798380] [2023-12-15 23:25:56,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:25:56,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:25:56,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:25:56,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:25:56,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:25:56,557 INFO L87 Difference]: Start difference. First operand 1316 states and 2012 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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:25:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:25:56,735 INFO L93 Difference]: Finished difference Result 2519 states and 3890 transitions. [2023-12-15 23:25:56,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:25:56,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 291 [2023-12-15 23:25:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:25:56,747 INFO L225 Difference]: With dead ends: 2519 [2023-12-15 23:25:56,748 INFO L226 Difference]: Without dead ends: 2148 [2023-12-15 23:25:56,750 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:25:56,752 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 730 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:25:56,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 2568 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:25:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2023-12-15 23:25:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2146. [2023-12-15 23:25:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2134 states have (on average 1.541705716963449) internal successors, (3290), 2145 states have internal predecessors, (3290), 0 states have call successors, (0), 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:25:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3290 transitions. [2023-12-15 23:25:56,830 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3290 transitions. Word has length 291 [2023-12-15 23:25:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:25:56,830 INFO L495 AbstractCegarLoop]: Abstraction has 2146 states and 3290 transitions. [2023-12-15 23:25:56,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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:25:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3290 transitions. [2023-12-15 23:25:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2023-12-15 23:25:56,836 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:25:56,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:56,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 23:25:56,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:25:56,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:25:56,841 INFO L85 PathProgramCache]: Analyzing trace with hash 782046385, now seen corresponding path program 1 times [2023-12-15 23:25:56,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:25:56,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274296667] [2023-12-15 23:25:56,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:25:56,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:25:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:25:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:25:57,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:25:57,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274296667] [2023-12-15 23:25:57,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274296667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:25:57,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:25:57,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:25:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431813540] [2023-12-15 23:25:57,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:25:57,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:25:57,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:25:57,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:25:57,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 23:25:57,657 INFO L87 Difference]: Start difference. First operand 2146 states and 3290 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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:25:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:25:57,805 INFO L93 Difference]: Finished difference Result 6354 states and 9731 transitions. [2023-12-15 23:25:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:25:57,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 291 [2023-12-15 23:25:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:25:57,823 INFO L225 Difference]: With dead ends: 6354 [2023-12-15 23:25:57,823 INFO L226 Difference]: Without dead ends: 4218 [2023-12-15 23:25:57,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:25:57,830 INFO L413 NwaCegarLoop]: 2401 mSDtfsCounter, 2947 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2947 SdHoareTripleChecker+Valid, 3722 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:25:57,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2947 Valid, 3722 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:25:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4218 states. [2023-12-15 23:25:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4218 to 4108. [2023-12-15 23:25:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4108 states, 4096 states have (on average 1.534912109375) internal successors, (6287), 4107 states have internal predecessors, (6287), 0 states have call successors, (0), 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:25:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 6287 transitions. [2023-12-15 23:25:57,921 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 6287 transitions. Word has length 291 [2023-12-15 23:25:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:25:57,922 INFO L495 AbstractCegarLoop]: Abstraction has 4108 states and 6287 transitions. [2023-12-15 23:25:57,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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:25:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 6287 transitions. [2023-12-15 23:25:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-12-15 23:25:57,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:25:57,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:57,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 23:25:57,931 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:25:57,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:25:57,932 INFO L85 PathProgramCache]: Analyzing trace with hash -230158959, now seen corresponding path program 1 times [2023-12-15 23:25:57,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:25:57,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048631518] [2023-12-15 23:25:57,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:25:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:25:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:25:58,100 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:25:58,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:25:58,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048631518] [2023-12-15 23:25:58,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048631518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:25:58,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:25:58,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:25:58,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961723655] [2023-12-15 23:25:58,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:25:58,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:25:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:25:58,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:25:58,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:25:58,107 INFO L87 Difference]: Start difference. First operand 4108 states and 6287 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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:25:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:25:58,241 INFO L93 Difference]: Finished difference Result 12059 states and 18411 transitions. [2023-12-15 23:25:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:25:58,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 293 [2023-12-15 23:25:58,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:25:58,272 INFO L225 Difference]: With dead ends: 12059 [2023-12-15 23:25:58,272 INFO L226 Difference]: Without dead ends: 8075 [2023-12-15 23:25:58,285 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:25:58,287 INFO L413 NwaCegarLoop]: 2652 mSDtfsCounter, 1265 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 3983 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:25:58,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 3983 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:25:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2023-12-15 23:25:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 7965. [2023-12-15 23:25:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7953 states have (on average 1.5274739092166478) internal successors, (12148), 7964 states have internal predecessors, (12148), 0 states have call successors, (0), 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:25:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 12148 transitions. [2023-12-15 23:25:58,521 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 12148 transitions. Word has length 293 [2023-12-15 23:25:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:25:58,523 INFO L495 AbstractCegarLoop]: Abstraction has 7965 states and 12148 transitions. [2023-12-15 23:25:58,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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:25:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 12148 transitions. [2023-12-15 23:25:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-12-15 23:25:58,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:25:58,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:58,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 23:25:58,539 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:25:58,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:25:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1376755050, now seen corresponding path program 1 times [2023-12-15 23:25:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:25:58,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088025839] [2023-12-15 23:25:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:25:58,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:25:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:25:58,675 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:25:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:25:58,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088025839] [2023-12-15 23:25:58,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088025839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:25:58,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:25:58,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:25:58,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378361847] [2023-12-15 23:25:58,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:25:58,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:25:58,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:25:58,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:25:58,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:25:58,677 INFO L87 Difference]: Start difference. First operand 7965 states and 12148 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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:25:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:25:58,797 INFO L93 Difference]: Finished difference Result 23830 states and 36330 transitions. [2023-12-15 23:25:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:25:58,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 293 [2023-12-15 23:25:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:25:58,853 INFO L225 Difference]: With dead ends: 23830 [2023-12-15 23:25:58,853 INFO L226 Difference]: Without dead ends: 15902 [2023-12-15 23:25:58,872 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:25:58,873 INFO L413 NwaCegarLoop]: 2758 mSDtfsCounter, 1377 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:25:58,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 4135 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:25:58,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15902 states. [2023-12-15 23:25:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15902 to 7984. [2023-12-15 23:25:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7984 states, 7972 states have (on average 1.5273457099849472) internal successors, (12176), 7983 states have internal predecessors, (12176), 0 states have call successors, (0), 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:25:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7984 states to 7984 states and 12176 transitions. [2023-12-15 23:25:59,193 INFO L78 Accepts]: Start accepts. Automaton has 7984 states and 12176 transitions. Word has length 293 [2023-12-15 23:25:59,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:25:59,193 INFO L495 AbstractCegarLoop]: Abstraction has 7984 states and 12176 transitions. [2023-12-15 23:25:59,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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:25:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 7984 states and 12176 transitions. [2023-12-15 23:25:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2023-12-15 23:25:59,207 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:25:59,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:59,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 23:25:59,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:25:59,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:25:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2035501009, now seen corresponding path program 1 times [2023-12-15 23:25:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:25:59,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894799492] [2023-12-15 23:25:59,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:25:59,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:25:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:25:59,345 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:25:59,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:25:59,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894799492] [2023-12-15 23:25:59,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894799492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:25:59,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:25:59,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:25:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806900944] [2023-12-15 23:25:59,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:25:59,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:25:59,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:25:59,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:25:59,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:25:59,352 INFO L87 Difference]: Start difference. First operand 7984 states and 12176 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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:25:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:25:59,455 INFO L93 Difference]: Finished difference Result 23849 states and 36351 transitions. [2023-12-15 23:25:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:25:59,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2023-12-15 23:25:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:25:59,493 INFO L225 Difference]: With dead ends: 23849 [2023-12-15 23:25:59,493 INFO L226 Difference]: Without dead ends: 15920 [2023-12-15 23:25:59,511 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:25:59,512 INFO L413 NwaCegarLoop]: 2758 mSDtfsCounter, 1372 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:25:59,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 4135 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:25:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15920 states. [2023-12-15 23:25:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15920 to 8002. [2023-12-15 23:25:59,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8002 states, 7990 states have (on average 1.5265331664580726) internal successors, (12197), 8001 states have internal predecessors, (12197), 0 states have call successors, (0), 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:25:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8002 states to 8002 states and 12197 transitions. [2023-12-15 23:25:59,806 INFO L78 Accepts]: Start accepts. Automaton has 8002 states and 12197 transitions. Word has length 294 [2023-12-15 23:25:59,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:25:59,806 INFO L495 AbstractCegarLoop]: Abstraction has 8002 states and 12197 transitions. [2023-12-15 23:25:59,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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:25:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 8002 states and 12197 transitions. [2023-12-15 23:25:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2023-12-15 23:25:59,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:25:59,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:59,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 23:25:59,820 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:25:59,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:25:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1906811756, now seen corresponding path program 1 times [2023-12-15 23:25:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:25:59,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340201593] [2023-12-15 23:25:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:25:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:25:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:25:59,970 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:25:59,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:25:59,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340201593] [2023-12-15 23:25:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340201593] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:25:59,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:25:59,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:25:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576848672] [2023-12-15 23:25:59,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:25:59,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:25:59,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:25:59,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:25:59,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:25:59,973 INFO L87 Difference]: Start difference. First operand 8002 states and 12197 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:26:00,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:26:00,110 INFO L93 Difference]: Finished difference Result 23389 states and 35562 transitions. [2023-12-15 23:26:00,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:26:00,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2023-12-15 23:26:00,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:26:00,147 INFO L225 Difference]: With dead ends: 23389 [2023-12-15 23:26:00,147 INFO L226 Difference]: Without dead ends: 15627 [2023-12-15 23:26:00,164 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:26:00,166 INFO L413 NwaCegarLoop]: 2714 mSDtfsCounter, 1258 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:26:00,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 4045 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:26:00,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15627 states. [2023-12-15 23:26:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15627 to 15517. [2023-12-15 23:26:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15517 states, 15505 states have (on average 1.5169945178974524) internal successors, (23521), 15516 states have internal predecessors, (23521), 0 states have call successors, (0), 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:26:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15517 states to 15517 states and 23521 transitions. [2023-12-15 23:26:00,479 INFO L78 Accepts]: Start accepts. Automaton has 15517 states and 23521 transitions. Word has length 295 [2023-12-15 23:26:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:26:00,479 INFO L495 AbstractCegarLoop]: Abstraction has 15517 states and 23521 transitions. [2023-12-15 23:26:00,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:26:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 15517 states and 23521 transitions. [2023-12-15 23:26:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2023-12-15 23:26:00,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:26:00,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:00,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 23:26:00,503 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:26:00,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:26:00,504 INFO L85 PathProgramCache]: Analyzing trace with hash 490819529, now seen corresponding path program 1 times [2023-12-15 23:26:00,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:26:00,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240896555] [2023-12-15 23:26:00,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:26:00,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:26:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:26:01,138 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:26:01,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:26:01,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240896555] [2023-12-15 23:26:01,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240896555] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:26:01,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:26:01,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:26:01,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799112569] [2023-12-15 23:26:01,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:26:01,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:26:01,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:26:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:26:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:26:01,140 INFO L87 Difference]: Start difference. First operand 15517 states and 23521 transitions. Second operand has 5 states, 5 states have (on average 59.0) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:26:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:26:01,404 INFO L93 Difference]: Finished difference Result 45653 states and 69082 transitions. [2023-12-15 23:26:01,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:26:01,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2023-12-15 23:26:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:26:01,477 INFO L225 Difference]: With dead ends: 45653 [2023-12-15 23:26:01,477 INFO L226 Difference]: Without dead ends: 30190 [2023-12-15 23:26:01,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:26:01,508 INFO L413 NwaCegarLoop]: 2333 mSDtfsCounter, 3065 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3065 SdHoareTripleChecker+Valid, 4959 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:26:01,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3065 Valid, 4959 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:26:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30190 states. [2023-12-15 23:26:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30190 to 30088. [2023-12-15 23:26:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30088 states, 30076 states have (on average 1.504455379704748) internal successors, (45248), 30087 states have internal predecessors, (45248), 0 states have call successors, (0), 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:26:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30088 states to 30088 states and 45248 transitions. [2023-12-15 23:26:02,217 INFO L78 Accepts]: Start accepts. Automaton has 30088 states and 45248 transitions. Word has length 295 [2023-12-15 23:26:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:26:02,217 INFO L495 AbstractCegarLoop]: Abstraction has 30088 states and 45248 transitions. [2023-12-15 23:26:02,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:26:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 30088 states and 45248 transitions. [2023-12-15 23:26:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2023-12-15 23:26:02,387 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:26:02,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:02,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 23:26:02,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:26:02,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:26:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash -886767017, now seen corresponding path program 1 times [2023-12-15 23:26:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:26:02,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772498293] [2023-12-15 23:26:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:26:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:26:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:26:02,904 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:26:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:26:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772498293] [2023-12-15 23:26:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772498293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:26:02,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:26:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:26:02,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201617876] [2023-12-15 23:26:02,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:26:02,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:26:02,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:26:02,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:26:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 23:26:02,907 INFO L87 Difference]: Start difference. First operand 30088 states and 45248 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:26:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:26:03,326 INFO L93 Difference]: Finished difference Result 88808 states and 133390 transitions. [2023-12-15 23:26:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:26:03,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2023-12-15 23:26:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:26:03,468 INFO L225 Difference]: With dead ends: 88808 [2023-12-15 23:26:03,468 INFO L226 Difference]: Without dead ends: 58916 [2023-12-15 23:26:03,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:26:03,521 INFO L413 NwaCegarLoop]: 2384 mSDtfsCounter, 2894 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2894 SdHoareTripleChecker+Valid, 3709 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:26:03,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2894 Valid, 3709 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:26:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58916 states. [2023-12-15 23:26:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58916 to 58800. [2023-12-15 23:26:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58800 states, 58788 states have (on average 1.4938933115601825) internal successors, (87823), 58799 states have internal predecessors, (87823), 0 states have call successors, (0), 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:26:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58800 states to 58800 states and 87823 transitions. [2023-12-15 23:26:04,731 INFO L78 Accepts]: Start accepts. Automaton has 58800 states and 87823 transitions. Word has length 297 [2023-12-15 23:26:04,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:26:04,732 INFO L495 AbstractCegarLoop]: Abstraction has 58800 states and 87823 transitions. [2023-12-15 23:26:04,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:26:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 58800 states and 87823 transitions. [2023-12-15 23:26:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2023-12-15 23:26:04,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:26:04,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:04,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 23:26:04,803 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:26:04,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:26:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2101017267, now seen corresponding path program 1 times [2023-12-15 23:26:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:26:04,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418047220] [2023-12-15 23:26:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:26:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:26:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:26:04,929 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:26:04,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:26:04,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418047220] [2023-12-15 23:26:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418047220] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:26:04,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:26:04,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:26:04,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660447644] [2023-12-15 23:26:04,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:26:04,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:26:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:26:04,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:26:04,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:26:04,932 INFO L87 Difference]: Start difference. First operand 58800 states and 87823 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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:26:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:26:05,801 INFO L93 Difference]: Finished difference Result 175882 states and 262635 transitions. [2023-12-15 23:26:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:26:05,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 299 [2023-12-15 23:26:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:26:06,064 INFO L225 Difference]: With dead ends: 175882 [2023-12-15 23:26:06,064 INFO L226 Difference]: Without dead ends: 117366 [2023-12-15 23:26:06,275 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:26:06,276 INFO L413 NwaCegarLoop]: 2725 mSDtfsCounter, 1344 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 4102 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:26:06,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 4102 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:26:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117366 states. [2023-12-15 23:26:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117366 to 58930. [2023-12-15 23:26:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58930 states, 58918 states have (on average 1.493821921993279) internal successors, (88013), 58929 states have internal predecessors, (88013), 0 states have call successors, (0), 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:26:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58930 states to 58930 states and 88013 transitions. [2023-12-15 23:26:07,635 INFO L78 Accepts]: Start accepts. Automaton has 58930 states and 88013 transitions. Word has length 299 [2023-12-15 23:26:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:26:07,635 INFO L495 AbstractCegarLoop]: Abstraction has 58930 states and 88013 transitions. [2023-12-15 23:26:07,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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:26:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 58930 states and 88013 transitions. [2023-12-15 23:26:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2023-12-15 23:26:07,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:26:07,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:07,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 23:26:07,701 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:26:07,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:26:07,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1686028818, now seen corresponding path program 1 times [2023-12-15 23:26:07,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:26:07,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281925092] [2023-12-15 23:26:07,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:26:07,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:26:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:26:07,996 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:26:07,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:26:07,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281925092] [2023-12-15 23:26:07,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281925092] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:26:07,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:26:07,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:26:07,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663405522] [2023-12-15 23:26:07,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:26:07,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:26:07,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:26:07,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:26:07,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:26:07,999 INFO L87 Difference]: Start difference. First operand 58930 states and 88013 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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:26:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:26:08,732 INFO L93 Difference]: Finished difference Result 173384 states and 258503 transitions. [2023-12-15 23:26:08,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:26:08,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 299 [2023-12-15 23:26:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:26:08,897 INFO L225 Difference]: With dead ends: 173384 [2023-12-15 23:26:08,897 INFO L226 Difference]: Without dead ends: 115476 [2023-12-15 23:26:08,949 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:26:08,950 INFO L413 NwaCegarLoop]: 2659 mSDtfsCounter, 1241 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:26:08,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 3994 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:26:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115476 states. [2023-12-15 23:26:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115476 to 115360. [2023-12-15 23:26:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115360 states, 115348 states have (on average 1.4835887921767175) internal successors, (171129), 115359 states have internal predecessors, (171129), 0 states have call successors, (0), 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:26:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115360 states to 115360 states and 171129 transitions. [2023-12-15 23:26:10,901 INFO L78 Accepts]: Start accepts. Automaton has 115360 states and 171129 transitions. Word has length 299 [2023-12-15 23:26:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:26:10,902 INFO L495 AbstractCegarLoop]: Abstraction has 115360 states and 171129 transitions. [2023-12-15 23:26:10,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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:26:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 115360 states and 171129 transitions. [2023-12-15 23:26:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2023-12-15 23:26:11,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:26:11,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:11,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 23:26:11,021 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:26:11,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:26:11,022 INFO L85 PathProgramCache]: Analyzing trace with hash -628716530, now seen corresponding path program 1 times [2023-12-15 23:26:11,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:26:11,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131083392] [2023-12-15 23:26:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:26:11,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:26:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:26:11,358 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:26:11,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:26:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131083392] [2023-12-15 23:26:11,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131083392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:26:11,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:26:11,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:26:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956726717] [2023-12-15 23:26:11,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:26:11,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:26:11,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:26:11,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:26:11,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:26:11,361 INFO L87 Difference]: Start difference. First operand 115360 states and 171129 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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:26:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:26:12,418 INFO L93 Difference]: Finished difference Result 344828 states and 511321 transitions. [2023-12-15 23:26:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:26:12,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 300 [2023-12-15 23:26:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:26:12,751 INFO L225 Difference]: With dead ends: 344828 [2023-12-15 23:26:12,752 INFO L226 Difference]: Without dead ends: 230150 [2023-12-15 23:26:13,123 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:26:13,124 INFO L413 NwaCegarLoop]: 2723 mSDtfsCounter, 1340 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 4100 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:26:13,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 4100 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:26:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230150 states. [2023-12-15 23:26:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230150 to 115522. [2023-12-15 23:26:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115522 states, 115510 states have (on average 1.4831183447320577) internal successors, (171315), 115521 states have internal predecessors, (171315), 0 states have call successors, (0), 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:26:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115522 states to 115522 states and 171315 transitions. [2023-12-15 23:26:15,949 INFO L78 Accepts]: Start accepts. Automaton has 115522 states and 171315 transitions. Word has length 300 [2023-12-15 23:26:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:26:15,949 INFO L495 AbstractCegarLoop]: Abstraction has 115522 states and 171315 transitions. [2023-12-15 23:26:15,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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:26:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 115522 states and 171315 transitions. [2023-12-15 23:26:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2023-12-15 23:26:16,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:26:16,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:16,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 23:26:16,056 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:26:16,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:26:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1451069449, now seen corresponding path program 1 times [2023-12-15 23:26:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:26:16,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164510912] [2023-12-15 23:26:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:26:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:26:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:26:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:26:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:26:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164510912] [2023-12-15 23:26:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164510912] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:26:16,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:26:16,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:26:16,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361828887] [2023-12-15 23:26:16,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:26:16,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:26:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:26:16,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:26:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:26:16,236 INFO L87 Difference]: Start difference. First operand 115522 states and 171315 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:26:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:26:17,384 INFO L93 Difference]: Finished difference Result 327848 states and 485353 transitions. [2023-12-15 23:26:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:26:17,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 301 [2023-12-15 23:26:17,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:26:18,039 INFO L225 Difference]: With dead ends: 327848 [2023-12-15 23:26:18,057 INFO L226 Difference]: Without dead ends: 213868 [2023-12-15 23:26:18,112 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:26:18,113 INFO L413 NwaCegarLoop]: 2662 mSDtfsCounter, 1235 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 3997 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:26:18,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 3997 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:26:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213868 states. [2023-12-15 23:26:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213868 to 213752. [2023-12-15 23:26:21,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213752 states, 213740 states have (on average 1.4715308318517826) internal successors, (314525), 213751 states have internal predecessors, (314525), 0 states have call successors, (0), 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:26:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213752 states to 213752 states and 314525 transitions. [2023-12-15 23:26:21,524 INFO L78 Accepts]: Start accepts. Automaton has 213752 states and 314525 transitions. Word has length 301 [2023-12-15 23:26:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:26:21,524 INFO L495 AbstractCegarLoop]: Abstraction has 213752 states and 314525 transitions. [2023-12-15 23:26:21,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:26:21,524 INFO L276 IsEmpty]: Start isEmpty. Operand 213752 states and 314525 transitions. [2023-12-15 23:26:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2023-12-15 23:26:22,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:26:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:22,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 23:26:22,115 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:26:22,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:26:22,116 INFO L85 PathProgramCache]: Analyzing trace with hash -260897242, now seen corresponding path program 1 times [2023-12-15 23:26:22,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:26:22,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719087755] [2023-12-15 23:26:22,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:26:22,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:26:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:26:22,565 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:26:22,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:26:22,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719087755] [2023-12-15 23:26:22,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719087755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:26:22,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:26:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:26:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259085658] [2023-12-15 23:26:22,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:26:22,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:26:22,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:26:22,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:26:22,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:26:22,568 INFO L87 Difference]: Start difference. First operand 213752 states and 314525 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 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:26:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:26:24,993 INFO L93 Difference]: Finished difference Result 629840 states and 924995 transitions. [2023-12-15 23:26:24,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:26:24,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 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 301 [2023-12-15 23:26:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:26:25,603 INFO L225 Difference]: With dead ends: 629840 [2023-12-15 23:26:25,604 INFO L226 Difference]: Without dead ends: 416706 [2023-12-15 23:26:25,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:26:25,702 INFO L413 NwaCegarLoop]: 2368 mSDtfsCounter, 4219 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4219 SdHoareTripleChecker+Valid, 3681 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:26:25,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4219 Valid, 3681 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 23:26:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416706 states. [2023-12-15 23:26:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416706 to 416608. [2023-12-15 23:26:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416608 states, 416596 states have (on average 1.4576928247030696) internal successors, (607269), 416607 states have internal predecessors, (607269), 0 states have call successors, (0), 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:26:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416608 states to 416608 states and 607269 transitions. [2023-12-15 23:26:32,868 INFO L78 Accepts]: Start accepts. Automaton has 416608 states and 607269 transitions. Word has length 301 [2023-12-15 23:26:32,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:26:32,868 INFO L495 AbstractCegarLoop]: Abstraction has 416608 states and 607269 transitions. [2023-12-15 23:26:32,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 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:26:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 416608 states and 607269 transitions. [2023-12-15 23:26:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2023-12-15 23:26:33,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:26:33,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:33,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 23:26:33,179 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2023-12-15 23:26:33,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:26:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 324780507, now seen corresponding path program 1 times [2023-12-15 23:26:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:26:33,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427357842] [2023-12-15 23:26:33,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:26:33,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:26:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:26:33,740 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:26:33,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:26:33,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427357842] [2023-12-15 23:26:33,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427357842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:26:33,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:26:33,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:26:33,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060273375] [2023-12-15 23:26:33,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:26:33,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:26:33,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:26:33,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:26:33,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:26:33,743 INFO L87 Difference]: Start difference. First operand 416608 states and 607269 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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:26:37,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:26:37,977 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:26:37,977 INFO L413 NwaCegarLoop]: 2612 mSDtfsCounter, 1214 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 3905 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:26:37,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 3905 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:26:37,979 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 12 remaining) [2023-12-15 23:26:37,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 23:26:37,980 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). [2023-12-15 23:26:37,989 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 12 remaining) [2023-12-15 23:26:37,989 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 12 remaining) [2023-12-15 23:26:37,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 12 remaining) [2023-12-15 23:26:37,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 12 remaining) [2023-12-15 23:26:37,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 12 remaining) [2023-12-15 23:26:37,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 12 remaining) [2023-12-15 23:26:37,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (4 of 12 remaining) [2023-12-15 23:26:37,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (3 of 12 remaining) [2023-12-15 23:26:37,993 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (2 of 12 remaining) [2023-12-15 23:26:37,993 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2023-12-15 23:26:37,993 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (0 of 12 remaining) [2023-12-15 23:26:37,996 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:26:38,003 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 23:26:38,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:26:38 BoogieIcfgContainer [2023-12-15 23:26:38,006 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 23:26:38,006 INFO L158 Benchmark]: Toolchain (without parser) took 47621.39ms. Allocated memory was 190.8MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 142.0MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2023-12-15 23:26:38,006 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 23:26:38,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1725.66ms. Allocated memory was 190.8MB in the beginning and 245.4MB in the end (delta: 54.5MB). Free memory was 141.5MB in the beginning and 184.4MB in the end (delta: -42.9MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. [2023-12-15 23:26:38,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.46ms. Allocated memory is still 245.4MB. Free memory was 184.4MB in the beginning and 167.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 23:26:38,007 INFO L158 Benchmark]: Boogie Preprocessor took 178.04ms. Allocated memory is still 245.4MB. Free memory was 167.1MB in the beginning and 151.5MB in the end (delta: 15.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 23:26:38,008 INFO L158 Benchmark]: RCFGBuilder took 2314.35ms. Allocated memory is still 245.4MB. Free memory was 151.4MB in the beginning and 139.5MB in the end (delta: 11.9MB). Peak memory consumption was 96.8MB. Max. memory is 8.0GB. [2023-12-15 23:26:38,008 INFO L158 Benchmark]: TraceAbstraction took 43256.10ms. Allocated memory was 245.4MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 139.0MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2023-12-15 23:26:38,009 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.15ms. Allocated memory is still 190.8MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1725.66ms. Allocated memory was 190.8MB in the beginning and 245.4MB in the end (delta: 54.5MB). Free memory was 141.5MB in the beginning and 184.4MB in the end (delta: -42.9MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 138.46ms. Allocated memory is still 245.4MB. Free memory was 184.4MB in the beginning and 167.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 178.04ms. Allocated memory is still 245.4MB. Free memory was 167.1MB in the beginning and 151.5MB in the end (delta: 15.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * RCFGBuilder took 2314.35ms. Allocated memory is still 245.4MB. Free memory was 151.4MB in the beginning and 139.5MB in the end (delta: 11.9MB). Peak memory consumption was 96.8MB. Max. memory is 8.0GB. * TraceAbstraction took 43256.10ms. Allocated memory was 245.4MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 139.0MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 4.1GB. 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: 1859]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1859). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1916]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1916). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2056]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2056). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2113]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2113). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2336]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2336). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2393]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2393). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2533]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2533). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2612]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2612). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3859]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3859). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3916]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3916). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4056]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4056). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4405]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4405). Cancelled while NwaCegarLoop was constructing difference of abstraction (416608states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (999904 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 915 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 43.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.5s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26377 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26377 mSDsluCounter, 58031 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20945 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 725 IncrementalHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 37086 mSDtfsCounter, 725 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=416608occurred in iteration=14, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 189782 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 4443 NumberOfCodeBlocks, 4443 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4428 ConstructedInterpolants, 0 QuantifiedInterpolants, 11051 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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