/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-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:31:34,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:31:34,312 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:31:34,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:31:34,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:31:34,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:31:34,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:31:34,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:31:34,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:31:34,330 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:31:34,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:31:34,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:31:34,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:31:34,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:31:34,332 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:31:34,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:31:34,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:31:34,332 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:31:34,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:31:34,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:31:34,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:31:34,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:31:34,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:31:34,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:31:34,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:31:34,338 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:31:34,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:31:34,338 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:31:34,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:31:34,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:31:34,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:31:34,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:31:34,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:31:34,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:31:34,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:31:34,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:31:34,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:31:34,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:31:34,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:31:34,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:31:34,340 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:31:34,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:31:34,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:31:34,341 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:31:34,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:31:34,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:31:34,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:31:34,506 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:31:34,506 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:31:34,507 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-3.i [2023-12-19 15:31:35,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:31:35,588 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:31:35,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i [2023-12-19 15:31:35,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5913da9/b409ff466b644e3595d1b1f8f64d031b/FLAG6c5a72926 [2023-12-19 15:31:35,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5913da9/b409ff466b644e3595d1b1f8f64d031b [2023-12-19 15:31:35,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:31:35,616 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:31:35,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:31:35,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:31:35,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:31:35,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f00edcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35, skipping insertion in model container [2023-12-19 15:31:35,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,648 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:31:35,759 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i[915,928] [2023-12-19 15:31:35,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:31:35,815 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:31:35,823 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-3.i[915,928] [2023-12-19 15:31:35,848 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:31:35,859 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:31:35,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35 WrapperNode [2023-12-19 15:31:35,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:31:35,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:31:35,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:31:35,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:31:35,881 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:31:35" (1/1) ... [2023-12-19 15:31:35,891 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:31:35" (1/1) ... [2023-12-19 15:31:35,919 INFO L138 Inliner]: procedures = 29, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 665 [2023-12-19 15:31:35,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:31:35,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:31:35,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:31:35,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:31:35,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,956 INFO L175 MemorySlicer]: Split 151 memory accesses to 15 slices as follows [2, 5, 8, 10, 5, 10, 8, 12, 8, 8, 5, 14, 14, 12, 30]. 20 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1]. [2023-12-19 15:31:35,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:31:35,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:31:35,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:31:35,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:31:35,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35" (1/1) ... [2023-12-19 15:31:35,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:31:36,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:31:36,017 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:31:36,044 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:31:36,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:31:36,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:31:36,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2023-12-19 15:31:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-19 15:31:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-19 15:31:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-19 15:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-19 15:31:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:31:36,055 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 15:31:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 15:31:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-19 15:31:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-19 15:31:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-19 15:31:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-19 15:31:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-19 15:31:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-19 15:31:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-19 15:31:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-19 15:31:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-19 15:31:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-19 15:31:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:31:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:31:36,250 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:31:36,251 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:31:36,692 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:31:36,719 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:31:36,720 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:31:36,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:31:36 BoogieIcfgContainer [2023-12-19 15:31:36,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:31:36,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:31:36,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:31:36,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:31:36,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:31:35" (1/3) ... [2023-12-19 15:31:36,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9e2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:31:36, skipping insertion in model container [2023-12-19 15:31:36,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:31:35" (2/3) ... [2023-12-19 15:31:36,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9e2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:31:36, skipping insertion in model container [2023-12-19 15:31:36,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:31:36" (3/3) ... [2023-12-19 15:31:36,725 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-3.i [2023-12-19 15:31:36,738 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:31:36,739 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:31:36,786 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:31:36,791 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;@19538429, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:31:36,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:31:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 15:31:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 15:31:36,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:36,805 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:36,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:36,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash 941451293, now seen corresponding path program 1 times [2023-12-19 15:31:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:36,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412787696] [2023-12-19 15:31:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:37,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412787696] [2023-12-19 15:31:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412787696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:37,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:31:37,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273601275] [2023-12-19 15:31:37,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:37,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:31:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:37,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:31:37,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:31:37,187 INFO L87 Difference]: Start difference. First operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 15:31:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:37,245 INFO L93 Difference]: Finished difference Result 281 states and 444 transitions. [2023-12-19 15:31:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:31:37,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-12-19 15:31:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:37,252 INFO L225 Difference]: With dead ends: 281 [2023-12-19 15:31:37,252 INFO L226 Difference]: Without dead ends: 140 [2023-12-19 15:31:37,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:31:37,256 INFO L413 NwaCegarLoop]: 206 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, 206 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:31:37,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-19 15:31:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-12-19 15:31:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.459016393442623) internal successors, (178), 122 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 15:31:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 210 transitions. [2023-12-19 15:31:37,307 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 210 transitions. Word has length 128 [2023-12-19 15:31:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:37,307 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 210 transitions. [2023-12-19 15:31:37,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 15:31:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 210 transitions. [2023-12-19 15:31:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 15:31:37,310 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:37,310 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:37,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:31:37,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:37,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash 488259973, now seen corresponding path program 1 times [2023-12-19 15:31:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:37,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391955382] [2023-12-19 15:31:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:37,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:37,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391955382] [2023-12-19 15:31:37,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391955382] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:37,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:37,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:31:37,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415596514] [2023-12-19 15:31:37,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:37,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:31:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:37,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:31:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:31:37,564 INFO L87 Difference]: Start difference. First operand 140 states and 210 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 15:31:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:37,629 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2023-12-19 15:31:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:31:37,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-12-19 15:31:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:37,630 INFO L225 Difference]: With dead ends: 285 [2023-12-19 15:31:37,630 INFO L226 Difference]: Without dead ends: 146 [2023-12-19 15:31:37,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:31:37,632 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 10 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:37,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 610 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-19 15:31:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-12-19 15:31:37,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 124 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 15:31:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2023-12-19 15:31:37,641 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 128 [2023-12-19 15:31:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:37,641 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2023-12-19 15:31:37,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 15:31:37,641 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2023-12-19 15:31:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 15:31:37,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:37,643 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:37,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:31:37,643 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:37,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:37,644 INFO L85 PathProgramCache]: Analyzing trace with hash 882626759, now seen corresponding path program 1 times [2023-12-19 15:31:37,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:37,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331020208] [2023-12-19 15:31:37,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:37,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:37,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:37,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331020208] [2023-12-19 15:31:37,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331020208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:37,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:37,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:31:37,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051289425] [2023-12-19 15:31:37,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:37,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:31:37,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:37,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:31:37,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:31:37,868 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:37,912 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2023-12-19 15:31:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:31:37,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-12-19 15:31:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:37,916 INFO L225 Difference]: With dead ends: 321 [2023-12-19 15:31:37,916 INFO L226 Difference]: Without dead ends: 180 [2023-12-19 15:31:37,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:31:37,920 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 67 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:37,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 696 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-19 15:31:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2023-12-19 15:31:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 15:31:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2023-12-19 15:31:37,939 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 128 [2023-12-19 15:31:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:37,939 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2023-12-19 15:31:37,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2023-12-19 15:31:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-19 15:31:37,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:37,941 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:37,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:31:37,941 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:37,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1535191051, now seen corresponding path program 1 times [2023-12-19 15:31:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:37,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379111743] [2023-12-19 15:31:37,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:37,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:38,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:38,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379111743] [2023-12-19 15:31:38,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379111743] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:38,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:38,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:31:38,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499445772] [2023-12-19 15:31:38,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:38,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:31:38,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:38,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:31:38,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:31:38,089 INFO L87 Difference]: Start difference. First operand 144 states and 214 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:38,116 INFO L93 Difference]: Finished difference Result 363 states and 541 transitions. [2023-12-19 15:31:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:31:38,117 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-12-19 15:31:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:38,119 INFO L225 Difference]: With dead ends: 363 [2023-12-19 15:31:38,119 INFO L226 Difference]: Without dead ends: 220 [2023-12-19 15:31:38,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:31:38,123 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 111 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:38,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 399 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-19 15:31:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 176. [2023-12-19 15:31:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 158 states have internal predecessors, (231), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 15:31:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 263 transitions. [2023-12-19 15:31:38,129 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 263 transitions. Word has length 130 [2023-12-19 15:31:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:38,130 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 263 transitions. [2023-12-19 15:31:38,130 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 263 transitions. [2023-12-19 15:31:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-19 15:31:38,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:38,131 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:38,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:31:38,131 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:38,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash -187713908, now seen corresponding path program 1 times [2023-12-19 15:31:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:38,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720111809] [2023-12-19 15:31:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:38,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:38,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720111809] [2023-12-19 15:31:38,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720111809] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:38,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:38,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:31:38,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579655438] [2023-12-19 15:31:38,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:38,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:31:38,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:38,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:31:38,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:31:38,385 INFO L87 Difference]: Start difference. First operand 176 states and 263 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:38,446 INFO L93 Difference]: Finished difference Result 526 states and 787 transitions. [2023-12-19 15:31:38,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:31:38,447 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-12-19 15:31:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:38,450 INFO L225 Difference]: With dead ends: 526 [2023-12-19 15:31:38,450 INFO L226 Difference]: Without dead ends: 351 [2023-12-19 15:31:38,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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:31:38,451 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 348 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:38,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 801 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-12-19 15:31:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 343. [2023-12-19 15:31:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 308 states have (on average 1.4545454545454546) internal successors, (448), 308 states have internal predecessors, (448), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:31:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 512 transitions. [2023-12-19 15:31:38,466 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 512 transitions. Word has length 130 [2023-12-19 15:31:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:38,467 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 512 transitions. [2023-12-19 15:31:38,468 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 512 transitions. [2023-12-19 15:31:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-19 15:31:38,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:38,470 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:38,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:31:38,470 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:38,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash -239013210, now seen corresponding path program 1 times [2023-12-19 15:31:38,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:38,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157497663] [2023-12-19 15:31:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:38,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:38,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157497663] [2023-12-19 15:31:38,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157497663] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:38,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:38,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:31:38,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767242430] [2023-12-19 15:31:38,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:38,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:31:38,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:38,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:31:38,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:31:38,769 INFO L87 Difference]: Start difference. First operand 343 states and 512 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:38,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:38,885 INFO L93 Difference]: Finished difference Result 658 states and 981 transitions. [2023-12-19 15:31:38,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:31:38,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-12-19 15:31:38,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:38,887 INFO L225 Difference]: With dead ends: 658 [2023-12-19 15:31:38,887 INFO L226 Difference]: Without dead ends: 483 [2023-12-19 15:31:38,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 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:31:38,889 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 247 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:38,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1287 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:31:38,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-12-19 15:31:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 450. [2023-12-19 15:31:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 411 states have internal predecessors, (598), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:31:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 670 transitions. [2023-12-19 15:31:38,917 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 670 transitions. Word has length 131 [2023-12-19 15:31:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:38,917 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 670 transitions. [2023-12-19 15:31:38,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 670 transitions. [2023-12-19 15:31:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-19 15:31:38,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:38,918 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:38,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:31:38,919 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:38,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:38,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2080596326, now seen corresponding path program 1 times [2023-12-19 15:31:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143081955] [2023-12-19 15:31:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:38,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:39,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:39,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143081955] [2023-12-19 15:31:39,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143081955] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:39,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:39,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:31:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405795293] [2023-12-19 15:31:39,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:39,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:31:39,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:39,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:31:39,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:31:39,225 INFO L87 Difference]: Start difference. First operand 450 states and 670 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:39,342 INFO L93 Difference]: Finished difference Result 939 states and 1399 transitions. [2023-12-19 15:31:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:31:39,342 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-12-19 15:31:39,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:39,346 INFO L225 Difference]: With dead ends: 939 [2023-12-19 15:31:39,346 INFO L226 Difference]: Without dead ends: 490 [2023-12-19 15:31:39,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:31:39,348 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 390 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:39,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1046 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:31:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2023-12-19 15:31:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 450. [2023-12-19 15:31:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 410 states have (on average 1.4560975609756097) internal successors, (597), 411 states have internal predecessors, (597), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:31:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 669 transitions. [2023-12-19 15:31:39,362 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 669 transitions. Word has length 132 [2023-12-19 15:31:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:39,362 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 669 transitions. [2023-12-19 15:31:39,362 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 669 transitions. [2023-12-19 15:31:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-19 15:31:39,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:39,364 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:39,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:31:39,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:39,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:39,364 INFO L85 PathProgramCache]: Analyzing trace with hash 250262094, now seen corresponding path program 1 times [2023-12-19 15:31:39,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:39,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820990269] [2023-12-19 15:31:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:39,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:39,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820990269] [2023-12-19 15:31:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820990269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:39,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:39,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:31:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886312810] [2023-12-19 15:31:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:39,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:31:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:39,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:31:39,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:31:39,499 INFO L87 Difference]: Start difference. First operand 450 states and 669 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:39,553 INFO L93 Difference]: Finished difference Result 1130 states and 1683 transitions. [2023-12-19 15:31:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:31:39,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-12-19 15:31:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:39,556 INFO L225 Difference]: With dead ends: 1130 [2023-12-19 15:31:39,556 INFO L226 Difference]: Without dead ends: 681 [2023-12-19 15:31:39,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:31:39,557 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 124 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:39,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 900 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-12-19 15:31:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 453. [2023-12-19 15:31:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 413 states have (on average 1.4527845036319613) internal successors, (600), 414 states have internal predecessors, (600), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:31:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 672 transitions. [2023-12-19 15:31:39,577 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 672 transitions. Word has length 132 [2023-12-19 15:31:39,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:39,578 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 672 transitions. [2023-12-19 15:31:39,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 672 transitions. [2023-12-19 15:31:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-19 15:31:39,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:39,579 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:39,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:31:39,579 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:39,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1364529179, now seen corresponding path program 1 times [2023-12-19 15:31:39,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:39,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044254758] [2023-12-19 15:31:39,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:39,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:39,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044254758] [2023-12-19 15:31:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044254758] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:39,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:39,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:31:39,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261928468] [2023-12-19 15:31:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:39,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:31:39,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:39,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:31:39,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:31:39,723 INFO L87 Difference]: Start difference. First operand 453 states and 672 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:39,775 INFO L93 Difference]: Finished difference Result 980 states and 1457 transitions. [2023-12-19 15:31:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:31:39,776 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-12-19 15:31:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:39,778 INFO L225 Difference]: With dead ends: 980 [2023-12-19 15:31:39,778 INFO L226 Difference]: Without dead ends: 528 [2023-12-19 15:31:39,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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:31:39,780 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 144 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 765 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:31:39,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 765 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-19 15:31:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 462. [2023-12-19 15:31:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 422 states have (on average 1.4431279620853081) internal successors, (609), 423 states have internal predecessors, (609), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:31:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 681 transitions. [2023-12-19 15:31:39,795 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 681 transitions. Word has length 133 [2023-12-19 15:31:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:39,795 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 681 transitions. [2023-12-19 15:31:39,795 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 681 transitions. [2023-12-19 15:31:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-19 15:31:39,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:39,796 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:39,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 15:31:39,797 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:39,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash -398224276, now seen corresponding path program 1 times [2023-12-19 15:31:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:39,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413735158] [2023-12-19 15:31:39,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:40,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:40,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413735158] [2023-12-19 15:31:40,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413735158] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:40,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:40,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:31:40,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357560079] [2023-12-19 15:31:40,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:40,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:31:40,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:40,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:31:40,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:31:40,220 INFO L87 Difference]: Start difference. First operand 462 states and 681 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:40,410 INFO L93 Difference]: Finished difference Result 853 states and 1258 transitions. [2023-12-19 15:31:40,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:31:40,411 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-12-19 15:31:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:40,413 INFO L225 Difference]: With dead ends: 853 [2023-12-19 15:31:40,413 INFO L226 Difference]: Without dead ends: 563 [2023-12-19 15:31:40,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:31:40,414 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 494 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:40,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1039 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:31:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2023-12-19 15:31:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 522. [2023-12-19 15:31:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 469 states have (on average 1.4307036247334755) internal successors, (671), 469 states have internal predecessors, (671), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 15:31:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 767 transitions. [2023-12-19 15:31:40,430 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 767 transitions. Word has length 133 [2023-12-19 15:31:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:40,431 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 767 transitions. [2023-12-19 15:31:40,431 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 767 transitions. [2023-12-19 15:31:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-19 15:31:40,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:40,432 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:40,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 15:31:40,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:40,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash 26607360, now seen corresponding path program 1 times [2023-12-19 15:31:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:40,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6117255] [2023-12-19 15:31:40,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:40,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:40,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6117255] [2023-12-19 15:31:40,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6117255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:40,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:40,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:31:40,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185912712] [2023-12-19 15:31:40,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:40,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:31:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:40,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:31:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:31:40,747 INFO L87 Difference]: Start difference. First operand 522 states and 767 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:40,899 INFO L93 Difference]: Finished difference Result 954 states and 1402 transitions. [2023-12-19 15:31:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:31:40,899 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-12-19 15:31:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:40,928 INFO L225 Difference]: With dead ends: 954 [2023-12-19 15:31:40,928 INFO L226 Difference]: Without dead ends: 604 [2023-12-19 15:31:40,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:31:40,929 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 574 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:40,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 978 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:31:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2023-12-19 15:31:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 355. [2023-12-19 15:31:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 319 states have (on average 1.4231974921630095) internal successors, (454), 319 states have internal predecessors, (454), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:31:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 518 transitions. [2023-12-19 15:31:40,943 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 518 transitions. Word has length 133 [2023-12-19 15:31:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:40,944 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 518 transitions. [2023-12-19 15:31:40,944 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 518 transitions. [2023-12-19 15:31:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-19 15:31:40,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:40,945 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:40,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 15:31:40,945 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:40,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:40,946 INFO L85 PathProgramCache]: Analyzing trace with hash -341486804, now seen corresponding path program 1 times [2023-12-19 15:31:40,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:40,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902233222] [2023-12-19 15:31:40,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:40,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:41,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:41,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902233222] [2023-12-19 15:31:41,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902233222] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:41,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:41,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:31:41,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999797904] [2023-12-19 15:31:41,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:41,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:31:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:41,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:31:41,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:31:41,353 INFO L87 Difference]: Start difference. First operand 355 states and 518 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:41,596 INFO L93 Difference]: Finished difference Result 894 states and 1303 transitions. [2023-12-19 15:31:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:31:41,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-19 15:31:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:41,598 INFO L225 Difference]: With dead ends: 894 [2023-12-19 15:31:41,598 INFO L226 Difference]: Without dead ends: 540 [2023-12-19 15:31:41,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:31:41,600 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 403 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:41,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 2632 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:31:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2023-12-19 15:31:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 469. [2023-12-19 15:31:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 428 states have (on average 1.425233644859813) internal successors, (610), 429 states have internal predecessors, (610), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:31:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 682 transitions. [2023-12-19 15:31:41,614 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 682 transitions. Word has length 134 [2023-12-19 15:31:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:41,614 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 682 transitions. [2023-12-19 15:31:41,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 682 transitions. [2023-12-19 15:31:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-19 15:31:41,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:41,616 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:41,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 15:31:41,616 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:41,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:41,616 INFO L85 PathProgramCache]: Analyzing trace with hash -734513814, now seen corresponding path program 1 times [2023-12-19 15:31:41,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:41,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171078373] [2023-12-19 15:31:41,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:41,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:41,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:41,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171078373] [2023-12-19 15:31:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171078373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:41,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:41,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:31:41,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145637684] [2023-12-19 15:31:41,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:41,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:31:41,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:41,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:31:41,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:31:41,730 INFO L87 Difference]: Start difference. First operand 469 states and 682 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:41,811 INFO L93 Difference]: Finished difference Result 1028 states and 1493 transitions. [2023-12-19 15:31:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:31:41,811 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-19 15:31:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:41,813 INFO L225 Difference]: With dead ends: 1028 [2023-12-19 15:31:41,813 INFO L226 Difference]: Without dead ends: 560 [2023-12-19 15:31:41,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:31:41,814 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 200 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:41,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1250 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:41,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2023-12-19 15:31:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 487. [2023-12-19 15:31:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 437 states have (on average 1.414187643020595) internal successors, (618), 439 states have internal predecessors, (618), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-19 15:31:41,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 706 transitions. [2023-12-19 15:31:41,831 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 706 transitions. Word has length 134 [2023-12-19 15:31:41,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:41,831 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 706 transitions. [2023-12-19 15:31:41,831 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 706 transitions. [2023-12-19 15:31:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-19 15:31:41,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:41,833 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:41,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 15:31:41,833 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:41,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:41,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2030430546, now seen corresponding path program 1 times [2023-12-19 15:31:41,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:41,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152176643] [2023-12-19 15:31:41,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:41,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:41,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152176643] [2023-12-19 15:31:41,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152176643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:41,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:41,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:31:41,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91548461] [2023-12-19 15:31:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:41,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:31:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:41,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:31:41,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:31:41,964 INFO L87 Difference]: Start difference. First operand 487 states and 706 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:42,041 INFO L93 Difference]: Finished difference Result 1007 states and 1456 transitions. [2023-12-19 15:31:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:31:42,041 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-19 15:31:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:42,043 INFO L225 Difference]: With dead ends: 1007 [2023-12-19 15:31:42,043 INFO L226 Difference]: Without dead ends: 529 [2023-12-19 15:31:42,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:31:42,044 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 225 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:42,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1131 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-12-19 15:31:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 471. [2023-12-19 15:31:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 429 states have (on average 1.4195804195804196) internal successors, (609), 430 states have internal predecessors, (609), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:31:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 681 transitions. [2023-12-19 15:31:42,063 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 681 transitions. Word has length 134 [2023-12-19 15:31:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:42,063 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 681 transitions. [2023-12-19 15:31:42,063 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 681 transitions. [2023-12-19 15:31:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-19 15:31:42,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:42,064 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:42,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 15:31:42,065 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:42,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1871509740, now seen corresponding path program 1 times [2023-12-19 15:31:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:42,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062163018] [2023-12-19 15:31:42,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:42,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:42,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062163018] [2023-12-19 15:31:42,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062163018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:42,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:42,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:31:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4131951] [2023-12-19 15:31:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:42,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:31:42,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:42,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:31:42,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:31:42,406 INFO L87 Difference]: Start difference. First operand 471 states and 681 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:42,620 INFO L93 Difference]: Finished difference Result 991 states and 1430 transitions. [2023-12-19 15:31:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:31:42,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-19 15:31:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:42,622 INFO L225 Difference]: With dead ends: 991 [2023-12-19 15:31:42,622 INFO L226 Difference]: Without dead ends: 521 [2023-12-19 15:31:42,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-12-19 15:31:42,624 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 331 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:42,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 2690 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:31:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2023-12-19 15:31:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 432. [2023-12-19 15:31:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 390 states have (on average 1.4153846153846155) internal successors, (552), 391 states have internal predecessors, (552), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:31:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 624 transitions. [2023-12-19 15:31:42,637 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 624 transitions. Word has length 134 [2023-12-19 15:31:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:42,637 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 624 transitions. [2023-12-19 15:31:42,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 624 transitions. [2023-12-19 15:31:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-19 15:31:42,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:42,638 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:42,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 15:31:42,639 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:42,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:42,639 INFO L85 PathProgramCache]: Analyzing trace with hash -675021143, now seen corresponding path program 1 times [2023-12-19 15:31:42,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:42,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780453470] [2023-12-19 15:31:42,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:42,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:42,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:42,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780453470] [2023-12-19 15:31:42,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780453470] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:42,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:42,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:31:42,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740900492] [2023-12-19 15:31:42,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:42,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:31:42,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:42,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:31:42,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:31:42,719 INFO L87 Difference]: Start difference. First operand 432 states and 624 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:42,744 INFO L93 Difference]: Finished difference Result 924 states and 1327 transitions. [2023-12-19 15:31:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:31:42,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-19 15:31:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:42,746 INFO L225 Difference]: With dead ends: 924 [2023-12-19 15:31:42,746 INFO L226 Difference]: Without dead ends: 501 [2023-12-19 15:31:42,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:31:42,747 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 102 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:42,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 489 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-12-19 15:31:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 409. [2023-12-19 15:31:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 367 states have (on average 1.3923705722070845) internal successors, (511), 368 states have internal predecessors, (511), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:31:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 583 transitions. [2023-12-19 15:31:42,762 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 583 transitions. Word has length 134 [2023-12-19 15:31:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:42,762 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 583 transitions. [2023-12-19 15:31:42,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 583 transitions. [2023-12-19 15:31:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-19 15:31:42,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:42,763 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:42,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 15:31:42,763 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:42,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1387420490, now seen corresponding path program 1 times [2023-12-19 15:31:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:42,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539699582] [2023-12-19 15:31:42,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:42,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:43,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:43,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539699582] [2023-12-19 15:31:43,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539699582] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:43,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:43,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:31:43,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741672048] [2023-12-19 15:31:43,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:43,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:31:43,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:43,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:31:43,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:31:43,261 INFO L87 Difference]: Start difference. First operand 409 states and 583 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:43,611 INFO L93 Difference]: Finished difference Result 1217 states and 1744 transitions. [2023-12-19 15:31:43,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-19 15:31:43,613 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-12-19 15:31:43,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:43,615 INFO L225 Difference]: With dead ends: 1217 [2023-12-19 15:31:43,615 INFO L226 Difference]: Without dead ends: 817 [2023-12-19 15:31:43,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2023-12-19 15:31:43,616 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 770 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:43,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1613 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:31:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2023-12-19 15:31:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 673. [2023-12-19 15:31:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 624 states have (on average 1.4070512820512822) internal successors, (878), 627 states have internal predecessors, (878), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:31:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 958 transitions. [2023-12-19 15:31:43,636 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 958 transitions. Word has length 135 [2023-12-19 15:31:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:43,636 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 958 transitions. [2023-12-19 15:31:43,636 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 958 transitions. [2023-12-19 15:31:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-19 15:31:43,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:43,638 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:43,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 15:31:43,638 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:43,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:43,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1083401524, now seen corresponding path program 1 times [2023-12-19 15:31:43,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:43,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454054061] [2023-12-19 15:31:43,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:43,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:43,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454054061] [2023-12-19 15:31:43,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454054061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:43,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:43,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:31:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445235978] [2023-12-19 15:31:43,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:43,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:31:43,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:43,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:31:43,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:31:43,771 INFO L87 Difference]: Start difference. First operand 673 states and 958 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:43,848 INFO L93 Difference]: Finished difference Result 1637 states and 2341 transitions. [2023-12-19 15:31:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:31:43,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-12-19 15:31:43,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:43,853 INFO L225 Difference]: With dead ends: 1637 [2023-12-19 15:31:43,853 INFO L226 Difference]: Without dead ends: 977 [2023-12-19 15:31:43,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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:31:43,855 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 198 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:43,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 823 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2023-12-19 15:31:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 843. [2023-12-19 15:31:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 794 states have (on average 1.4105793450881612) internal successors, (1120), 797 states have internal predecessors, (1120), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:31:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1200 transitions. [2023-12-19 15:31:43,879 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1200 transitions. Word has length 135 [2023-12-19 15:31:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:43,880 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1200 transitions. [2023-12-19 15:31:43,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1200 transitions. [2023-12-19 15:31:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-19 15:31:43,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:43,881 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:43,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 15:31:43,881 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:43,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash -7179097, now seen corresponding path program 1 times [2023-12-19 15:31:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:43,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648648112] [2023-12-19 15:31:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:43,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-19 15:31:44,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:44,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648648112] [2023-12-19 15:31:44,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648648112] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:31:44,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304079374] [2023-12-19 15:31:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:44,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:31:44,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:31:44,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:31:44,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 15:31:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:44,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-19 15:31:44,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:31:44,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 15:31:45,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 68 [2023-12-19 15:31:45,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2023-12-19 15:31:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-19 15:31:45,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:31:45,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2023-12-19 15:31:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-19 15:31:45,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304079374] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:31:45,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 15:31:45,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 16] total 33 [2023-12-19 15:31:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097567475] [2023-12-19 15:31:45,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 15:31:45,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-19 15:31:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:45,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-19 15:31:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2023-12-19 15:31:45,923 INFO L87 Difference]: Start difference. First operand 843 states and 1200 transitions. Second operand has 33 states, 30 states have (on average 5.766666666666667) internal successors, (173), 32 states have internal predecessors, (173), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) [2023-12-19 15:31:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:48,038 INFO L93 Difference]: Finished difference Result 2098 states and 2946 transitions. [2023-12-19 15:31:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-12-19 15:31:48,039 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.766666666666667) internal successors, (173), 32 states have internal predecessors, (173), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) Word has length 137 [2023-12-19 15:31:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:48,042 INFO L225 Difference]: With dead ends: 2098 [2023-12-19 15:31:48,042 INFO L226 Difference]: Without dead ends: 1268 [2023-12-19 15:31:48,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1605, Invalid=7707, Unknown=0, NotChecked=0, Total=9312 [2023-12-19 15:31:48,045 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 2992 mSDsluCounter, 4894 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 5199 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:48,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2993 Valid, 5199 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 15:31:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2023-12-19 15:31:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 943. [2023-12-19 15:31:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 883 states have (on average 1.3975084937712345) internal successors, (1234), 883 states have internal predecessors, (1234), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 15:31:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1330 transitions. [2023-12-19 15:31:48,078 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1330 transitions. Word has length 137 [2023-12-19 15:31:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:48,078 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1330 transitions. [2023-12-19 15:31:48,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.766666666666667) internal successors, (173), 32 states have internal predecessors, (173), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) [2023-12-19 15:31:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1330 transitions. [2023-12-19 15:31:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-19 15:31:48,079 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:48,079 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 15:31:48,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:31:48,288 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:48,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash 172240624, now seen corresponding path program 1 times [2023-12-19 15:31:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:48,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24926756] [2023-12-19 15:31:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:48,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:48,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:48,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24926756] [2023-12-19 15:31:48,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24926756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:48,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:48,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:31:48,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531897942] [2023-12-19 15:31:48,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:48,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:31:48,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:48,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:31:48,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:31:48,420 INFO L87 Difference]: Start difference. First operand 943 states and 1330 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:48,519 INFO L93 Difference]: Finished difference Result 1871 states and 2635 transitions. [2023-12-19 15:31:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:31:48,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-12-19 15:31:48,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:48,523 INFO L225 Difference]: With dead ends: 1871 [2023-12-19 15:31:48,523 INFO L226 Difference]: Without dead ends: 1168 [2023-12-19 15:31:48,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:31:48,524 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 247 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:48,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 963 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:31:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2023-12-19 15:31:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1003. [2023-12-19 15:31:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 932 states have (on average 1.3927038626609443) internal successors, (1298), 933 states have internal predecessors, (1298), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-19 15:31:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1410 transitions. [2023-12-19 15:31:48,554 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1410 transitions. Word has length 137 [2023-12-19 15:31:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:48,554 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1410 transitions. [2023-12-19 15:31:48,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1410 transitions. [2023-12-19 15:31:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 15:31:48,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:48,555 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 15:31:48,555 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:48,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:48,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1700942396, now seen corresponding path program 1 times [2023-12-19 15:31:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:48,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208683473] [2023-12-19 15:31:48,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:48,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:31:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:31:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:31:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:31:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:31:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:31:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:31:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:31:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:31:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:31:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:31:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:31:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:31:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:31:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-19 15:31:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:31:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:31:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 15:31:48,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:31:48,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208683473] [2023-12-19 15:31:48,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208683473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:31:48,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:31:48,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:31:48,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639430152] [2023-12-19 15:31:48,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:31:48,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:31:48,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:31:48,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:31:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:31:48,718 INFO L87 Difference]: Start difference. First operand 1003 states and 1410 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:31:48,802 INFO L93 Difference]: Finished difference Result 2082 states and 2920 transitions. [2023-12-19 15:31:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:31:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-12-19 15:31:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:31:48,806 INFO L225 Difference]: With dead ends: 2082 [2023-12-19 15:31:48,806 INFO L226 Difference]: Without dead ends: 1080 [2023-12-19 15:31:48,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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:31:48,808 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 133 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:31:48,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 740 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:31:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2023-12-19 15:31:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 990. [2023-12-19 15:31:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 919 states have (on average 1.3895538628944506) internal successors, (1277), 920 states have internal predecessors, (1277), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-19 15:31:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1389 transitions. [2023-12-19 15:31:48,843 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1389 transitions. Word has length 138 [2023-12-19 15:31:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:31:48,844 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1389 transitions. [2023-12-19 15:31:48,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 15:31:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1389 transitions. [2023-12-19 15:31:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 15:31:48,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:31:48,845 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 15:31:48,845 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:31:48,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:31:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2004961362, now seen corresponding path program 1 times [2023-12-19 15:31:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:31:48,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042585084] [2023-12-19 15:31:48,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:31:48,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:31:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:31:48,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:31:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:31:48,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:31:48,987 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:31:48,988 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:31:48,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 15:31:48,992 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] [2023-12-19 15:31:48,994 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:31:49,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:31:49 BoogieIcfgContainer [2023-12-19 15:31:49,133 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:31:49,134 INFO L158 Benchmark]: Toolchain (without parser) took 13517.29ms. Allocated memory was 190.8MB in the beginning and 545.3MB in the end (delta: 354.4MB). Free memory was 153.2MB in the beginning and 323.0MB in the end (delta: -169.8MB). Peak memory consumption was 185.3MB. Max. memory is 8.0GB. [2023-12-19 15:31:49,134 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 190.8MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:31:49,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.78ms. Allocated memory is still 190.8MB. Free memory was 153.2MB in the beginning and 138.2MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 15:31:49,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.49ms. Allocated memory is still 190.8MB. Free memory was 138.2MB in the beginning and 134.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 15:31:49,138 INFO L158 Benchmark]: Boogie Preprocessor took 72.05ms. Allocated memory is still 190.8MB. Free memory was 134.3MB in the beginning and 128.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-19 15:31:49,138 INFO L158 Benchmark]: RCFGBuilder took 727.26ms. Allocated memory is still 190.8MB. Free memory was 128.0MB in the beginning and 147.4MB in the end (delta: -19.3MB). Peak memory consumption was 40.1MB. Max. memory is 8.0GB. [2023-12-19 15:31:49,138 INFO L158 Benchmark]: TraceAbstraction took 12411.98ms. Allocated memory was 190.8MB in the beginning and 545.3MB in the end (delta: 354.4MB). Free memory was 146.8MB in the beginning and 323.0MB in the end (delta: -176.2MB). Peak memory consumption was 177.7MB. Max. memory is 8.0GB. [2023-12-19 15:31:49,141 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.45ms. Allocated memory is still 190.8MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.78ms. Allocated memory is still 190.8MB. Free memory was 153.2MB in the beginning and 138.2MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.49ms. Allocated memory is still 190.8MB. Free memory was 138.2MB in the beginning and 134.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.05ms. Allocated memory is still 190.8MB. Free memory was 134.3MB in the beginning and 128.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 727.26ms. Allocated memory is still 190.8MB. Free memory was 128.0MB in the beginning and 147.4MB in the end (delta: -19.3MB). Peak memory consumption was 40.1MB. Max. memory is 8.0GB. * TraceAbstraction took 12411.98ms. Allocated memory was 190.8MB in the beginning and 545.3MB in the end (delta: 354.4MB). Free memory was 146.8MB in the beginning and 323.0MB in the end (delta: -176.2MB). Peak memory consumption was 177.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 112, overapproximation of someUnaryDOUBLEoperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned char var_1_5 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] signed long int var_1_6 = -64; [L28] signed long int var_1_6 = -64; [L29] signed long int* var_1_6_Pointer = &(var_1_6); [L30] signed long int var_1_7 = -5; [L30] signed long int var_1_7 = -5; [L31] signed long int* var_1_7_Pointer = &(var_1_7); [L32] signed long int var_1_8 = 500; [L32] signed long int var_1_8 = 500; [L33] signed long int* var_1_8_Pointer = &(var_1_8); [L34] signed long int var_1_9 = -5; [L34] signed long int var_1_9 = -5; [L35] signed long int* var_1_9_Pointer = &(var_1_9); [L36] signed long int var_1_10 = -100; [L36] signed long int var_1_10 = -100; [L37] signed long int* var_1_10_Pointer = &(var_1_10); [L38] unsigned char var_1_11 = 1; [L38] unsigned char var_1_11 = 1; [L39] unsigned char* var_1_11_Pointer = &(var_1_11); [L40] double var_1_12 = 127.5; [L40] double var_1_12 = 127.5; [L41] double* var_1_12_Pointer = &(var_1_12); [L42] double var_1_13 = 15.75; [L42] double var_1_13 = 15.75; [L43] double* var_1_13_Pointer = &(var_1_13); [L44] double var_1_14 = -0.5; [L44] double var_1_14 = -0.5; [L45] double* var_1_14_Pointer = &(var_1_14); [L46] double var_1_15 = 5.25; [L46] double var_1_15 = 5.25; [L47] double* var_1_15_Pointer = &(var_1_15); [L48] double var_1_16 = 8.5; [L48] double var_1_16 = 8.5; [L49] double* var_1_16_Pointer = &(var_1_16); [L50] unsigned char last_1_var_1_11 = 1; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] EXPR \read(var_1_11) [L109] last_1_var_1_11 = var_1_11 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] var_1_7 = __VERIFIER_nondet_long() [L88] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] var_1_8 = __VERIFIER_nondet_long() [L91] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] var_1_9 = __VERIFIER_nondet_long() [L94] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] var_1_10 = __VERIFIER_nondet_long() [L97] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] var_1_13 = __VERIFIER_nondet_double() [L100] EXPR \read(var_1_13) [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F [L100] EXPR \read(var_1_13) [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR (var_1_13 >= -461168.6018427382800e+13F && 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_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR (var_1_13 >= -461168.6018427382800e+13F && 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_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && 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_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && 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_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] var_1_14 = __VERIFIER_nondet_double() [L102] EXPR \read(var_1_14) [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F [L102] EXPR \read(var_1_14) [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR (var_1_14 >= -461168.6018427382800e+13F && 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_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR (var_1_14 >= -461168.6018427382800e+13F && 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_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && 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_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && 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_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] var_1_15 = __VERIFIER_nondet_double() [L104] EXPR \read(var_1_15) [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F [L104] EXPR \read(var_1_15) [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] var_1_16 = __VERIFIER_nondet_double() [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] RET updateVariables() [L121] CALL step() [L54] unsigned char stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] COND FALSE !(! last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L60] EXPR \read(*var_1_7_Pointer) [L60] signed long int stepLocal_2 = (*(var_1_7_Pointer)); [L61] EXPR \read(*var_1_10_Pointer) [L61] signed long int stepLocal_1 = (*(var_1_10_Pointer)); [L62] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND FALSE !((*(var_1_8_Pointer)) <= stepLocal_2) [L69] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L69] COND FALSE !(! (*(var_1_11_Pointer))) [L72] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) [L72] EXPR \read(*var_1_9_Pointer) [L72] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=18, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR \read(*var_1_10_Pointer) [L72] EXPR \read(*var_1_7_Pointer) [L72] (*(var_1_6_Pointer)) = (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))) [L74] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] COND FALSE !((*(var_1_4_Pointer))) [L77] EXPR \read(*var_1_15_Pointer) [L77] (*(var_1_12_Pointer)) = (*(var_1_15_Pointer)) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR (! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1 [L112] EXPR (! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) [L112] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))) [L112] EXPR \read(*var_1_6_Pointer) [L112] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) [L112] EXPR \read(*var_1_9_Pointer) [L112] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR \read(*var_1_10_Pointer) [L112] EXPR \read(*var_1_7_Pointer) [L112] EXPR (! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) [L112] EXPR \read(*var_1_8_Pointer) [L112] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1 [L112] EXPR ((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1 VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) [L112] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer)))) [L112] EXPR \read(*var_1_12_Pointer) [L112] EXPR \read(*var_1_15_Pointer) [L112] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer)))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112-L113] return ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 22, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8112 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8110 mSDsluCounter, 26257 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20511 mSDsCounter, 406 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3051 IncrementalHoareTripleChecker+Invalid, 3457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 406 mSolverCounterUnsat, 5746 mSDtfsCounter, 3051 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1214 GetRequests, 988 SyntacticMatches, 1 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1003occurred in iteration=20, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 1990 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 3065 NumberOfCodeBlocks, 3065 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3041 ConstructedInterpolants, 0 QuantifiedInterpolants, 9719 SizeOfPredicates, 25 NumberOfNonLiveVariables, 616 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 10776/11040 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:31:49,161 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...