/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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:29:50,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:29:50,903 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-19 15:29:50,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:29:50,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:29:50,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:29:50,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:29:50,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:29:50,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:29:50,937 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:29:50,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:29:50,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:29:50,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:29:50,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:29:50,939 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:29:50,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:29:50,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:29:50,939 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:29:50,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:29:50,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:29:50,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:29:50,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:29:50,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:29:50,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:29:50,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:29:50,941 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:29:50,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:29:50,941 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:29:50,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:29:50,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:29:50,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:29:50,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:29:50,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:29:50,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:29:50,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:29:50,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:29:50,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:29:50,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:29:50,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:29:50,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:29:50,943 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:29:50,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:29:50,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:29:50,944 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-19 15:29:51,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:29:51,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:29:51,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:29:51,167 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:29:51,167 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:29:51,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i [2023-12-19 15:29:52,256 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:29:52,432 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:29:52,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i [2023-12-19 15:29:52,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c61fdf2d/d966ef53557c4af4be31ba3813c35fb6/FLAGfd76ebdb4 [2023-12-19 15:29:52,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c61fdf2d/d966ef53557c4af4be31ba3813c35fb6 [2023-12-19 15:29:52,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:29:52,470 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:29:52,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:29:52,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:29:52,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:29:52,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392dd1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52, skipping insertion in model container [2023-12-19 15:29:52,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,499 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:29:52,636 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2023-12-19 15:29:52,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:29:52,708 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:29:52,719 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2023-12-19 15:29:52,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:29:52,754 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:29:52,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52 WrapperNode [2023-12-19 15:29:52,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:29:52,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:29:52,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:29:52,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:29:52,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,800 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 527 [2023-12-19 15:29:52,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:29:52,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:29:52,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:29:52,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:29:52,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,847 INFO L175 MemorySlicer]: Split 127 memory accesses to 13 slices as follows [2, 11, 10, 6, 14, 9, 14, 10, 5, 8, 14, 14, 10]. 11 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1]. [2023-12-19 15:29:52,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:29:52,890 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:29:52,890 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:29:52,890 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:29:52,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (1/1) ... [2023-12-19 15:29:52,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:29:52,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:29:52,941 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-19 15:29:53,007 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-19 15:29:53,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:29:53,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:29:53,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:29:53,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 15:29:53,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 15:29:53,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-19 15:29:53,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-19 15:29:53,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-19 15:29:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-19 15:29:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-19 15:29:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-19 15:29:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-19 15:29:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-19 15:29:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-19 15:29:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:29:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:29:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 15:29:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 15:29:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 15:29:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-19 15:29:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-19 15:29:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-19 15:29:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-19 15:29:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-19 15:29:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-19 15:29:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-19 15:29:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-19 15:29:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:29:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:29:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 15:29:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:29:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:29:53,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:29:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 15:29:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 15:29:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-19 15:29:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-19 15:29:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-19 15:29:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-19 15:29:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-19 15:29:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-19 15:29:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-19 15:29:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-19 15:29:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-19 15:29:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:29:53,041 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:29:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:29:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:29:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 15:29:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 15:29:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 15:29:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-19 15:29:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-19 15:29:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-19 15:29:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-19 15:29:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-19 15:29:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-19 15:29:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-19 15:29:53,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-19 15:29:53,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:29:53,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:29:53,190 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:29:53,192 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:29:53,585 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:29:53,623 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:29:53,623 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:29:53,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:29:53 BoogieIcfgContainer [2023-12-19 15:29:53,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:29:53,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:29:53,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:29:53,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:29:53,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:29:52" (1/3) ... [2023-12-19 15:29:53,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfabdf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:29:53, skipping insertion in model container [2023-12-19 15:29:53,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:29:52" (2/3) ... [2023-12-19 15:29:53,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfabdf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:29:53, skipping insertion in model container [2023-12-19 15:29:53,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:29:53" (3/3) ... [2023-12-19 15:29:53,629 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-15.i [2023-12-19 15:29:53,642 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:29:53,643 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:29:53,689 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:29:53,694 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;@4513199a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:29:53,694 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:29:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:29:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:29:53,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:53,725 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:53,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:53,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:53,745 INFO L85 PathProgramCache]: Analyzing trace with hash 525160248, now seen corresponding path program 1 times [2023-12-19 15:29:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443548224] [2023-12-19 15:29:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443548224] [2023-12-19 15:29:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443548224] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:54,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:54,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:29:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191347011] [2023-12-19 15:29:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:54,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:29:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:54,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:29:54,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:29:54,082 INFO L87 Difference]: Start difference. First operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:29:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:54,135 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2023-12-19 15:29:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:29:54,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-19 15:29:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:54,147 INFO L225 Difference]: With dead ends: 209 [2023-12-19 15:29:54,147 INFO L226 Difference]: Without dead ends: 104 [2023-12-19 15:29:54,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:29:54,151 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:54,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:29:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-19 15:29:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-19 15:29:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:29:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-12-19 15:29:54,179 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2023-12-19 15:29:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:54,179 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-12-19 15:29:54,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:29:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-12-19 15:29:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:29:54,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:54,182 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:54,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:29:54,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:54,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2106096342, now seen corresponding path program 1 times [2023-12-19 15:29:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:54,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333725260] [2023-12-19 15:29:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:54,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333725260] [2023-12-19 15:29:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333725260] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:54,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:54,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:29:54,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953367770] [2023-12-19 15:29:54,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:54,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:29:54,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:54,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:29:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:29:54,353 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:54,388 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2023-12-19 15:29:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:29:54,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-19 15:29:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:54,392 INFO L225 Difference]: With dead ends: 208 [2023-12-19 15:29:54,392 INFO L226 Difference]: Without dead ends: 105 [2023-12-19 15:29:54,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-19 15:29:54,393 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:54,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:29:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-19 15:29:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-19 15:29:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:29:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2023-12-19 15:29:54,401 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 110 [2023-12-19 15:29:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:54,402 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2023-12-19 15:29:54,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2023-12-19 15:29:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:29:54,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:54,403 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:54,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:29:54,403 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:54,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash 194726248, now seen corresponding path program 1 times [2023-12-19 15:29:54,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:54,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781751659] [2023-12-19 15:29:54,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:54,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:54,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781751659] [2023-12-19 15:29:54,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781751659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:54,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:54,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:29:54,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490602018] [2023-12-19 15:29:54,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:54,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:29:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:54,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:29:54,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:29:54,542 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:54,590 INFO L93 Difference]: Finished difference Result 233 states and 340 transitions. [2023-12-19 15:29:54,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:29:54,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-19 15:29:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:54,608 INFO L225 Difference]: With dead ends: 233 [2023-12-19 15:29:54,608 INFO L226 Difference]: Without dead ends: 129 [2023-12-19 15:29:54,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-19 15:29:54,609 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:54,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 316 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:29:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-19 15:29:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 106. [2023-12-19 15:29:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:29:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2023-12-19 15:29:54,617 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2023-12-19 15:29:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:54,617 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2023-12-19 15:29:54,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2023-12-19 15:29:54,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:29:54,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:54,619 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:54,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:29:54,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:54,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:54,620 INFO L85 PathProgramCache]: Analyzing trace with hash 895790826, now seen corresponding path program 1 times [2023-12-19 15:29:54,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:54,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473092030] [2023-12-19 15:29:54,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:54,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:54,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473092030] [2023-12-19 15:29:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473092030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:54,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:54,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:29:54,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825843726] [2023-12-19 15:29:54,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:54,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:29:54,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:29:54,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:29:54,927 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:55,029 INFO L93 Difference]: Finished difference Result 288 states and 414 transitions. [2023-12-19 15:29:55,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:29:55,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-19 15:29:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:55,032 INFO L225 Difference]: With dead ends: 288 [2023-12-19 15:29:55,032 INFO L226 Difference]: Without dead ends: 183 [2023-12-19 15:29:55,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:29:55,044 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 122 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:55,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 694 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:29:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-12-19 15:29:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 159. [2023-12-19 15:29:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.4) internal successors, (196), 141 states have internal predecessors, (196), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 15:29:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 228 transitions. [2023-12-19 15:29:55,054 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 228 transitions. Word has length 110 [2023-12-19 15:29:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:55,054 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 228 transitions. [2023-12-19 15:29:55,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 228 transitions. [2023-12-19 15:29:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-19 15:29:55,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:55,056 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:55,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:29:55,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:55,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:55,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1920041920, now seen corresponding path program 1 times [2023-12-19 15:29:55,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:55,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137894160] [2023-12-19 15:29:55,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:55,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:55,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:55,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137894160] [2023-12-19 15:29:55,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137894160] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:55,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:55,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:29:55,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698795244] [2023-12-19 15:29:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:55,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:29:55,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:55,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:29:55,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:29:55,502 INFO L87 Difference]: Start difference. First operand 159 states and 228 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:55,667 INFO L93 Difference]: Finished difference Result 517 states and 743 transitions. [2023-12-19 15:29:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:29:55,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2023-12-19 15:29:55,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:55,671 INFO L225 Difference]: With dead ends: 517 [2023-12-19 15:29:55,671 INFO L226 Difference]: Without dead ends: 359 [2023-12-19 15:29:55,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:29:55,673 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 402 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:55,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 530 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:29:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-19 15:29:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 309. [2023-12-19 15:29:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 272 states have (on average 1.400735294117647) internal successors, (381), 274 states have internal predecessors, (381), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:29:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 445 transitions. [2023-12-19 15:29:55,710 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 445 transitions. Word has length 111 [2023-12-19 15:29:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:55,711 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 445 transitions. [2023-12-19 15:29:55,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 445 transitions. [2023-12-19 15:29:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 15:29:55,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:55,715 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:55,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:29:55,715 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:55,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:55,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1321845930, now seen corresponding path program 1 times [2023-12-19 15:29:55,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:55,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351009321] [2023-12-19 15:29:55,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:55,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:56,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:56,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351009321] [2023-12-19 15:29:56,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351009321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:56,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:56,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:29:56,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346436100] [2023-12-19 15:29:56,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:56,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:29:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:56,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:29:56,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:29:56,047 INFO L87 Difference]: Start difference. First operand 309 states and 445 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:56,183 INFO L93 Difference]: Finished difference Result 621 states and 893 transitions. [2023-12-19 15:29:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:29:56,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-19 15:29:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:56,185 INFO L225 Difference]: With dead ends: 621 [2023-12-19 15:29:56,185 INFO L226 Difference]: Without dead ends: 313 [2023-12-19 15:29:56,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:29:56,186 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 221 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:56,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 569 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:29:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-12-19 15:29:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 308. [2023-12-19 15:29:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 271 states have (on average 1.3985239852398523) internal successors, (379), 273 states have internal predecessors, (379), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:29:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 443 transitions. [2023-12-19 15:29:56,198 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 443 transitions. Word has length 112 [2023-12-19 15:29:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:56,198 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 443 transitions. [2023-12-19 15:29:56,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 443 transitions. [2023-12-19 15:29:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 15:29:56,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:56,200 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:56,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:29:56,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:56,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1507718356, now seen corresponding path program 1 times [2023-12-19 15:29:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:56,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362185502] [2023-12-19 15:29:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:56,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:56,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362185502] [2023-12-19 15:29:56,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362185502] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:56,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:56,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:29:56,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138833621] [2023-12-19 15:29:56,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:56,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:29:56,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:56,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:29:56,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:29:56,412 INFO L87 Difference]: Start difference. First operand 308 states and 443 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:56,513 INFO L93 Difference]: Finished difference Result 867 states and 1251 transitions. [2023-12-19 15:29:56,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:29:56,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-19 15:29:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:56,516 INFO L225 Difference]: With dead ends: 867 [2023-12-19 15:29:56,516 INFO L226 Difference]: Without dead ends: 560 [2023-12-19 15:29:56,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:29:56,518 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 222 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:56,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1116 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:29:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2023-12-19 15:29:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 516. [2023-12-19 15:29:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 455 states have internal predecessors, (634), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-19 15:29:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 746 transitions. [2023-12-19 15:29:56,544 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 746 transitions. Word has length 113 [2023-12-19 15:29:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:56,546 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 746 transitions. [2023-12-19 15:29:56,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 746 transitions. [2023-12-19 15:29:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 15:29:56,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:56,547 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:56,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:29:56,548 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:56,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash 839754427, now seen corresponding path program 1 times [2023-12-19 15:29:56,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:56,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534961514] [2023-12-19 15:29:56,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534961514] [2023-12-19 15:29:56,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534961514] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:56,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:56,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:29:56,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662378878] [2023-12-19 15:29:56,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:56,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:29:56,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:56,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:29:56,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:29:56,807 INFO L87 Difference]: Start difference. First operand 516 states and 746 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:56,862 INFO L93 Difference]: Finished difference Result 1377 states and 1987 transitions. [2023-12-19 15:29:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:29:56,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-19 15:29:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:56,865 INFO L225 Difference]: With dead ends: 1377 [2023-12-19 15:29:56,865 INFO L226 Difference]: Without dead ends: 862 [2023-12-19 15:29:56,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:29:56,867 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 137 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:56,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 651 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:29:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2023-12-19 15:29:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 598. [2023-12-19 15:29:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 535 states have (on average 1.4093457943925234) internal successors, (754), 537 states have internal predecessors, (754), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-19 15:29:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 866 transitions. [2023-12-19 15:29:56,891 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 866 transitions. Word has length 113 [2023-12-19 15:29:56,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:56,891 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 866 transitions. [2023-12-19 15:29:56,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:56,892 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 866 transitions. [2023-12-19 15:29:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 15:29:56,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:56,893 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:56,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:29:56,893 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:56,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash -393530266, now seen corresponding path program 1 times [2023-12-19 15:29:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:56,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992229946] [2023-12-19 15:29:56,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:57,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:57,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992229946] [2023-12-19 15:29:57,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992229946] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:57,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:57,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:29:57,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988235161] [2023-12-19 15:29:57,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:57,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:29:57,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:57,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:29:57,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:29:57,111 INFO L87 Difference]: Start difference. First operand 598 states and 866 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:57,168 INFO L93 Difference]: Finished difference Result 1387 states and 2000 transitions. [2023-12-19 15:29:57,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:29:57,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-19 15:29:57,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:57,174 INFO L225 Difference]: With dead ends: 1387 [2023-12-19 15:29:57,174 INFO L226 Difference]: Without dead ends: 790 [2023-12-19 15:29:57,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:29:57,176 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 68 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:57,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 639 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:29:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2023-12-19 15:29:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 596. [2023-12-19 15:29:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 533 states have (on average 1.403377110694184) internal successors, (748), 535 states have internal predecessors, (748), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-19 15:29:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 860 transitions. [2023-12-19 15:29:57,201 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 860 transitions. Word has length 113 [2023-12-19 15:29:57,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:57,201 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 860 transitions. [2023-12-19 15:29:57,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 860 transitions. [2023-12-19 15:29:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 15:29:57,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:57,202 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:57,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 15:29:57,202 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:57,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2082474008, now seen corresponding path program 1 times [2023-12-19 15:29:57,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:57,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958440914] [2023-12-19 15:29:57,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:57,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:57,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:57,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958440914] [2023-12-19 15:29:57,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958440914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:57,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:57,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:29:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915941325] [2023-12-19 15:29:57,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:57,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:29:57,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:57,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:29:57,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:29:57,483 INFO L87 Difference]: Start difference. First operand 596 states and 860 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:57,583 INFO L93 Difference]: Finished difference Result 1205 states and 1738 transitions. [2023-12-19 15:29:57,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:29:57,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-19 15:29:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:57,586 INFO L225 Difference]: With dead ends: 1205 [2023-12-19 15:29:57,586 INFO L226 Difference]: Without dead ends: 899 [2023-12-19 15:29:57,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:29:57,587 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 240 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:57,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 676 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:29:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2023-12-19 15:29:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 865. [2023-12-19 15:29:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 771 states have (on average 1.398184176394293) internal successors, (1078), 774 states have internal predecessors, (1078), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:29:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1246 transitions. [2023-12-19 15:29:57,614 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1246 transitions. Word has length 113 [2023-12-19 15:29:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:57,615 INFO L495 AbstractCegarLoop]: Abstraction has 865 states and 1246 transitions. [2023-12-19 15:29:57,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:57,615 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1246 transitions. [2023-12-19 15:29:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:29:57,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:57,616 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:57,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 15:29:57,616 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:57,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash -782680435, now seen corresponding path program 1 times [2023-12-19 15:29:57,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:57,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829350355] [2023-12-19 15:29:57,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:57,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:57,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:57,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829350355] [2023-12-19 15:29:57,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829350355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:57,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:57,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:29:57,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530636237] [2023-12-19 15:29:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:57,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:29:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:57,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:29:57,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:29:57,781 INFO L87 Difference]: Start difference. First operand 865 states and 1246 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:57,851 INFO L93 Difference]: Finished difference Result 1817 states and 2611 transitions. [2023-12-19 15:29:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:29:57,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:29:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:57,854 INFO L225 Difference]: With dead ends: 1817 [2023-12-19 15:29:57,854 INFO L226 Difference]: Without dead ends: 953 [2023-12-19 15:29:57,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:29:57,856 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 69 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:57,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 656 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:29:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2023-12-19 15:29:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 807. [2023-12-19 15:29:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 713 states have (on average 1.3955119214586256) internal successors, (995), 716 states have internal predecessors, (995), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:29:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1163 transitions. [2023-12-19 15:29:57,883 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1163 transitions. Word has length 114 [2023-12-19 15:29:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:57,883 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 1163 transitions. [2023-12-19 15:29:57,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1163 transitions. [2023-12-19 15:29:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:29:57,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:57,885 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:57,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 15:29:57,885 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:57,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:57,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1667505093, now seen corresponding path program 1 times [2023-12-19 15:29:57,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:57,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081978069] [2023-12-19 15:29:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:58,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:58,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081978069] [2023-12-19 15:29:58,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081978069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:58,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:58,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:29:58,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799472453] [2023-12-19 15:29:58,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:58,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:29:58,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:58,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:29:58,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:29:58,094 INFO L87 Difference]: Start difference. First operand 807 states and 1163 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:58,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:58,156 INFO L93 Difference]: Finished difference Result 1370 states and 1969 transitions. [2023-12-19 15:29:58,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:29:58,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:29:58,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:58,159 INFO L225 Difference]: With dead ends: 1370 [2023-12-19 15:29:58,159 INFO L226 Difference]: Without dead ends: 811 [2023-12-19 15:29:58,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:29:58,162 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 64 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:58,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 724 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:29:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2023-12-19 15:29:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 777. [2023-12-19 15:29:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 683 states have (on average 1.3879941434846266) internal successors, (948), 686 states have internal predecessors, (948), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:29:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1116 transitions. [2023-12-19 15:29:58,192 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1116 transitions. Word has length 114 [2023-12-19 15:29:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:58,193 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1116 transitions. [2023-12-19 15:29:58,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1116 transitions. [2023-12-19 15:29:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:29:58,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:58,194 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:58,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 15:29:58,194 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:58,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash -140945536, now seen corresponding path program 1 times [2023-12-19 15:29:58,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:58,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499425640] [2023-12-19 15:29:58,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:58,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:58,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:58,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499425640] [2023-12-19 15:29:58,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499425640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:58,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:58,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:29:58,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236400958] [2023-12-19 15:29:58,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:58,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:29:58,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:58,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:29:58,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:29:58,388 INFO L87 Difference]: Start difference. First operand 777 states and 1116 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:58,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:58,449 INFO L93 Difference]: Finished difference Result 1607 states and 2306 transitions. [2023-12-19 15:29:58,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:29:58,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:29:58,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:58,454 INFO L225 Difference]: With dead ends: 1607 [2023-12-19 15:29:58,454 INFO L226 Difference]: Without dead ends: 831 [2023-12-19 15:29:58,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:29:58,456 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 101 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:58,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 602 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:29:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2023-12-19 15:29:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 777. [2023-12-19 15:29:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 683 states have (on average 1.3777452415812592) internal successors, (941), 686 states have internal predecessors, (941), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:29:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1109 transitions. [2023-12-19 15:29:58,486 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1109 transitions. Word has length 114 [2023-12-19 15:29:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:58,486 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1109 transitions. [2023-12-19 15:29:58,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1109 transitions. [2023-12-19 15:29:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:29:58,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:58,488 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:58,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 15:29:58,488 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:58,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash -727751550, now seen corresponding path program 1 times [2023-12-19 15:29:58,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:58,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594278752] [2023-12-19 15:29:58,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:58,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:58,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:58,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594278752] [2023-12-19 15:29:58,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594278752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:58,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:58,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:29:58,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444770331] [2023-12-19 15:29:58,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:58,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:29:58,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:58,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:29:58,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:29:58,890 INFO L87 Difference]: Start difference. First operand 777 states and 1109 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:59,199 INFO L93 Difference]: Finished difference Result 1687 states and 2400 transitions. [2023-12-19 15:29:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:29:59,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:29:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:59,202 INFO L225 Difference]: With dead ends: 1687 [2023-12-19 15:29:59,202 INFO L226 Difference]: Without dead ends: 911 [2023-12-19 15:29:59,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:29:59,204 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 412 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:59,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1408 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:29:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2023-12-19 15:29:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 787. [2023-12-19 15:29:59,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 693 states have (on average 1.3751803751803753) internal successors, (953), 696 states have internal predecessors, (953), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:29:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1121 transitions. [2023-12-19 15:29:59,235 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1121 transitions. Word has length 114 [2023-12-19 15:29:59,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:59,235 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1121 transitions. [2023-12-19 15:29:59,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1121 transitions. [2023-12-19 15:29:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:29:59,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:59,237 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:59,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 15:29:59,237 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:59,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1831430926, now seen corresponding path program 1 times [2023-12-19 15:29:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:59,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030011732] [2023-12-19 15:29:59,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:59,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:59,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:59,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030011732] [2023-12-19 15:29:59,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030011732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:59,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:59,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:29:59,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433840987] [2023-12-19 15:29:59,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:59,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:29:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:59,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:29:59,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:29:59,421 INFO L87 Difference]: Start difference. First operand 787 states and 1121 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:29:59,481 INFO L93 Difference]: Finished difference Result 1439 states and 2046 transitions. [2023-12-19 15:29:59,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:29:59,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:29:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:29:59,484 INFO L225 Difference]: With dead ends: 1439 [2023-12-19 15:29:59,484 INFO L226 Difference]: Without dead ends: 881 [2023-12-19 15:29:59,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:29:59,486 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 166 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:29:59,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 785 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:29:59,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2023-12-19 15:29:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 871. [2023-12-19 15:29:59,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 763 states have (on average 1.3695937090432504) internal successors, (1045), 766 states have internal predecessors, (1045), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-19 15:29:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1237 transitions. [2023-12-19 15:29:59,543 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1237 transitions. Word has length 114 [2023-12-19 15:29:59,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:29:59,544 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1237 transitions. [2023-12-19 15:29:59,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:29:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1237 transitions. [2023-12-19 15:29:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:29:59,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:29:59,545 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:29:59,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 15:29:59,545 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:29:59,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:29:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1195476484, now seen corresponding path program 1 times [2023-12-19 15:29:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:29:59,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134056591] [2023-12-19 15:29:59,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:29:59,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:29:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:29:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:29:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:29:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:29:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:29:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:29:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:29:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:29:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:29:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:29:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:29:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:29:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:29:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:29:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:29:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134056591] [2023-12-19 15:29:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134056591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:29:59,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:29:59,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:29:59,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149831169] [2023-12-19 15:29:59,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:29:59,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:29:59,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:29:59,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:29:59,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:29:59,906 INFO L87 Difference]: Start difference. First operand 871 states and 1237 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:00,283 INFO L93 Difference]: Finished difference Result 2068 states and 2935 transitions. [2023-12-19 15:30:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:30:00,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:30:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:00,287 INFO L225 Difference]: With dead ends: 2068 [2023-12-19 15:30:00,287 INFO L226 Difference]: Without dead ends: 1198 [2023-12-19 15:30:00,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:30:00,289 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 449 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:00,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1212 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:30:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2023-12-19 15:30:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 881. [2023-12-19 15:30:00,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 773 states have (on average 1.3661060802069858) internal successors, (1056), 776 states have internal predecessors, (1056), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-19 15:30:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1248 transitions. [2023-12-19 15:30:00,326 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1248 transitions. Word has length 114 [2023-12-19 15:30:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:00,326 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1248 transitions. [2023-12-19 15:30:00,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:00,327 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1248 transitions. [2023-12-19 15:30:00,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 15:30:00,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:00,328 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:00,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 15:30:00,328 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:00,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash -877264650, now seen corresponding path program 1 times [2023-12-19 15:30:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:00,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661231552] [2023-12-19 15:30:00,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:00,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:00,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:00,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661231552] [2023-12-19 15:30:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661231552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:30:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004859735] [2023-12-19 15:30:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:00,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:30:00,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:00,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:30:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:30:00,689 INFO L87 Difference]: Start difference. First operand 881 states and 1248 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:01,059 INFO L93 Difference]: Finished difference Result 1914 states and 2710 transitions. [2023-12-19 15:30:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:30:01,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-19 15:30:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:01,063 INFO L225 Difference]: With dead ends: 1914 [2023-12-19 15:30:01,063 INFO L226 Difference]: Without dead ends: 1034 [2023-12-19 15:30:01,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:30:01,065 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 642 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:01,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1052 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:30:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2023-12-19 15:30:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 881. [2023-12-19 15:30:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 773 states have (on average 1.3648124191461837) internal successors, (1055), 776 states have internal predecessors, (1055), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-19 15:30:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1247 transitions. [2023-12-19 15:30:01,104 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1247 transitions. Word has length 115 [2023-12-19 15:30:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:01,105 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1247 transitions. [2023-12-19 15:30:01,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1247 transitions. [2023-12-19 15:30:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:30:01,106 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:01,106 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:01,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 15:30:01,106 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:01,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:01,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2046313010, now seen corresponding path program 1 times [2023-12-19 15:30:01,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:01,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031629264] [2023-12-19 15:30:01,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:01,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:01,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:01,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031629264] [2023-12-19 15:30:01,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031629264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:01,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:01,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:30:01,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050432017] [2023-12-19 15:30:01,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:01,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:30:01,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:01,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:30:01,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:30:01,730 INFO L87 Difference]: Start difference. First operand 881 states and 1247 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:30:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:02,701 INFO L93 Difference]: Finished difference Result 2266 states and 3218 transitions. [2023-12-19 15:30:02,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 15:30:02,702 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2023-12-19 15:30:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:02,707 INFO L225 Difference]: With dead ends: 2266 [2023-12-19 15:30:02,707 INFO L226 Difference]: Without dead ends: 1653 [2023-12-19 15:30:02,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2023-12-19 15:30:02,709 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 528 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:02,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 2206 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 15:30:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2023-12-19 15:30:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 965. [2023-12-19 15:30:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 857 states have (on average 1.3617269544924153) internal successors, (1167), 860 states have internal predecessors, (1167), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-19 15:30:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1359 transitions. [2023-12-19 15:30:02,774 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1359 transitions. Word has length 116 [2023-12-19 15:30:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:02,774 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1359 transitions. [2023-12-19 15:30:02,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:30:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1359 transitions. [2023-12-19 15:30:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:30:02,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:02,776 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:02,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 15:30:02,776 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:02,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2108105676, now seen corresponding path program 1 times [2023-12-19 15:30:02,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:02,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159515486] [2023-12-19 15:30:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:02,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:03,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:03,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159515486] [2023-12-19 15:30:03,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159515486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:03,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:03,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:30:03,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945596751] [2023-12-19 15:30:03,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:03,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:30:03,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:03,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:30:03,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:30:03,441 INFO L87 Difference]: Start difference. First operand 965 states and 1359 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:30:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:04,574 INFO L93 Difference]: Finished difference Result 2400 states and 3396 transitions. [2023-12-19 15:30:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 15:30:04,576 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2023-12-19 15:30:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:04,580 INFO L225 Difference]: With dead ends: 2400 [2023-12-19 15:30:04,580 INFO L226 Difference]: Without dead ends: 1703 [2023-12-19 15:30:04,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2023-12-19 15:30:04,582 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 499 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:04,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2279 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 15:30:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2023-12-19 15:30:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 931. [2023-12-19 15:30:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 823 states have (on average 1.362089914945322) internal successors, (1121), 826 states have internal predecessors, (1121), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-19 15:30:04,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1313 transitions. [2023-12-19 15:30:04,655 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1313 transitions. Word has length 116 [2023-12-19 15:30:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:04,655 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1313 transitions. [2023-12-19 15:30:04,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:30:04,656 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1313 transitions. [2023-12-19 15:30:04,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:30:04,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:04,657 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:04,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 15:30:04,657 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:04,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:04,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1083263989, now seen corresponding path program 1 times [2023-12-19 15:30:04,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:04,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865006763] [2023-12-19 15:30:04,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:04,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:04,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:04,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865006763] [2023-12-19 15:30:04,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865006763] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:04,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:04,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:30:04,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257155275] [2023-12-19 15:30:04,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:04,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:30:04,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:04,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:30:04,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:30:04,799 INFO L87 Difference]: Start difference. First operand 931 states and 1313 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:04,901 INFO L93 Difference]: Finished difference Result 1988 states and 2814 transitions. [2023-12-19 15:30:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:30:04,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-19 15:30:04,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:04,905 INFO L225 Difference]: With dead ends: 1988 [2023-12-19 15:30:04,905 INFO L226 Difference]: Without dead ends: 1058 [2023-12-19 15:30:04,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:30:04,907 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 126 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:04,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 582 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:30:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2023-12-19 15:30:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 917. [2023-12-19 15:30:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 809 states have (on average 1.3597033374536465) internal successors, (1100), 812 states have internal predecessors, (1100), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-19 15:30:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1292 transitions. [2023-12-19 15:30:04,984 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1292 transitions. Word has length 116 [2023-12-19 15:30:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:04,984 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1292 transitions. [2023-12-19 15:30:04,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1292 transitions. [2023-12-19 15:30:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:30:04,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:04,986 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:04,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 15:30:04,986 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:04,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash -931799564, now seen corresponding path program 1 times [2023-12-19 15:30:04,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:04,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244612713] [2023-12-19 15:30:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:05,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:05,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244612713] [2023-12-19 15:30:05,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244612713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:05,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:05,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:30:05,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718083164] [2023-12-19 15:30:05,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:05,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:30:05,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:30:05,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:30:05,151 INFO L87 Difference]: Start difference. First operand 917 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:05,244 INFO L93 Difference]: Finished difference Result 1531 states and 2157 transitions. [2023-12-19 15:30:05,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:30:05,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-19 15:30:05,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:05,247 INFO L225 Difference]: With dead ends: 1531 [2023-12-19 15:30:05,247 INFO L226 Difference]: Without dead ends: 876 [2023-12-19 15:30:05,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:30:05,248 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 64 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:05,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 551 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:30:05,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2023-12-19 15:30:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 870. [2023-12-19 15:30:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 762 states have (on average 1.347769028871391) internal successors, (1027), 765 states have internal predecessors, (1027), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-19 15:30:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1219 transitions. [2023-12-19 15:30:05,324 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1219 transitions. Word has length 116 [2023-12-19 15:30:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:05,325 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 1219 transitions. [2023-12-19 15:30:05,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1219 transitions. [2023-12-19 15:30:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:30:05,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:05,326 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:05,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 15:30:05,326 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:05,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1298680799, now seen corresponding path program 1 times [2023-12-19 15:30:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:05,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179041076] [2023-12-19 15:30:05,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:05,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:05,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:05,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179041076] [2023-12-19 15:30:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179041076] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:05,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:05,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:30:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919395017] [2023-12-19 15:30:05,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:05,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:30:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:30:05,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:30:05,499 INFO L87 Difference]: Start difference. First operand 870 states and 1219 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:05,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:05,692 INFO L93 Difference]: Finished difference Result 1908 states and 2670 transitions. [2023-12-19 15:30:05,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:30:05,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-19 15:30:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:05,695 INFO L225 Difference]: With dead ends: 1908 [2023-12-19 15:30:05,695 INFO L226 Difference]: Without dead ends: 1039 [2023-12-19 15:30:05,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-19 15:30:05,698 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 341 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:05,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1123 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:30:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2023-12-19 15:30:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 888. [2023-12-19 15:30:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 780 states have (on average 1.337179487179487) internal successors, (1043), 783 states have internal predecessors, (1043), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-19 15:30:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1235 transitions. [2023-12-19 15:30:05,808 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1235 transitions. Word has length 116 [2023-12-19 15:30:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:05,808 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1235 transitions. [2023-12-19 15:30:05,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1235 transitions. [2023-12-19 15:30:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:30:05,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:05,810 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:05,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 15:30:05,811 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:05,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:05,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1721382625, now seen corresponding path program 1 times [2023-12-19 15:30:05,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:05,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257979149] [2023-12-19 15:30:05,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:05,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:06,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:06,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257979149] [2023-12-19 15:30:06,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257979149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:06,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:06,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:30:06,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024082541] [2023-12-19 15:30:06,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:06,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:30:06,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:06,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:30:06,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:30:06,165 INFO L87 Difference]: Start difference. First operand 888 states and 1235 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-19 15:30:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:06,376 INFO L93 Difference]: Finished difference Result 2049 states and 2831 transitions. [2023-12-19 15:30:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:30:06,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 116 [2023-12-19 15:30:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:06,380 INFO L225 Difference]: With dead ends: 2049 [2023-12-19 15:30:06,380 INFO L226 Difference]: Without dead ends: 1162 [2023-12-19 15:30:06,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:30:06,382 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 266 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:06,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 965 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:30:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2023-12-19 15:30:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 999. [2023-12-19 15:30:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 879 states have (on average 1.3276450511945392) internal successors, (1167), 885 states have internal predecessors, (1167), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2023-12-19 15:30:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1371 transitions. [2023-12-19 15:30:06,466 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1371 transitions. Word has length 116 [2023-12-19 15:30:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:06,466 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1371 transitions. [2023-12-19 15:30:06,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-19 15:30:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1371 transitions. [2023-12-19 15:30:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 15:30:06,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:06,468 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:06,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 15:30:06,468 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:06,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:06,468 INFO L85 PathProgramCache]: Analyzing trace with hash -511862782, now seen corresponding path program 1 times [2023-12-19 15:30:06,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:06,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832426944] [2023-12-19 15:30:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:06,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:07,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:07,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832426944] [2023-12-19 15:30:07,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832426944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:07,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:07,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 15:30:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664422873] [2023-12-19 15:30:07,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:07,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 15:30:07,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:07,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 15:30:07,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:30:07,179 INFO L87 Difference]: Start difference. First operand 999 states and 1371 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:30:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:08,208 INFO L93 Difference]: Finished difference Result 2054 states and 2824 transitions. [2023-12-19 15:30:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 15:30:08,209 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-19 15:30:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:08,212 INFO L225 Difference]: With dead ends: 2054 [2023-12-19 15:30:08,213 INFO L226 Difference]: Without dead ends: 1347 [2023-12-19 15:30:08,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2023-12-19 15:30:08,214 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 584 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:08,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1967 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 15:30:08,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2023-12-19 15:30:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1110. [2023-12-19 15:30:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 976 states have (on average 1.326844262295082) internal successors, (1295), 983 states have internal predecessors, (1295), 114 states have call successors, (114), 19 states have call predecessors, (114), 19 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2023-12-19 15:30:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1523 transitions. [2023-12-19 15:30:08,320 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1523 transitions. Word has length 117 [2023-12-19 15:30:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:08,320 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1523 transitions. [2023-12-19 15:30:08,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:30:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1523 transitions. [2023-12-19 15:30:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 15:30:08,321 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:08,321 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:08,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-19 15:30:08,321 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:08,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:08,321 INFO L85 PathProgramCache]: Analyzing trace with hash -449823168, now seen corresponding path program 1 times [2023-12-19 15:30:08,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:08,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366937359] [2023-12-19 15:30:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366937359] [2023-12-19 15:30:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366937359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:09,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:09,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 15:30:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082782861] [2023-12-19 15:30:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:09,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 15:30:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:09,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 15:30:09,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:30:09,264 INFO L87 Difference]: Start difference. First operand 1110 states and 1523 transitions. Second operand has 14 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-19 15:30:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:15,996 INFO L93 Difference]: Finished difference Result 2344 states and 3229 transitions. [2023-12-19 15:30:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-19 15:30:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 117 [2023-12-19 15:30:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:16,001 INFO L225 Difference]: With dead ends: 2344 [2023-12-19 15:30:16,001 INFO L226 Difference]: Without dead ends: 1526 [2023-12-19 15:30:16,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2023-12-19 15:30:16,003 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 912 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:16,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 2382 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-19 15:30:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2023-12-19 15:30:16,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1037. [2023-12-19 15:30:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 906 states have (on average 1.3278145695364238) internal successors, (1203), 912 states have internal predecessors, (1203), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2023-12-19 15:30:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1427 transitions. [2023-12-19 15:30:16,138 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1427 transitions. Word has length 117 [2023-12-19 15:30:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:16,138 INFO L495 AbstractCegarLoop]: Abstraction has 1037 states and 1427 transitions. [2023-12-19 15:30:16,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-19 15:30:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1427 transitions. [2023-12-19 15:30:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 15:30:16,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:16,140 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:16,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-19 15:30:16,140 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:16,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1039717707, now seen corresponding path program 1 times [2023-12-19 15:30:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:16,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015851327] [2023-12-19 15:30:16,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:16,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:16,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015851327] [2023-12-19 15:30:16,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015851327] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:16,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:16,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:30:16,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355854577] [2023-12-19 15:30:16,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:16,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:30:16,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:16,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:30:16,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:30:16,369 INFO L87 Difference]: Start difference. First operand 1037 states and 1427 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:16,665 INFO L93 Difference]: Finished difference Result 2427 states and 3331 transitions. [2023-12-19 15:30:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:30:16,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-19 15:30:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:16,669 INFO L225 Difference]: With dead ends: 2427 [2023-12-19 15:30:16,669 INFO L226 Difference]: Without dead ends: 1391 [2023-12-19 15:30:16,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:30:16,671 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 428 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:16,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 779 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:30:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-12-19 15:30:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1052. [2023-12-19 15:30:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 921 states have (on average 1.3257328990228012) internal successors, (1221), 927 states have internal predecessors, (1221), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2023-12-19 15:30:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1445 transitions. [2023-12-19 15:30:16,780 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1445 transitions. Word has length 117 [2023-12-19 15:30:16,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:16,780 INFO L495 AbstractCegarLoop]: Abstraction has 1052 states and 1445 transitions. [2023-12-19 15:30:16,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1445 transitions. [2023-12-19 15:30:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 15:30:16,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:16,782 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:16,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-19 15:30:16,782 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:16,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1432744717, now seen corresponding path program 1 times [2023-12-19 15:30:16,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:16,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744083453] [2023-12-19 15:30:16,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:16,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:17,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:17,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744083453] [2023-12-19 15:30:17,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744083453] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:17,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:17,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 15:30:17,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92790539] [2023-12-19 15:30:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:17,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 15:30:17,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:17,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 15:30:17,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:30:17,252 INFO L87 Difference]: Start difference. First operand 1052 states and 1445 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:17,770 INFO L93 Difference]: Finished difference Result 2193 states and 3012 transitions. [2023-12-19 15:30:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 15:30:17,771 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-19 15:30:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:17,774 INFO L225 Difference]: With dead ends: 2193 [2023-12-19 15:30:17,774 INFO L226 Difference]: Without dead ends: 1142 [2023-12-19 15:30:17,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2023-12-19 15:30:17,776 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 588 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:17,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1836 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:30:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2023-12-19 15:30:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1056. [2023-12-19 15:30:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 925 states have (on average 1.3243243243243243) internal successors, (1225), 931 states have internal predecessors, (1225), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 106 states have call predecessors, (112), 112 states have call successors, (112) [2023-12-19 15:30:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1449 transitions. [2023-12-19 15:30:17,871 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1449 transitions. Word has length 117 [2023-12-19 15:30:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:17,872 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 1449 transitions. [2023-12-19 15:30:17,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1449 transitions. [2023-12-19 15:30:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 15:30:17,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:17,873 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:17,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-19 15:30:17,873 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:17,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1062349961, now seen corresponding path program 1 times [2023-12-19 15:30:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:17,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096499952] [2023-12-19 15:30:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:18,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:18,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096499952] [2023-12-19 15:30:18,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096499952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:18,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:18,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 15:30:18,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148745537] [2023-12-19 15:30:18,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:18,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 15:30:18,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:18,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 15:30:18,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:30:18,392 INFO L87 Difference]: Start difference. First operand 1056 states and 1449 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:19,555 INFO L93 Difference]: Finished difference Result 2414 states and 3300 transitions. [2023-12-19 15:30:19,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-19 15:30:19,556 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-19 15:30:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:19,559 INFO L225 Difference]: With dead ends: 2414 [2023-12-19 15:30:19,559 INFO L226 Difference]: Without dead ends: 1359 [2023-12-19 15:30:19,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2023-12-19 15:30:19,561 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 483 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:19,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1701 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 15:30:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2023-12-19 15:30:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1123. [2023-12-19 15:30:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 977 states have (on average 1.3142272262026613) internal successors, (1284), 985 states have internal predecessors, (1284), 124 states have call successors, (124), 21 states have call predecessors, (124), 21 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-19 15:30:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1532 transitions. [2023-12-19 15:30:19,685 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1532 transitions. Word has length 117 [2023-12-19 15:30:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:19,685 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 1532 transitions. [2023-12-19 15:30:19,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1532 transitions. [2023-12-19 15:30:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 15:30:19,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:19,695 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:19,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-19 15:30:19,695 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:19,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1455376971, now seen corresponding path program 1 times [2023-12-19 15:30:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:19,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502000200] [2023-12-19 15:30:19,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:19,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:19,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502000200] [2023-12-19 15:30:19,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502000200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:19,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:19,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:30:19,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159889132] [2023-12-19 15:30:19,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:19,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:30:19,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:19,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:30:19,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:30:19,902 INFO L87 Difference]: Start difference. First operand 1123 states and 1532 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:20,254 INFO L93 Difference]: Finished difference Result 2465 states and 3358 transitions. [2023-12-19 15:30:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:30:20,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-19 15:30:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:20,267 INFO L225 Difference]: With dead ends: 2465 [2023-12-19 15:30:20,267 INFO L226 Difference]: Without dead ends: 1359 [2023-12-19 15:30:20,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:30:20,269 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 339 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:20,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1008 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:30:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2023-12-19 15:30:20,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1107. [2023-12-19 15:30:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 961 states have (on average 1.3111342351716961) internal successors, (1260), 969 states have internal predecessors, (1260), 124 states have call successors, (124), 21 states have call predecessors, (124), 21 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-19 15:30:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1508 transitions. [2023-12-19 15:30:20,374 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1508 transitions. Word has length 117 [2023-12-19 15:30:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:20,374 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 1508 transitions. [2023-12-19 15:30:20,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1508 transitions. [2023-12-19 15:30:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 15:30:20,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:20,375 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:20,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-19 15:30:20,375 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:20,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash -147869842, now seen corresponding path program 1 times [2023-12-19 15:30:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921999093] [2023-12-19 15:30:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921999093] [2023-12-19 15:30:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921999093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:30:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050040440] [2023-12-19 15:30:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:20,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:30:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:20,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:30:20,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:30:20,709 INFO L87 Difference]: Start difference. First operand 1107 states and 1508 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:20,996 INFO L93 Difference]: Finished difference Result 1918 states and 2630 transitions. [2023-12-19 15:30:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:30:20,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-12-19 15:30:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:20,999 INFO L225 Difference]: With dead ends: 1918 [2023-12-19 15:30:20,999 INFO L226 Difference]: Without dead ends: 1173 [2023-12-19 15:30:21,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:30:21,001 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 154 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:21,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1466 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:30:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2023-12-19 15:30:21,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1119. [2023-12-19 15:30:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 973 states have (on average 1.3072970195272353) internal successors, (1272), 981 states have internal predecessors, (1272), 124 states have call successors, (124), 21 states have call predecessors, (124), 21 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-19 15:30:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1520 transitions. [2023-12-19 15:30:21,106 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1520 transitions. Word has length 119 [2023-12-19 15:30:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:21,106 INFO L495 AbstractCegarLoop]: Abstraction has 1119 states and 1520 transitions. [2023-12-19 15:30:21,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1520 transitions. [2023-12-19 15:30:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 15:30:21,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:21,107 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:21,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-19 15:30:21,107 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:21,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:21,107 INFO L85 PathProgramCache]: Analyzing trace with hash 3594583, now seen corresponding path program 1 times [2023-12-19 15:30:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386622645] [2023-12-19 15:30:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:21,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386622645] [2023-12-19 15:30:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386622645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:21,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:30:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457944362] [2023-12-19 15:30:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:21,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:30:21,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:21,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:30:21,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:30:21,242 INFO L87 Difference]: Start difference. First operand 1119 states and 1520 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:21,386 INFO L93 Difference]: Finished difference Result 1858 states and 2534 transitions. [2023-12-19 15:30:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:30:21,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-12-19 15:30:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:21,388 INFO L225 Difference]: With dead ends: 1858 [2023-12-19 15:30:21,388 INFO L226 Difference]: Without dead ends: 1101 [2023-12-19 15:30:21,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:30:21,390 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 67 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:21,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 669 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:30:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2023-12-19 15:30:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1099. [2023-12-19 15:30:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 953 states have (on average 1.3011542497376705) internal successors, (1240), 961 states have internal predecessors, (1240), 124 states have call successors, (124), 21 states have call predecessors, (124), 21 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-19 15:30:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1488 transitions. [2023-12-19 15:30:21,492 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1488 transitions. Word has length 119 [2023-12-19 15:30:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:21,492 INFO L495 AbstractCegarLoop]: Abstraction has 1099 states and 1488 transitions. [2023-12-19 15:30:21,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1488 transitions. [2023-12-19 15:30:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 15:30:21,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:21,493 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:21,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-19 15:30:21,494 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:21,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1593531429, now seen corresponding path program 1 times [2023-12-19 15:30:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674644061] [2023-12-19 15:30:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:21,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:21,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:21,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674644061] [2023-12-19 15:30:21,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674644061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:21,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:21,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:30:21,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286753159] [2023-12-19 15:30:21,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:21,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:30:21,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:21,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:30:21,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:30:21,598 INFO L87 Difference]: Start difference. First operand 1099 states and 1488 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:21,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:21,722 INFO L93 Difference]: Finished difference Result 2321 states and 3150 transitions. [2023-12-19 15:30:21,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:30:21,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-12-19 15:30:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:21,725 INFO L225 Difference]: With dead ends: 2321 [2023-12-19 15:30:21,725 INFO L226 Difference]: Without dead ends: 1239 [2023-12-19 15:30:21,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:30:21,727 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 45 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:21,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 560 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:30:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2023-12-19 15:30:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1141. [2023-12-19 15:30:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 995 states have (on average 1.2884422110552765) internal successors, (1282), 1003 states have internal predecessors, (1282), 124 states have call successors, (124), 21 states have call predecessors, (124), 21 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-19 15:30:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1530 transitions. [2023-12-19 15:30:21,834 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1530 transitions. Word has length 119 [2023-12-19 15:30:21,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:21,834 INFO L495 AbstractCegarLoop]: Abstraction has 1141 states and 1530 transitions. [2023-12-19 15:30:21,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1530 transitions. [2023-12-19 15:30:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 15:30:21,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:21,835 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:21,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-19 15:30:21,835 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:21,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:21,835 INFO L85 PathProgramCache]: Analyzing trace with hash 512713366, now seen corresponding path program 1 times [2023-12-19 15:30:21,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:21,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516410866] [2023-12-19 15:30:21,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:21,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:21,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516410866] [2023-12-19 15:30:21,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516410866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:21,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:30:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584069081] [2023-12-19 15:30:21,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:21,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:30:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:21,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:30:21,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:30:21,987 INFO L87 Difference]: Start difference. First operand 1141 states and 1530 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:22,119 INFO L93 Difference]: Finished difference Result 2290 states and 3074 transitions. [2023-12-19 15:30:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:30:22,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2023-12-19 15:30:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:22,122 INFO L225 Difference]: With dead ends: 2290 [2023-12-19 15:30:22,122 INFO L226 Difference]: Without dead ends: 1166 [2023-12-19 15:30:22,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:30:22,123 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 75 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:22,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 572 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:30:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2023-12-19 15:30:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1101. [2023-12-19 15:30:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 955 states have (on average 1.27434554973822) internal successors, (1217), 963 states have internal predecessors, (1217), 124 states have call successors, (124), 21 states have call predecessors, (124), 21 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-19 15:30:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1465 transitions. [2023-12-19 15:30:22,229 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1465 transitions. Word has length 121 [2023-12-19 15:30:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:22,229 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1465 transitions. [2023-12-19 15:30:22,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:30:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1465 transitions. [2023-12-19 15:30:22,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:30:22,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:22,230 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:22,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-19 15:30:22,230 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:22,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:22,231 INFO L85 PathProgramCache]: Analyzing trace with hash 309462647, now seen corresponding path program 1 times [2023-12-19 15:30:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:22,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25455181] [2023-12-19 15:30:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:22,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:22,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:22,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25455181] [2023-12-19 15:30:22,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25455181] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:22,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:30:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303633924] [2023-12-19 15:30:22,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:22,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:30:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:30:22,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:30:22,986 INFO L87 Difference]: Start difference. First operand 1101 states and 1465 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:30:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:24,027 INFO L93 Difference]: Finished difference Result 2212 states and 2947 transitions. [2023-12-19 15:30:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-19 15:30:24,027 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-19 15:30:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:24,029 INFO L225 Difference]: With dead ends: 2212 [2023-12-19 15:30:24,030 INFO L226 Difference]: Without dead ends: 1463 [2023-12-19 15:30:24,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-12-19 15:30:24,031 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 342 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:24,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1391 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:30:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2023-12-19 15:30:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1299. [2023-12-19 15:30:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1136 states have (on average 1.2658450704225352) internal successors, (1438), 1147 states have internal predecessors, (1438), 136 states have call successors, (136), 26 states have call predecessors, (136), 26 states have return successors, (136), 125 states have call predecessors, (136), 136 states have call successors, (136) [2023-12-19 15:30:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1710 transitions. [2023-12-19 15:30:24,172 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1710 transitions. Word has length 123 [2023-12-19 15:30:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:24,173 INFO L495 AbstractCegarLoop]: Abstraction has 1299 states and 1710 transitions. [2023-12-19 15:30:24,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:30:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1710 transitions. [2023-12-19 15:30:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:30:24,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:24,173 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:24,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-19 15:30:24,174 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:24,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash -499883979, now seen corresponding path program 1 times [2023-12-19 15:30:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:24,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770445895] [2023-12-19 15:30:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:24,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:24,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770445895] [2023-12-19 15:30:24,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770445895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:24,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:24,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:30:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553100849] [2023-12-19 15:30:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:24,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:30:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:24,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:30:24,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:30:24,343 INFO L87 Difference]: Start difference. First operand 1299 states and 1710 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:30:24,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:24,617 INFO L93 Difference]: Finished difference Result 2347 states and 3098 transitions. [2023-12-19 15:30:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:30:24,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 123 [2023-12-19 15:30:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:24,620 INFO L225 Difference]: With dead ends: 2347 [2023-12-19 15:30:24,620 INFO L226 Difference]: Without dead ends: 1400 [2023-12-19 15:30:24,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:30:24,623 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 358 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:24,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 861 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:30:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2023-12-19 15:30:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1287. [2023-12-19 15:30:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1124 states have (on average 1.2624555160142348) internal successors, (1419), 1135 states have internal predecessors, (1419), 136 states have call successors, (136), 26 states have call predecessors, (136), 26 states have return successors, (136), 125 states have call predecessors, (136), 136 states have call successors, (136) [2023-12-19 15:30:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1691 transitions. [2023-12-19 15:30:24,760 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1691 transitions. Word has length 123 [2023-12-19 15:30:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:24,760 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1691 transitions. [2023-12-19 15:30:24,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:30:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1691 transitions. [2023-12-19 15:30:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:30:24,761 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:24,761 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:24,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-19 15:30:24,762 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:24,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash 584222261, now seen corresponding path program 1 times [2023-12-19 15:30:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410298705] [2023-12-19 15:30:24,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:24,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:24,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:24,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410298705] [2023-12-19 15:30:24,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410298705] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:24,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:24,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:30:24,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854490955] [2023-12-19 15:30:24,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:24,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:30:24,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:24,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:30:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:30:24,941 INFO L87 Difference]: Start difference. First operand 1287 states and 1691 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:30:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:25,164 INFO L93 Difference]: Finished difference Result 2295 states and 3015 transitions. [2023-12-19 15:30:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:30:25,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-19 15:30:25,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:25,167 INFO L225 Difference]: With dead ends: 2295 [2023-12-19 15:30:25,167 INFO L226 Difference]: Without dead ends: 1360 [2023-12-19 15:30:25,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:30:25,168 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 212 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:25,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 651 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:30:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2023-12-19 15:30:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1183. [2023-12-19 15:30:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1042 states have (on average 1.2562380038387715) internal successors, (1309), 1050 states have internal predecessors, (1309), 116 states have call successors, (116), 24 states have call predecessors, (116), 24 states have return successors, (116), 108 states have call predecessors, (116), 116 states have call successors, (116) [2023-12-19 15:30:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1541 transitions. [2023-12-19 15:30:25,278 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1541 transitions. Word has length 123 [2023-12-19 15:30:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:25,278 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1541 transitions. [2023-12-19 15:30:25,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:30:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1541 transitions. [2023-12-19 15:30:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:30:25,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:25,279 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:25,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-19 15:30:25,279 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:25,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash -225124365, now seen corresponding path program 1 times [2023-12-19 15:30:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20552077] [2023-12-19 15:30:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:30:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:30:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:30:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:30:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:30:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:30:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:30:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:30:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:30:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:30:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:30:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:30:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:30:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:30:25,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:30:25,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20552077] [2023-12-19 15:30:25,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20552077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:30:25,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:30:25,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:30:25,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143127748] [2023-12-19 15:30:25,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:30:25,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:30:25,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:30:25,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:30:25,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:30:25,956 INFO L87 Difference]: Start difference. First operand 1183 states and 1541 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:30:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:30:26,761 INFO L93 Difference]: Finished difference Result 2221 states and 2900 transitions. [2023-12-19 15:30:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 15:30:26,761 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-19 15:30:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:30:26,764 INFO L225 Difference]: With dead ends: 2221 [2023-12-19 15:30:26,764 INFO L226 Difference]: Without dead ends: 1394 [2023-12-19 15:30:26,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2023-12-19 15:30:26,765 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 270 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:30:26,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1453 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:30:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2023-12-19 15:30:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1167. [2023-12-19 15:30:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1026 states have (on average 1.256335282651072) internal successors, (1289), 1034 states have internal predecessors, (1289), 116 states have call successors, (116), 24 states have call predecessors, (116), 24 states have return successors, (116), 108 states have call predecessors, (116), 116 states have call successors, (116) [2023-12-19 15:30:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1521 transitions. [2023-12-19 15:30:26,906 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1521 transitions. Word has length 123 [2023-12-19 15:30:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:30:26,907 INFO L495 AbstractCegarLoop]: Abstraction has 1167 states and 1521 transitions. [2023-12-19 15:30:26,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:30:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1521 transitions. [2023-12-19 15:30:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:30:26,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:30:26,908 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:30:26,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-19 15:30:26,908 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:30:26,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:30:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash 754235108, now seen corresponding path program 1 times [2023-12-19 15:30:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:30:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788822419] [2023-12-19 15:30:26,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:30:26,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:30:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:30:26,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:30:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:30:27,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:30:27,058 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:30:27,060 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:30:27,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-19 15:30:27,065 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:30:27,068 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:30:27,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:30:27 BoogieIcfgContainer [2023-12-19 15:30:27,189 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:30:27,191 INFO L158 Benchmark]: Toolchain (without parser) took 34719.45ms. Allocated memory was 303.0MB in the beginning and 902.8MB in the end (delta: 599.8MB). Free memory was 252.0MB in the beginning and 691.4MB in the end (delta: -439.5MB). Peak memory consumption was 161.2MB. Max. memory is 8.0GB. [2023-12-19 15:30:27,194 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 219.2MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:30:27,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.86ms. Allocated memory is still 303.0MB. Free memory was 251.8MB in the beginning and 237.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 15:30:27,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.20ms. Allocated memory is still 303.0MB. Free memory was 237.8MB in the beginning and 234.4MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 15:30:27,196 INFO L158 Benchmark]: Boogie Preprocessor took 87.71ms. Allocated memory is still 303.0MB. Free memory was 234.4MB in the beginning and 229.5MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:30:27,196 INFO L158 Benchmark]: RCFGBuilder took 733.96ms. Allocated memory is still 303.0MB. Free memory was 229.2MB in the beginning and 244.8MB in the end (delta: -15.6MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. [2023-12-19 15:30:27,196 INFO L158 Benchmark]: TraceAbstraction took 33564.04ms. Allocated memory was 303.0MB in the beginning and 902.8MB in the end (delta: 599.8MB). Free memory was 244.3MB in the beginning and 691.4MB in the end (delta: -447.1MB). Peak memory consumption was 152.7MB. Max. memory is 8.0GB. [2023-12-19 15:30:27,197 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.10ms. Allocated memory is still 219.2MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.86ms. Allocated memory is still 303.0MB. Free memory was 251.8MB in the beginning and 237.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.20ms. Allocated memory is still 303.0MB. Free memory was 237.8MB in the beginning and 234.4MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 87.71ms. Allocated memory is still 303.0MB. Free memory was 234.4MB in the beginning and 229.5MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 733.96ms. Allocated memory is still 303.0MB. Free memory was 229.2MB in the beginning and 244.8MB in the end (delta: -15.6MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. * TraceAbstraction took 33564.04ms. Allocated memory was 303.0MB in the beginning and 902.8MB in the end (delta: 599.8MB). Free memory was 244.3MB in the beginning and 691.4MB in the end (delta: -447.1MB). Peak memory consumption was 152.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L22] signed char var_1_1 = -128; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 1; [L24] unsigned char var_1_2 = 1; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned char var_1_6 = 1; [L26] unsigned char var_1_6 = 1; [L27] unsigned char* var_1_6_Pointer = &(var_1_6); [L28] signed char var_1_7 = 8; [L28] signed char var_1_7 = 8; [L29] signed char* var_1_7_Pointer = &(var_1_7); [L30] unsigned long int var_1_8 = 1; [L30] unsigned long int var_1_8 = 1; [L31] unsigned long int* var_1_8_Pointer = &(var_1_8); [L32] unsigned long int var_1_9 = 1885310857; [L32] unsigned long int var_1_9 = 1885310857; [L33] unsigned long int* var_1_9_Pointer = &(var_1_9); [L34] signed long int var_1_10 = -10; [L34] signed long int var_1_10 = -10; [L35] signed long int* var_1_10_Pointer = &(var_1_10); [L36] double var_1_11 = 32.6; [L36] double var_1_11 = 32.6; [L37] double* var_1_11_Pointer = &(var_1_11); [L38] double var_1_12 = 9.75; [L38] double var_1_12 = 9.75; [L39] double* var_1_12_Pointer = &(var_1_12); [L40] double var_1_13 = 5.1; [L40] double var_1_13 = 5.1; [L41] double* var_1_13_Pointer = &(var_1_13); [L42] double var_1_14 = 128.1; [L42] double var_1_14 = 128.1; [L43] double* var_1_14_Pointer = &(var_1_14); [L44] double var_1_15 = 63.9; [L44] double var_1_15 = 63.9; [L45] double* var_1_15_Pointer = &(var_1_15); [L46] signed long int last_1_var_1_10 = -10; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] EXPR \read(var_1_10) [L100] last_1_var_1_10 = var_1_10 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L78] var_1_2 = __VERIFIER_nondet_uchar() [L79] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L81] var_1_6 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] var_1_7 = __VERIFIER_nondet_char() [L85] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] var_1_9 = __VERIFIER_nondet_ulong() [L88] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] CALL assume_abort_if_not(var_1_9 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] RET assume_abort_if_not(var_1_9 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] var_1_12 = __VERIFIER_nondet_double() [L91] EXPR \read(var_1_12) [L91] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L91] EXPR \read(var_1_12) [L91] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] var_1_13 = __VERIFIER_nondet_double() [L93] EXPR \read(var_1_13) [L93] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L93] EXPR \read(var_1_13) [L93] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] var_1_14 = __VERIFIER_nondet_double() [L95] EXPR \read(var_1_14) [L95] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F [L95] EXPR \read(var_1_14) [L95] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] var_1_15 = __VERIFIER_nondet_double() [L97] EXPR \read(var_1_15) [L97] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L97] EXPR \read(var_1_15) [L97] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] RET updateVariables() [L112] CALL step() [L50] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L50] COND FALSE !((*(var_1_2_Pointer))) [L53] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L53] EXPR ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))) [L53] EXPR ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L53] (*(var_1_8_Pointer)) = ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))) [L55] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L55] COND FALSE !((*(var_1_2_Pointer))) [L58] EXPR \read(*var_1_2_Pointer) [L58] unsigned char stepLocal_1 = (*(var_1_2_Pointer)); [L59] EXPR \read(*var_1_10_Pointer) [L59] signed long int stepLocal_0 = (*(var_1_10_Pointer)); [L60] stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_10_Pointer) [L60] stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] COND TRUE stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) [L61] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L61] COND FALSE !(stepLocal_0 < (*(var_1_8_Pointer))) [L66] (*(var_1_1_Pointer)) = 2 VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L71] EXPR \read(*var_1_1_Pointer) [L71] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L71] COND TRUE (*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)) [L72] EXPR \read(*var_1_12_Pointer) [L72] EXPR \read(*var_1_13_Pointer) [L72] EXPR \read(*var_1_14_Pointer) [L72] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L72] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) [L72] EXPR \read(*var_1_13_Pointer) [L72] EXPR \read(*var_1_14_Pointer) [L72] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L72] (*(var_1_11_Pointer)) = ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*var_1_2_Pointer) [L103] EXPR (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) [L103] EXPR \read(*var_1_10_Pointer) [L103] EXPR \read(*var_1_10_Pointer) [L103] EXPR (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) [L103] EXPR \read(*var_1_10_Pointer) [L103] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2)) [L103] EXPR \read(*var_1_1_Pointer) [L103] EXPR ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2)) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))) [L103] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))) [L103] EXPR \read(*var_1_8_Pointer) [L103] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))) [L103] EXPR ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1) [L103] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1 [L103] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1 VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))) [L103] EXPR \read(*var_1_1_Pointer) [L103] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer))))))) [L103] EXPR \read(*var_1_11_Pointer) [L103] EXPR \read(*var_1_12_Pointer) [L103] EXPR \read(*var_1_13_Pointer) [L103] EXPR \read(*var_1_14_Pointer) [L103] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) [L103] EXPR \read(*var_1_13_Pointer) [L103] EXPR \read(*var_1_14_Pointer) [L103] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103-L104] return (((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.4s, OverallIterations: 38, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10035 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10035 mSDsluCounter, 37069 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29539 mSDsCounter, 1126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7712 IncrementalHoareTripleChecker+Invalid, 8838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1126 mSolverCounterUnsat, 7530 mSDtfsCounter, 7712 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1386 GetRequests, 998 SyntacticMatches, 0 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1299occurred in iteration=34, InterpolantAutomatonStates: 327, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 5936 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 4405 NumberOfCodeBlocks, 4405 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4245 ConstructedInterpolants, 0 QuantifiedInterpolants, 26505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 9768/9768 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: unable to determine feasibility of some traces [2023-12-19 15:30:27,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...