/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-53.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:38:22,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:38:22,904 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:38:22,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:38:22,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:38:22,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:38:22,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:38:22,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:38:22,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:38:22,941 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:38:22,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:38:22,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:38:22,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:38:22,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:38:22,943 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:38:22,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:38:22,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:38:22,944 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:38:22,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:38:22,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:38:22,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:38:22,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:38:22,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:38:22,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:38:22,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:38:22,946 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:38:22,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:38:22,946 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:38:22,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:38:22,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:38:22,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:38:22,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:38:22,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:38:22,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:38:22,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:38:22,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:38:22,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:38:22,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:38:22,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:38:22,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:38:22,948 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:38:22,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:38:22,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:38:22,949 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:38:23,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:38:23,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:38:23,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:38:23,115 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:38:23,115 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:38:23,116 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-53.i [2023-12-19 15:38:24,223 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:38:24,420 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:38:24,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2023-12-19 15:38:24,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e0283306/cc1f7eab641b40458a80d94724a2e3a9/FLAG3fdd7bbb1 [2023-12-19 15:38:24,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e0283306/cc1f7eab641b40458a80d94724a2e3a9 [2023-12-19 15:38:24,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:38:24,446 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:38:24,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:38:24,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:38:24,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:38:24,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:24,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6593640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24, skipping insertion in model container [2023-12-19 15:38:24,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:24,489 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:38:24,655 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-53.i[916,929] [2023-12-19 15:38:24,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:38:24,760 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:38:24,773 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-53.i[916,929] [2023-12-19 15:38:24,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:38:24,856 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:38:24,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24 WrapperNode [2023-12-19 15:38:24,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:38:24,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:38:24,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:38:24,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:38:24,863 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:38:24" (1/1) ... [2023-12-19 15:38:24,892 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:38:24" (1/1) ... [2023-12-19 15:38:24,967 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 528 [2023-12-19 15:38:24,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:38:24,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:38:24,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:38:24,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:38:24,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:24,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:24,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:25,011 INFO L175 MemorySlicer]: Split 133 memory accesses to 16 slices as follows [2, 3, 12, 12, 6, 5, 10, 7, 10, 10, 12, 17, 6, 10, 5, 6]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1]. [2023-12-19 15:38:25,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:25,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:25,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:25,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:25,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:25,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:25,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:38:25,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:38:25,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:38:25,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:38:25,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24" (1/1) ... [2023-12-19 15:38:25,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:38:25,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:38:25,113 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:38:25,141 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:38:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:38:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:38:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:38:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 15:38:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 15:38:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-19 15:38:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-19 15:38:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-19 15:38:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-19 15:38:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-19 15:38:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-19 15:38:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-19 15:38:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-19 15:38:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-19 15:38:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2023-12-19 15:38:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2023-12-19 15:38:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2023-12-19 15:38:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:38:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:38:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 15:38:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 15:38:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 15:38:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-19 15:38:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-19 15:38:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-19 15:38:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-19 15:38:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-19 15:38:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-19 15:38:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-19 15:38:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-19 15:38:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-19 15:38:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-19 15:38:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-12-19 15:38:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-19 15:38:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-19 15:38:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-19 15:38:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-19 15:38:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-19 15:38:25,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-19 15:38:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-19 15:38:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-19 15:38:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-19 15:38:25,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2023-12-19 15:38:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2023-12-19 15:38:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2023-12-19 15:38:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:38:25,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:38:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:38:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:38:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 15:38:25,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-12-19 15:38:25,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:38:25,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:38:25,344 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:38:25,346 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:38:25,651 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:38:25,704 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:38:25,705 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:38:25,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:38:25 BoogieIcfgContainer [2023-12-19 15:38:25,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:38:25,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:38:25,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:38:25,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:38:25,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:38:24" (1/3) ... [2023-12-19 15:38:25,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1243753f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:38:25, skipping insertion in model container [2023-12-19 15:38:25,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:24" (2/3) ... [2023-12-19 15:38:25,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1243753f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:38:25, skipping insertion in model container [2023-12-19 15:38:25,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:38:25" (3/3) ... [2023-12-19 15:38:25,710 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-53.i [2023-12-19 15:38:25,740 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:38:25,740 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:38:25,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:38:25,783 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;@60bb48fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:38:25,784 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:38:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 15:38:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-19 15:38:25,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:25,805 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:25,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:25,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:25,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1079870598, now seen corresponding path program 1 times [2023-12-19 15:38:25,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:25,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460471209] [2023-12-19 15:38:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:25,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:26,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:26,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460471209] [2023-12-19 15:38:26,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460471209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:26,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:26,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:38:26,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313828631] [2023-12-19 15:38:26,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:26,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:38:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:26,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:38:26,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:38:26,237 INFO L87 Difference]: Start difference. First operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-19 15:38:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:26,293 INFO L93 Difference]: Finished difference Result 207 states and 330 transitions. [2023-12-19 15:38:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:38:26,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2023-12-19 15:38:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:26,301 INFO L225 Difference]: With dead ends: 207 [2023-12-19 15:38:26,301 INFO L226 Difference]: Without dead ends: 103 [2023-12-19 15:38:26,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:38:26,306 INFO L413 NwaCegarLoop]: 146 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, 146 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:38:26,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-19 15:38:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-19 15:38:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 15:38:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2023-12-19 15:38:26,336 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 135 [2023-12-19 15:38:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:26,336 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2023-12-19 15:38:26,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-19 15:38:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2023-12-19 15:38:26,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-19 15:38:26,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:26,338 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:26,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:38:26,339 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:26,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:26,339 INFO L85 PathProgramCache]: Analyzing trace with hash -148898342, now seen corresponding path program 1 times [2023-12-19 15:38:26,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:26,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547684035] [2023-12-19 15:38:26,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:26,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:26,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547684035] [2023-12-19 15:38:26,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547684035] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:26,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:26,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:38:26,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79305032] [2023-12-19 15:38:26,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:26,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:38:26,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:26,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:38:26,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:38:26,853 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:26,897 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2023-12-19 15:38:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:38:26,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2023-12-19 15:38:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:26,900 INFO L225 Difference]: With dead ends: 205 [2023-12-19 15:38:26,900 INFO L226 Difference]: Without dead ends: 103 [2023-12-19 15:38:26,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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:38:26,901 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:26,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 285 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-19 15:38:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-19 15:38:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 15:38:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2023-12-19 15:38:26,912 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 135 [2023-12-19 15:38:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:26,913 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2023-12-19 15:38:26,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2023-12-19 15:38:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-19 15:38:26,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:26,915 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:26,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:38:26,915 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:26,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1428762020, now seen corresponding path program 1 times [2023-12-19 15:38:26,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:26,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953790883] [2023-12-19 15:38:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:27,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:27,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953790883] [2023-12-19 15:38:27,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953790883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:27,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:27,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:38:27,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468252989] [2023-12-19 15:38:27,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:27,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:38:27,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:27,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:38:27,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:38:27,730 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:27,967 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2023-12-19 15:38:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:38:27,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 135 [2023-12-19 15:38:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:27,972 INFO L225 Difference]: With dead ends: 237 [2023-12-19 15:38:27,972 INFO L226 Difference]: Without dead ends: 135 [2023-12-19 15:38:27,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:38:27,974 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 458 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:27,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 554 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:38:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-19 15:38:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 109. [2023-12-19 15:38:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 15:38:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2023-12-19 15:38:28,000 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 135 [2023-12-19 15:38:28,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:28,001 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2023-12-19 15:38:28,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2023-12-19 15:38:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-19 15:38:28,006 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:28,006 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:28,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:38:28,006 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:28,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1821789030, now seen corresponding path program 1 times [2023-12-19 15:38:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:28,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857855434] [2023-12-19 15:38:28,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:29,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:29,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857855434] [2023-12-19 15:38:29,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857855434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:29,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:29,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 15:38:29,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013845679] [2023-12-19 15:38:29,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:29,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 15:38:29,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:29,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 15:38:29,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:38:29,611 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:30,131 INFO L93 Difference]: Finished difference Result 365 states and 517 transitions. [2023-12-19 15:38:30,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:38:30,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 135 [2023-12-19 15:38:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:30,133 INFO L225 Difference]: With dead ends: 365 [2023-12-19 15:38:30,133 INFO L226 Difference]: Without dead ends: 257 [2023-12-19 15:38:30,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-12-19 15:38:30,135 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 388 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:30,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 931 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:38:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-12-19 15:38:30,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2023-12-19 15:38:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 170 states have (on average 1.3411764705882352) internal successors, (228), 170 states have internal predecessors, (228), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:38:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2023-12-19 15:38:30,152 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 135 [2023-12-19 15:38:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:30,153 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2023-12-19 15:38:30,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2023-12-19 15:38:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-19 15:38:30,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:30,154 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:30,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:38:30,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:30,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash 668833267, now seen corresponding path program 1 times [2023-12-19 15:38:30,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109928718] [2023-12-19 15:38:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:31,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:31,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109928718] [2023-12-19 15:38:31,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109928718] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:31,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:38:31,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311064868] [2023-12-19 15:38:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:31,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:38:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:31,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:38:31,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:38:31,105 INFO L87 Difference]: Start difference. First operand 211 states and 300 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:31,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:31,387 INFO L93 Difference]: Finished difference Result 318 states and 451 transitions. [2023-12-19 15:38:31,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:38:31,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 137 [2023-12-19 15:38:31,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:31,389 INFO L225 Difference]: With dead ends: 318 [2023-12-19 15:38:31,389 INFO L226 Difference]: Without dead ends: 210 [2023-12-19 15:38:31,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:38:31,390 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 282 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:31,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 520 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:38:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-19 15:38:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 107. [2023-12-19 15:38:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 15:38:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2023-12-19 15:38:31,401 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 137 [2023-12-19 15:38:31,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:31,402 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2023-12-19 15:38:31,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2023-12-19 15:38:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-19 15:38:31,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:31,403 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:31,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:38:31,403 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:31,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:31,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1993440470, now seen corresponding path program 1 times [2023-12-19 15:38:31,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:31,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386864118] [2023-12-19 15:38:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:31,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:31,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:31,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386864118] [2023-12-19 15:38:31,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386864118] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:31,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:31,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:38:31,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076174255] [2023-12-19 15:38:31,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:31,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:38:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:31,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:38:31,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:38:31,610 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:31,639 INFO L93 Difference]: Finished difference Result 213 states and 299 transitions. [2023-12-19 15:38:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:38:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-12-19 15:38:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:31,640 INFO L225 Difference]: With dead ends: 213 [2023-12-19 15:38:31,640 INFO L226 Difference]: Without dead ends: 107 [2023-12-19 15:38:31,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:38:31,641 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 37 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:31,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 375 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:31,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-19 15:38:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-19 15:38:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 15:38:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2023-12-19 15:38:31,652 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 140 [2023-12-19 15:38:31,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:31,653 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2023-12-19 15:38:31,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:31,653 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2023-12-19 15:38:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-19 15:38:31,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:31,654 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:31,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:38:31,654 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:31,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1735275032, now seen corresponding path program 1 times [2023-12-19 15:38:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:31,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425229215] [2023-12-19 15:38:31,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425229215] [2023-12-19 15:38:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425229215] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:32,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:38:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902787573] [2023-12-19 15:38:32,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:32,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:38:32,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:32,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:38:32,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:32,001 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:32,095 INFO L93 Difference]: Finished difference Result 300 states and 414 transitions. [2023-12-19 15:38:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:38:32,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-12-19 15:38:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:32,097 INFO L225 Difference]: With dead ends: 300 [2023-12-19 15:38:32,097 INFO L226 Difference]: Without dead ends: 194 [2023-12-19 15:38:32,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 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:38:32,098 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 183 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:32,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 895 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:38:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-19 15:38:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 180. [2023-12-19 15:38:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-19 15:38:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 248 transitions. [2023-12-19 15:38:32,112 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 248 transitions. Word has length 140 [2023-12-19 15:38:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:32,113 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 248 transitions. [2023-12-19 15:38:32,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 248 transitions. [2023-12-19 15:38:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-19 15:38:32,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:32,114 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:32,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:38:32,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:32,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash -292630820, now seen corresponding path program 1 times [2023-12-19 15:38:32,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:32,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810702656] [2023-12-19 15:38:32,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:32,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:33,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:33,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810702656] [2023-12-19 15:38:33,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810702656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:33,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:33,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-19 15:38:33,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735919045] [2023-12-19 15:38:33,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:33,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 15:38:33,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:33,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 15:38:33,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:38:33,117 INFO L87 Difference]: Start difference. First operand 180 states and 248 transitions. Second operand has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:34,114 INFO L93 Difference]: Finished difference Result 652 states and 897 transitions. [2023-12-19 15:38:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 15:38:34,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2023-12-19 15:38:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:34,119 INFO L225 Difference]: With dead ends: 652 [2023-12-19 15:38:34,119 INFO L226 Difference]: Without dead ends: 473 [2023-12-19 15:38:34,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2023-12-19 15:38:34,120 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 449 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:34,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1595 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 15:38:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-12-19 15:38:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 402. [2023-12-19 15:38:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 334 states have (on average 1.3203592814371257) internal successors, (441), 337 states have internal predecessors, (441), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-19 15:38:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 557 transitions. [2023-12-19 15:38:34,162 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 557 transitions. Word has length 141 [2023-12-19 15:38:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:34,162 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 557 transitions. [2023-12-19 15:38:34,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 557 transitions. [2023-12-19 15:38:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-19 15:38:34,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:34,164 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:34,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:38:34,164 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:34,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:34,164 INFO L85 PathProgramCache]: Analyzing trace with hash -685657830, now seen corresponding path program 1 times [2023-12-19 15:38:34,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:34,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905132216] [2023-12-19 15:38:34,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:34,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:34,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:34,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905132216] [2023-12-19 15:38:34,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905132216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:34,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:34,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:38:34,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360895311] [2023-12-19 15:38:34,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:34,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:38:34,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:34,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:38:34,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:34,431 INFO L87 Difference]: Start difference. First operand 402 states and 557 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:34,536 INFO L93 Difference]: Finished difference Result 915 states and 1264 transitions. [2023-12-19 15:38:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:38:34,537 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2023-12-19 15:38:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:34,539 INFO L225 Difference]: With dead ends: 915 [2023-12-19 15:38:34,539 INFO L226 Difference]: Without dead ends: 514 [2023-12-19 15:38:34,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:38:34,541 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 83 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:34,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 690 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:38:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2023-12-19 15:38:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 428. [2023-12-19 15:38:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 360 states have (on average 1.3055555555555556) internal successors, (470), 363 states have internal predecessors, (470), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-19 15:38:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 586 transitions. [2023-12-19 15:38:34,573 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 586 transitions. Word has length 141 [2023-12-19 15:38:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:34,573 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 586 transitions. [2023-12-19 15:38:34,573 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 586 transitions. [2023-12-19 15:38:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-19 15:38:34,575 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:34,575 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:34,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 15:38:34,575 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:34,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1981574562, now seen corresponding path program 1 times [2023-12-19 15:38:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:34,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964265680] [2023-12-19 15:38:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:34,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:34,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964265680] [2023-12-19 15:38:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964265680] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:34,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:34,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:38:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964701522] [2023-12-19 15:38:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:34,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:38:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:34,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:38:34,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:34,843 INFO L87 Difference]: Start difference. First operand 428 states and 586 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:34,959 INFO L93 Difference]: Finished difference Result 941 states and 1289 transitions. [2023-12-19 15:38:34,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:38:34,960 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2023-12-19 15:38:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:34,961 INFO L225 Difference]: With dead ends: 941 [2023-12-19 15:38:34,961 INFO L226 Difference]: Without dead ends: 514 [2023-12-19 15:38:34,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:38:34,962 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 83 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:34,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 770 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:38:34,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2023-12-19 15:38:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 428. [2023-12-19 15:38:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 360 states have (on average 1.2944444444444445) internal successors, (466), 363 states have internal predecessors, (466), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-19 15:38:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 582 transitions. [2023-12-19 15:38:34,991 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 582 transitions. Word has length 141 [2023-12-19 15:38:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:34,993 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 582 transitions. [2023-12-19 15:38:34,993 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 582 transitions. [2023-12-19 15:38:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-19 15:38:34,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:34,995 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:34,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 15:38:34,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:34,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:34,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1920365724, now seen corresponding path program 1 times [2023-12-19 15:38:34,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:34,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414364111] [2023-12-19 15:38:34,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:34,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:35,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:35,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414364111] [2023-12-19 15:38:35,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414364111] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:35,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:35,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:38:35,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739770675] [2023-12-19 15:38:35,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:35,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:38:35,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:35,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:38:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:38:35,476 INFO L87 Difference]: Start difference. First operand 428 states and 582 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:35,789 INFO L93 Difference]: Finished difference Result 898 states and 1217 transitions. [2023-12-19 15:38:35,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:38:35,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2023-12-19 15:38:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:35,792 INFO L225 Difference]: With dead ends: 898 [2023-12-19 15:38:35,792 INFO L226 Difference]: Without dead ends: 471 [2023-12-19 15:38:35,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:38:35,793 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 234 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:35,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1191 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:38:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2023-12-19 15:38:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 428. [2023-12-19 15:38:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 360 states have (on average 1.2916666666666667) internal successors, (465), 363 states have internal predecessors, (465), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-19 15:38:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 581 transitions. [2023-12-19 15:38:35,823 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 581 transitions. Word has length 141 [2023-12-19 15:38:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:35,823 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 581 transitions. [2023-12-19 15:38:35,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 581 transitions. [2023-12-19 15:38:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-19 15:38:35,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:35,824 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:35,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 15:38:35,824 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:35,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:35,825 INFO L85 PathProgramCache]: Analyzing trace with hash -733823082, now seen corresponding path program 1 times [2023-12-19 15:38:35,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:35,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678978527] [2023-12-19 15:38:35,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:35,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:36,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:36,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678978527] [2023-12-19 15:38:36,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678978527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:36,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:36,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:38:36,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176476245] [2023-12-19 15:38:36,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:36,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:38:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:36,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:38:36,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:36,004 INFO L87 Difference]: Start difference. First operand 428 states and 581 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:36,065 INFO L93 Difference]: Finished difference Result 895 states and 1216 transitions. [2023-12-19 15:38:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:38:36,065 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2023-12-19 15:38:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:36,067 INFO L225 Difference]: With dead ends: 895 [2023-12-19 15:38:36,067 INFO L226 Difference]: Without dead ends: 468 [2023-12-19 15:38:36,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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:38:36,068 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 32 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 540 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:38:36,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 540 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-12-19 15:38:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 443. [2023-12-19 15:38:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 375 states have (on average 1.28) internal successors, (480), 378 states have internal predecessors, (480), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-19 15:38:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 596 transitions. [2023-12-19 15:38:36,105 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 596 transitions. Word has length 142 [2023-12-19 15:38:36,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:36,105 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 596 transitions. [2023-12-19 15:38:36,105 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 596 transitions. [2023-12-19 15:38:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-19 15:38:36,106 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:36,106 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 15:38:36,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:36,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:36,107 INFO L85 PathProgramCache]: Analyzing trace with hash 408792204, now seen corresponding path program 1 times [2023-12-19 15:38:36,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:36,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106622507] [2023-12-19 15:38:36,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:36,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:36,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:36,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106622507] [2023-12-19 15:38:36,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106622507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:36,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:36,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:38:36,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262692427] [2023-12-19 15:38:36,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:36,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:38:36,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:38:36,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:36,276 INFO L87 Difference]: Start difference. First operand 443 states and 596 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:36,340 INFO L93 Difference]: Finished difference Result 975 states and 1306 transitions. [2023-12-19 15:38:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:38:36,340 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2023-12-19 15:38:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:36,343 INFO L225 Difference]: With dead ends: 975 [2023-12-19 15:38:36,343 INFO L226 Difference]: Without dead ends: 533 [2023-12-19 15:38:36,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:38:36,345 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 74 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:36,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 689 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2023-12-19 15:38:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 457. [2023-12-19 15:38:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 389 states have (on average 1.2699228791773778) internal successors, (494), 392 states have internal predecessors, (494), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-19 15:38:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 610 transitions. [2023-12-19 15:38:36,371 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 610 transitions. Word has length 142 [2023-12-19 15:38:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:36,372 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 610 transitions. [2023-12-19 15:38:36,372 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 610 transitions. [2023-12-19 15:38:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-19 15:38:36,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:36,373 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 15:38:36,373 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:36,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash -555710091, now seen corresponding path program 1 times [2023-12-19 15:38:36,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:36,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330867405] [2023-12-19 15:38:36,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:36,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:37,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:37,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330867405] [2023-12-19 15:38:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330867405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:37,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:37,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-19 15:38:37,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72726883] [2023-12-19 15:38:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:37,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-19 15:38:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:37,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-19 15:38:37,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2023-12-19 15:38:37,555 INFO L87 Difference]: Start difference. First operand 457 states and 610 transitions. Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2023-12-19 15:38:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:39,257 INFO L93 Difference]: Finished difference Result 762 states and 1010 transitions. [2023-12-19 15:38:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:38:39,257 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 143 [2023-12-19 15:38:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:39,259 INFO L225 Difference]: With dead ends: 762 [2023-12-19 15:38:39,259 INFO L226 Difference]: Without dead ends: 552 [2023-12-19 15:38:39,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2023-12-19 15:38:39,260 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 463 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:39,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1522 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-19 15:38:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-12-19 15:38:39,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 497. [2023-12-19 15:38:39,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 426 states have (on average 1.2699530516431925) internal successors, (541), 430 states have internal predecessors, (541), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-19 15:38:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 661 transitions. [2023-12-19 15:38:39,289 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 661 transitions. Word has length 143 [2023-12-19 15:38:39,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:39,289 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 661 transitions. [2023-12-19 15:38:39,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2023-12-19 15:38:39,290 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 661 transitions. [2023-12-19 15:38:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-19 15:38:39,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:39,291 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:39,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 15:38:39,291 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:39,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:39,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1657286453, now seen corresponding path program 1 times [2023-12-19 15:38:39,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:39,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010425991] [2023-12-19 15:38:39,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:39,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:40,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010425991] [2023-12-19 15:38:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010425991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:40,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:40,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 15:38:40,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626066699] [2023-12-19 15:38:40,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:40,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 15:38:40,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:40,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 15:38:40,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:38:40,173 INFO L87 Difference]: Start difference. First operand 497 states and 661 transitions. Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:40,860 INFO L93 Difference]: Finished difference Result 784 states and 1037 transitions. [2023-12-19 15:38:40,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 15:38:40,860 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 143 [2023-12-19 15:38:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:40,862 INFO L225 Difference]: With dead ends: 784 [2023-12-19 15:38:40,862 INFO L226 Difference]: Without dead ends: 534 [2023-12-19 15:38:40,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-12-19 15:38:40,863 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 406 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:40,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1430 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:38:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-12-19 15:38:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 251. [2023-12-19 15:38:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 215 states have (on average 1.2651162790697674) internal successors, (272), 217 states have internal predecessors, (272), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-19 15:38:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 332 transitions. [2023-12-19 15:38:40,885 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 332 transitions. Word has length 143 [2023-12-19 15:38:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:40,885 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 332 transitions. [2023-12-19 15:38:40,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 332 transitions. [2023-12-19 15:38:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 15:38:40,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:40,886 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:40,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 15:38:40,887 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:40,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:40,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1444241647, now seen corresponding path program 1 times [2023-12-19 15:38:40,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:40,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970208281] [2023-12-19 15:38:40,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:40,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:41,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:41,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970208281] [2023-12-19 15:38:41,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970208281] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:41,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:41,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:38:41,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559875170] [2023-12-19 15:38:41,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:41,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:38:41,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:41,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:38:41,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:41,196 INFO L87 Difference]: Start difference. First operand 251 states and 332 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:41,293 INFO L93 Difference]: Finished difference Result 694 states and 914 transitions. [2023-12-19 15:38:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:38:41,294 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2023-12-19 15:38:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:41,295 INFO L225 Difference]: With dead ends: 694 [2023-12-19 15:38:41,295 INFO L226 Difference]: Without dead ends: 444 [2023-12-19 15:38:41,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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:38:41,296 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 84 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:41,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 536 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:38:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-12-19 15:38:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 353. [2023-12-19 15:38:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 314 states have (on average 1.2707006369426752) internal successors, (399), 317 states have internal predecessors, (399), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:38:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 463 transitions. [2023-12-19 15:38:41,316 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 463 transitions. Word has length 144 [2023-12-19 15:38:41,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:41,317 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 463 transitions. [2023-12-19 15:38:41,317 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 463 transitions. [2023-12-19 15:38:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 15:38:41,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:41,318 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:41,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 15:38:41,318 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:41,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1355038757, now seen corresponding path program 1 times [2023-12-19 15:38:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:41,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681462782] [2023-12-19 15:38:41,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681462782] [2023-12-19 15:38:41,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681462782] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:41,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:41,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:38:41,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749002498] [2023-12-19 15:38:41,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:41,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:38:41,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:41,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:38:41,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:41,909 INFO L87 Difference]: Start difference. First operand 353 states and 463 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:42,026 INFO L93 Difference]: Finished difference Result 692 states and 902 transitions. [2023-12-19 15:38:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:38:42,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2023-12-19 15:38:42,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:42,028 INFO L225 Difference]: With dead ends: 692 [2023-12-19 15:38:42,028 INFO L226 Difference]: Without dead ends: 690 [2023-12-19 15:38:42,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:38:42,029 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 105 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:42,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 848 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:38:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2023-12-19 15:38:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 518. [2023-12-19 15:38:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 479 states have (on average 1.2713987473903967) internal successors, (609), 482 states have internal predecessors, (609), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:38:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 673 transitions. [2023-12-19 15:38:42,059 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 673 transitions. Word has length 144 [2023-12-19 15:38:42,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:42,059 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 673 transitions. [2023-12-19 15:38:42,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 673 transitions. [2023-12-19 15:38:42,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-19 15:38:42,060 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:42,060 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:42,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 15:38:42,061 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:42,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash 815036033, now seen corresponding path program 1 times [2023-12-19 15:38:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524011985] [2023-12-19 15:38:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:42,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:42,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524011985] [2023-12-19 15:38:42,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524011985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:42,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:42,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:38:42,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339354236] [2023-12-19 15:38:42,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:42,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:38:42,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:42,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:38:42,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:38:42,228 INFO L87 Difference]: Start difference. First operand 518 states and 673 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:42,335 INFO L93 Difference]: Finished difference Result 1241 states and 1599 transitions. [2023-12-19 15:38:42,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 15:38:42,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2023-12-19 15:38:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:42,337 INFO L225 Difference]: With dead ends: 1241 [2023-12-19 15:38:42,337 INFO L226 Difference]: Without dead ends: 724 [2023-12-19 15:38:42,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:38:42,339 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 94 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:42,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 859 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2023-12-19 15:38:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 526. [2023-12-19 15:38:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 487 states have (on average 1.26694045174538) internal successors, (617), 490 states have internal predecessors, (617), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:38:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 681 transitions. [2023-12-19 15:38:42,372 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 681 transitions. Word has length 144 [2023-12-19 15:38:42,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:42,372 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 681 transitions. [2023-12-19 15:38:42,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 681 transitions. [2023-12-19 15:38:42,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 15:38:42,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:42,373 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:42,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 15:38:42,374 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:42,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:42,374 INFO L85 PathProgramCache]: Analyzing trace with hash 726762273, now seen corresponding path program 1 times [2023-12-19 15:38:42,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:42,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076363912] [2023-12-19 15:38:42,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:42,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 15:38:43,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:43,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076363912] [2023-12-19 15:38:43,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076363912] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:38:43,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252333151] [2023-12-19 15:38:43,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:43,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:38:43,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:38:43,109 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:38:43,131 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:38:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:43,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-19 15:38:43,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:38:43,749 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:38:44,914 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 17 treesize of output 9 [2023-12-19 15:38:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 173 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2023-12-19 15:38:44,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:38:45,919 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 46 treesize of output 42 [2023-12-19 15:38:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 15:38:45,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252333151] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:38:45,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 15:38:45,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 29 [2023-12-19 15:38:45,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949192734] [2023-12-19 15:38:45,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 15:38:45,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-19 15:38:45,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:45,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-19 15:38:45,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2023-12-19 15:38:45,973 INFO L87 Difference]: Start difference. First operand 526 states and 681 transitions. Second operand has 29 states, 26 states have (on average 6.076923076923077) internal successors, (158), 27 states have internal predecessors, (158), 9 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 7 states have call predecessors, (54), 9 states have call successors, (54) [2023-12-19 15:38:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:48,075 INFO L93 Difference]: Finished difference Result 1877 states and 2399 transitions. [2023-12-19 15:38:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-19 15:38:48,076 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.076923076923077) internal successors, (158), 27 states have internal predecessors, (158), 9 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 7 states have call predecessors, (54), 9 states have call successors, (54) Word has length 146 [2023-12-19 15:38:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:48,079 INFO L225 Difference]: With dead ends: 1877 [2023-12-19 15:38:48,079 INFO L226 Difference]: Without dead ends: 1352 [2023-12-19 15:38:48,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=584, Invalid=2722, Unknown=0, NotChecked=0, Total=3306 [2023-12-19 15:38:48,081 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 1308 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 2222 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:48,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 2222 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-19 15:38:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-12-19 15:38:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 988. [2023-12-19 15:38:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 907 states have (on average 1.264608599779493) internal successors, (1147), 913 states have internal predecessors, (1147), 64 states have call successors, (64), 16 states have call predecessors, (64), 16 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 15:38:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1275 transitions. [2023-12-19 15:38:48,133 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1275 transitions. Word has length 146 [2023-12-19 15:38:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:48,133 INFO L495 AbstractCegarLoop]: Abstraction has 988 states and 1275 transitions. [2023-12-19 15:38:48,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.076923076923077) internal successors, (158), 27 states have internal predecessors, (158), 9 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 7 states have call predecessors, (54), 9 states have call successors, (54) [2023-12-19 15:38:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1275 transitions. [2023-12-19 15:38:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 15:38:48,135 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:48,135 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:48,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 15:38:48,344 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:38:48,345 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:48,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:48,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2028813069, now seen corresponding path program 1 times [2023-12-19 15:38:48,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:48,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338412489] [2023-12-19 15:38:48,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:48,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:49,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:49,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338412489] [2023-12-19 15:38:49,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338412489] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:49,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:49,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 15:38:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45459321] [2023-12-19 15:38:49,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:49,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 15:38:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:49,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 15:38:49,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:38:49,144 INFO L87 Difference]: Start difference. First operand 988 states and 1275 transitions. Second operand has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:49,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:49,706 INFO L93 Difference]: Finished difference Result 2060 states and 2651 transitions. [2023-12-19 15:38:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 15:38:49,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2023-12-19 15:38:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:49,709 INFO L225 Difference]: With dead ends: 2060 [2023-12-19 15:38:49,709 INFO L226 Difference]: Without dead ends: 1073 [2023-12-19 15:38:49,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-12-19 15:38:49,711 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 210 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:49,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1434 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:38:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2023-12-19 15:38:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1002. [2023-12-19 15:38:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 921 states have (on average 1.264929424538545) internal successors, (1165), 927 states have internal predecessors, (1165), 64 states have call successors, (64), 16 states have call predecessors, (64), 16 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 15:38:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1293 transitions. [2023-12-19 15:38:49,760 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1293 transitions. Word has length 146 [2023-12-19 15:38:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:49,760 INFO L495 AbstractCegarLoop]: Abstraction has 1002 states and 1293 transitions. [2023-12-19 15:38:49,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-19 15:38:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1293 transitions. [2023-12-19 15:38:49,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-19 15:38:49,761 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:49,762 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:49,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 15:38:49,762 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:49,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash -428319587, now seen corresponding path program 1 times [2023-12-19 15:38:49,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:49,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324811223] [2023-12-19 15:38:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 15:38:50,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:50,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324811223] [2023-12-19 15:38:50,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324811223] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:38:50,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440292057] [2023-12-19 15:38:50,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:50,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:38:50,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:38:50,268 INFO L229 MonitoredProcess]: Starting monitored process 3 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:38:50,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 15:38:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:50,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-19 15:38:50,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:38:50,599 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:38:51,847 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 17 treesize of output 9 [2023-12-19 15:38:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-19 15:38:51,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:38:52,123 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 46 treesize of output 42 [2023-12-19 15:38:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 15:38:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440292057] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:38:52,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 15:38:52,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2023-12-19 15:38:52,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789187099] [2023-12-19 15:38:52,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 15:38:52,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-19 15:38:52,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:52,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-19 15:38:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2023-12-19 15:38:52,150 INFO L87 Difference]: Start difference. First operand 1002 states and 1293 transitions. Second operand has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) [2023-12-19 15:38:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:53,228 INFO L93 Difference]: Finished difference Result 2224 states and 2842 transitions. [2023-12-19 15:38:53,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-19 15:38:53,231 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) Word has length 146 [2023-12-19 15:38:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:53,237 INFO L225 Difference]: With dead ends: 2224 [2023-12-19 15:38:53,237 INFO L226 Difference]: Without dead ends: 1223 [2023-12-19 15:38:53,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=412, Invalid=1844, Unknown=0, NotChecked=0, Total=2256 [2023-12-19 15:38:53,239 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 869 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:53,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1758 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 15:38:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2023-12-19 15:38:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 997. [2023-12-19 15:38:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 908 states have (on average 1.2566079295154184) internal successors, (1141), 914 states have internal predecessors, (1141), 64 states have call successors, (64), 24 states have call predecessors, (64), 24 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 15:38:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1269 transitions. [2023-12-19 15:38:53,296 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1269 transitions. Word has length 146 [2023-12-19 15:38:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:53,297 INFO L495 AbstractCegarLoop]: Abstraction has 997 states and 1269 transitions. [2023-12-19 15:38:53,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 4 states have call predecessors, (54), 6 states have call successors, (54) [2023-12-19 15:38:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1269 transitions. [2023-12-19 15:38:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-19 15:38:53,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:53,298 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:53,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 15:38:53,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-19 15:38:53,506 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:53,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:53,507 INFO L85 PathProgramCache]: Analyzing trace with hash 381697767, now seen corresponding path program 1 times [2023-12-19 15:38:53,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:53,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120170496] [2023-12-19 15:38:53,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:53,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 15:38:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120170496] [2023-12-19 15:38:53,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120170496] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:38:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324546014] [2023-12-19 15:38:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:53,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:38:53,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:38:53,952 INFO L229 MonitoredProcess]: Starting monitored process 4 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:38:53,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 15:38:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:54,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-19 15:38:54,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:38:54,344 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:38:54,611 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 11 [2023-12-19 15:38:54,671 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 21 treesize of output 13 [2023-12-19 15:38:54,689 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 17 treesize of output 9 [2023-12-19 15:38:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 10 proven. 338 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:54,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:38:54,884 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 27 treesize of output 23 [2023-12-19 15:38:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-19 15:38:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324546014] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:38:54,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 15:38:54,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 28 [2023-12-19 15:38:54,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609718691] [2023-12-19 15:38:54,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 15:38:54,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-19 15:38:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:54,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-19 15:38:54,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2023-12-19 15:38:54,926 INFO L87 Difference]: Start difference. First operand 997 states and 1269 transitions. Second operand has 28 states, 24 states have (on average 6.583333333333333) internal successors, (158), 26 states have internal predecessors, (158), 11 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 8 states have call predecessors, (54), 11 states have call successors, (54) [2023-12-19 15:38:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:56,020 INFO L93 Difference]: Finished difference Result 2426 states and 3026 transitions. [2023-12-19 15:38:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 15:38:56,021 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 6.583333333333333) internal successors, (158), 26 states have internal predecessors, (158), 11 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 8 states have call predecessors, (54), 11 states have call successors, (54) Word has length 147 [2023-12-19 15:38:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:56,025 INFO L225 Difference]: With dead ends: 2426 [2023-12-19 15:38:56,025 INFO L226 Difference]: Without dead ends: 1430 [2023-12-19 15:38:56,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=607, Invalid=2255, Unknown=0, NotChecked=0, Total=2862 [2023-12-19 15:38:56,027 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 1029 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:56,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 1220 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:38:56,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2023-12-19 15:38:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 797. [2023-12-19 15:38:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 710 states have (on average 1.223943661971831) internal successors, (869), 714 states have internal predecessors, (869), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-19 15:38:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 989 transitions. [2023-12-19 15:38:56,091 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 989 transitions. Word has length 147 [2023-12-19 15:38:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:56,091 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 989 transitions. [2023-12-19 15:38:56,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 6.583333333333333) internal successors, (158), 26 states have internal predecessors, (158), 11 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 8 states have call predecessors, (54), 11 states have call successors, (54) [2023-12-19 15:38:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 989 transitions. [2023-12-19 15:38:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:38:56,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:56,092 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 15:38:56,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:38:56,299 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:56,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:56,299 INFO L85 PathProgramCache]: Analyzing trace with hash -239282491, now seen corresponding path program 1 times [2023-12-19 15:38:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650601064] [2023-12-19 15:38:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:56,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:56,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650601064] [2023-12-19 15:38:56,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650601064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:56,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:56,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:38:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705562494] [2023-12-19 15:38:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:56,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:38:56,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:56,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:38:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:38:56,764 INFO L87 Difference]: Start difference. First operand 797 states and 989 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:57,104 INFO L93 Difference]: Finished difference Result 1623 states and 2011 transitions. [2023-12-19 15:38:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:38:57,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2023-12-19 15:38:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:57,106 INFO L225 Difference]: With dead ends: 1623 [2023-12-19 15:38:57,107 INFO L226 Difference]: Without dead ends: 811 [2023-12-19 15:38:57,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:38:57,108 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 120 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:57,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1047 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:38:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2023-12-19 15:38:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 777. [2023-12-19 15:38:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 690 states have (on average 1.2246376811594204) internal successors, (845), 694 states have internal predecessors, (845), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-19 15:38:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 965 transitions. [2023-12-19 15:38:57,167 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 965 transitions. Word has length 148 [2023-12-19 15:38:57,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:57,167 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 965 transitions. [2023-12-19 15:38:57,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 965 transitions. [2023-12-19 15:38:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-19 15:38:57,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:57,169 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:57,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 15:38:57,169 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:57,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:57,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1049709210, now seen corresponding path program 1 times [2023-12-19 15:38:57,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:57,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678035399] [2023-12-19 15:38:57,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:57,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:38:57,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:57,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678035399] [2023-12-19 15:38:57,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678035399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:57,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:57,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:38:57,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361207391] [2023-12-19 15:38:57,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:57,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:38:57,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:57,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:38:57,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:38:57,732 INFO L87 Difference]: Start difference. First operand 777 states and 965 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:58,157 INFO L93 Difference]: Finished difference Result 1368 states and 1697 transitions. [2023-12-19 15:38:58,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:38:58,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2023-12-19 15:38:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:58,161 INFO L225 Difference]: With dead ends: 1368 [2023-12-19 15:38:58,161 INFO L226 Difference]: Without dead ends: 949 [2023-12-19 15:38:58,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:38:58,162 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 148 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:58,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1698 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:38:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2023-12-19 15:38:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 902. [2023-12-19 15:38:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 779 states have (on average 1.215661103979461) internal successors, (947), 785 states have internal predecessors, (947), 84 states have call successors, (84), 38 states have call predecessors, (84), 38 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:38:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1115 transitions. [2023-12-19 15:38:58,246 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1115 transitions. Word has length 148 [2023-12-19 15:38:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:58,246 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 1115 transitions. [2023-12-19 15:38:58,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:38:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1115 transitions. [2023-12-19 15:38:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-19 15:38:58,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:58,247 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:58,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-19 15:38:58,248 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:58,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:58,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1274258361, now seen corresponding path program 1 times [2023-12-19 15:38:58,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:58,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72691638] [2023-12-19 15:38:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:58,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:38:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:38:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:38:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:38:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:38:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:38:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:38:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:38:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:38:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 84 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2023-12-19 15:38:59,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:59,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72691638] [2023-12-19 15:38:59,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72691638] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:38:59,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161257881] [2023-12-19 15:38:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:59,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:38:59,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:38:59,115 INFO L229 MonitoredProcess]: Starting monitored process 5 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:38:59,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 15:39:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:18,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-19 15:39:18,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:39:18,291 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:39:18,778 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:39:19,767 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:39:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 488 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-19 15:39:20,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:39:20,743 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 64 treesize of output 60 [2023-12-19 15:39:22,730 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 154 treesize of output 142 [2023-12-19 15:39:26,714 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 84 treesize of output 76 [2023-12-19 15:39:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 135 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2023-12-19 15:39:26,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161257881] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:39:26,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 15:39:26,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 21] total 55 [2023-12-19 15:39:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289629225] [2023-12-19 15:39:26,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 15:39:26,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-19 15:39:26,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:39:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-19 15:39:26,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2644, Unknown=0, NotChecked=0, Total=2970 [2023-12-19 15:39:26,936 INFO L87 Difference]: Start difference. First operand 902 states and 1115 transitions. Second operand has 55 states, 43 states have (on average 3.5348837209302326) internal successors, (152), 46 states have internal predecessors, (152), 23 states have call successors, (52), 8 states have call predecessors, (52), 14 states have return successors, (52), 17 states have call predecessors, (52), 23 states have call successors, (52) [2023-12-19 15:39:29,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-19 15:39:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:39:32,482 INFO L93 Difference]: Finished difference Result 1444 states and 1766 transitions. [2023-12-19 15:39:32,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-19 15:39:32,483 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 43 states have (on average 3.5348837209302326) internal successors, (152), 46 states have internal predecessors, (152), 23 states have call successors, (52), 8 states have call predecessors, (52), 14 states have return successors, (52), 17 states have call predecessors, (52), 23 states have call successors, (52) Word has length 149 [2023-12-19 15:39:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:39:32,484 INFO L225 Difference]: With dead ends: 1444 [2023-12-19 15:39:32,484 INFO L226 Difference]: Without dead ends: 543 [2023-12-19 15:39:32,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1111, Invalid=5209, Unknown=0, NotChecked=0, Total=6320 [2023-12-19 15:39:32,492 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 845 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-19 15:39:32,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1425 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-19 15:39:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2023-12-19 15:39:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 413. [2023-12-19 15:39:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 342 states have (on average 1.1900584795321638) internal successors, (407), 343 states have internal predecessors, (407), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 15:39:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 499 transitions. [2023-12-19 15:39:32,550 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 499 transitions. Word has length 149 [2023-12-19 15:39:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:39:32,550 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 499 transitions. [2023-12-19 15:39:32,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 43 states have (on average 3.5348837209302326) internal successors, (152), 46 states have internal predecessors, (152), 23 states have call successors, (52), 8 states have call predecessors, (52), 14 states have return successors, (52), 17 states have call predecessors, (52), 23 states have call successors, (52) [2023-12-19 15:39:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 499 transitions. [2023-12-19 15:39:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-19 15:39:32,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:39:32,551 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:32,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-19 15:39:32,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:39:32,756 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:39:32,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:39:32,757 INFO L85 PathProgramCache]: Analyzing trace with hash -461787636, now seen corresponding path program 1 times [2023-12-19 15:39:32,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:39:32,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898902552] [2023-12-19 15:39:32,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:39:32,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:39:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:32,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:39:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:32,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:39:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:32,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:39:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:32,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:39:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:39:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:39:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:39:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:39:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:39:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:39:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:39:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:39:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:39:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:39:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:39:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:39:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:39:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:39:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:39:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:39:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898902552] [2023-12-19 15:39:33,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898902552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:39:33,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:39:33,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:39:33,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426814027] [2023-12-19 15:39:33,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:39:33,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:39:33,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:39:33,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:39:33,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:39:33,022 INFO L87 Difference]: Start difference. First operand 413 states and 499 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:39:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:39:33,131 INFO L93 Difference]: Finished difference Result 712 states and 860 transitions. [2023-12-19 15:39:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:39:33,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2023-12-19 15:39:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:39:33,133 INFO L225 Difference]: With dead ends: 712 [2023-12-19 15:39:33,133 INFO L226 Difference]: Without dead ends: 413 [2023-12-19 15:39:33,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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:39:33,134 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 59 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:39:33,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 404 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:39:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2023-12-19 15:39:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2023-12-19 15:39:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 342 states have (on average 1.1812865497076024) internal successors, (404), 343 states have internal predecessors, (404), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 15:39:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 496 transitions. [2023-12-19 15:39:33,192 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 496 transitions. Word has length 150 [2023-12-19 15:39:33,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:39:33,192 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 496 transitions. [2023-12-19 15:39:33,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-19 15:39:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 496 transitions. [2023-12-19 15:39:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 15:39:33,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:39:33,193 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:33,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-19 15:39:33,193 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:39:33,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:39:33,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1704651813, now seen corresponding path program 1 times [2023-12-19 15:39:33,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:39:33,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992483028] [2023-12-19 15:39:33,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:39:33,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:39:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:39:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:39:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:39:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:39:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:39:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:39:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:39:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:39:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:39:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:39:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:39:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:39:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:39:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:39:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:39:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:39:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:39:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:39:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:39:35,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:39:35,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992483028] [2023-12-19 15:39:35,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992483028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:39:35,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:39:35,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-19 15:39:35,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011437799] [2023-12-19 15:39:35,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:39:35,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 15:39:35,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:39:35,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 15:39:35,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:39:35,069 INFO L87 Difference]: Start difference. First operand 413 states and 496 transitions. Second operand has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-19 15:39:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:39:41,757 INFO L93 Difference]: Finished difference Result 793 states and 943 transitions. [2023-12-19 15:39:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 15:39:41,757 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 152 [2023-12-19 15:39:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:39:41,759 INFO L225 Difference]: With dead ends: 793 [2023-12-19 15:39:41,759 INFO L226 Difference]: Without dead ends: 478 [2023-12-19 15:39:41,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=107, Invalid=542, Unknown=1, NotChecked=0, Total=650 [2023-12-19 15:39:41,760 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 328 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-19 15:39:41,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1196 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-19 15:39:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-12-19 15:39:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 408. [2023-12-19 15:39:41,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 337 states have (on average 1.1780415430267062) internal successors, (397), 338 states have internal predecessors, (397), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 15:39:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 489 transitions. [2023-12-19 15:39:41,816 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 489 transitions. Word has length 152 [2023-12-19 15:39:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:39:41,816 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 489 transitions. [2023-12-19 15:39:41,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-19 15:39:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 489 transitions. [2023-12-19 15:39:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-19 15:39:41,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:39:41,817 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:41,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-19 15:39:41,817 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:39:41,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:39:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash 377530273, now seen corresponding path program 1 times [2023-12-19 15:39:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:39:41,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455505671] [2023-12-19 15:39:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:39:41,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:39:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:39:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:39:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:39:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:39:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:39:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:39:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:39:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:39:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:39:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:39:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:39:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:39:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:39:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:39:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:39:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:39:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:39:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 15:39:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:39:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-19 15:39:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:39:42,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455505671] [2023-12-19 15:39:42,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455505671] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:39:42,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:39:42,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 15:39:42,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695617852] [2023-12-19 15:39:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:39:42,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 15:39:42,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:39:42,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 15:39:42,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:39:42,482 INFO L87 Difference]: Start difference. First operand 408 states and 489 transitions. Second operand has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-19 15:39:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:39:43,024 INFO L93 Difference]: Finished difference Result 761 states and 905 transitions. [2023-12-19 15:39:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 15:39:43,024 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 152 [2023-12-19 15:39:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:39:43,026 INFO L225 Difference]: With dead ends: 761 [2023-12-19 15:39:43,026 INFO L226 Difference]: Without dead ends: 444 [2023-12-19 15:39:43,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2023-12-19 15:39:43,027 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 315 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:39:43,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1125 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:39:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-12-19 15:39:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 394. [2023-12-19 15:39:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 323 states have (on average 1.1702786377708978) internal successors, (378), 324 states have internal predecessors, (378), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 15:39:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 470 transitions. [2023-12-19 15:39:43,085 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 470 transitions. Word has length 152 [2023-12-19 15:39:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:39:43,085 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 470 transitions. [2023-12-19 15:39:43,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-19 15:39:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 470 transitions. [2023-12-19 15:39:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-19 15:39:43,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:39:43,086 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:43,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-19 15:39:43,087 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:39:43,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:39:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2081307115, now seen corresponding path program 1 times [2023-12-19 15:39:43,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:39:43,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022492586] [2023-12-19 15:39:43,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:39:43,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:39:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:39:43,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:39:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:39:43,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:39:43,292 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:39:43,293 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:39:43,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-19 15:39:43,296 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:39:43,298 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:39:43,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:39:43 BoogieIcfgContainer [2023-12-19 15:39:43,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:39:43,438 INFO L158 Benchmark]: Toolchain (without parser) took 78992.11ms. Allocated memory was 256.9MB in the beginning and 897.6MB in the end (delta: 640.7MB). Free memory was 201.1MB in the beginning and 364.0MB in the end (delta: -162.8MB). Peak memory consumption was 477.7MB. Max. memory is 8.0GB. [2023-12-19 15:39:43,438 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 213.9MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:39:43,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.13ms. Allocated memory is still 256.9MB. Free memory was 200.6MB in the beginning and 186.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 15:39:43,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.13ms. Allocated memory is still 256.9MB. Free memory was 186.0MB in the beginning and 182.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 15:39:43,438 INFO L158 Benchmark]: Boogie Preprocessor took 86.17ms. Allocated memory is still 256.9MB. Free memory was 182.3MB in the beginning and 176.5MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:39:43,438 INFO L158 Benchmark]: RCFGBuilder took 650.43ms. Allocated memory is still 256.9MB. Free memory was 176.5MB in the beginning and 204.8MB in the end (delta: -28.3MB). Peak memory consumption was 37.2MB. Max. memory is 8.0GB. [2023-12-19 15:39:43,438 INFO L158 Benchmark]: TraceAbstraction took 77731.09ms. Allocated memory was 256.9MB in the beginning and 897.6MB in the end (delta: 640.7MB). Free memory was 203.8MB in the beginning and 364.0MB in the end (delta: -160.2MB). Peak memory consumption was 480.3MB. Max. memory is 8.0GB. [2023-12-19 15:39:43,439 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.12ms. Allocated memory is still 213.9MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 409.13ms. Allocated memory is still 256.9MB. Free memory was 200.6MB in the beginning and 186.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 109.13ms. Allocated memory is still 256.9MB. Free memory was 186.0MB in the beginning and 182.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 86.17ms. Allocated memory is still 256.9MB. Free memory was 182.3MB in the beginning and 176.5MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 650.43ms. Allocated memory is still 256.9MB. Free memory was 176.5MB in the beginning and 204.8MB in the end (delta: -28.3MB). Peak memory consumption was 37.2MB. Max. memory is 8.0GB. * TraceAbstraction took 77731.09ms. Allocated memory was 256.9MB in the beginning and 897.6MB in the end (delta: 640.7MB). Free memory was 203.8MB in the beginning and 364.0MB in the end (delta: -160.2MB). Peak memory consumption was 480.3MB. 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 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned long int var_1_3 = 1456677701; [L24] unsigned long int var_1_3 = 1456677701; [L25] unsigned long int* var_1_3_Pointer = &(var_1_3); [L26] unsigned long int var_1_4 = 1000000000; [L26] unsigned long int var_1_4 = 1000000000; [L27] unsigned long int* var_1_4_Pointer = &(var_1_4); [L28] unsigned long int var_1_5 = 1; [L28] unsigned long int var_1_5 = 1; [L29] unsigned long int* var_1_5_Pointer = &(var_1_5); [L30] unsigned char var_1_6 = 0; [L30] unsigned char var_1_6 = 0; [L31] unsigned char* var_1_6_Pointer = &(var_1_6); [L32] unsigned char var_1_7 = 0; [L32] unsigned char var_1_7 = 0; [L33] unsigned char* var_1_7_Pointer = &(var_1_7); [L34] unsigned char var_1_8 = 0; [L34] unsigned char var_1_8 = 0; [L35] unsigned char* var_1_8_Pointer = &(var_1_8); [L36] double var_1_9 = 256.5; [L36] double var_1_9 = 256.5; [L37] double* var_1_9_Pointer = &(var_1_9); [L38] double var_1_10 = 8.8; [L38] double var_1_10 = 8.8; [L39] double* var_1_10_Pointer = &(var_1_10); [L40] unsigned char var_1_11 = 1; [L40] unsigned char var_1_11 = 1; [L41] unsigned char* var_1_11_Pointer = &(var_1_11); [L42] unsigned short int var_1_12 = 16; [L42] unsigned short int var_1_12 = 16; [L43] unsigned short int* var_1_12_Pointer = &(var_1_12); [L44] unsigned long int var_1_13 = 3110219175; [L44] unsigned long int var_1_13 = 3110219175; [L45] unsigned long int* var_1_13_Pointer = &(var_1_13); [L46] unsigned short int var_1_14 = 128; [L46] unsigned short int var_1_14 = 128; [L47] unsigned short int* var_1_14_Pointer = &(var_1_14); [L48] unsigned char var_1_15 = 1; [L48] unsigned char var_1_15 = 1; [L49] unsigned char* var_1_15_Pointer = &(var_1_15); [L50] unsigned char var_1_16 = 0; [L50] unsigned char var_1_16 = 0; [L51] unsigned char* var_1_16_Pointer = &(var_1_16); [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] FCALL updateLastVariables() [L122] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_ulong() [L83] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] var_1_4 = __VERIFIER_nondet_ulong() [L86] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] var_1_5 = __VERIFIER_nondet_ulong() [L89] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] var_1_9 = __VERIFIER_nondet_double() [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] var_1_10 = __VERIFIER_nondet_double() [L97] EXPR \read(var_1_10) [L97] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F [L97] EXPR \read(var_1_10) [L97] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] var_1_11 = __VERIFIER_nondet_uchar() [L99] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] var_1_13 = __VERIFIER_nondet_ulong() [L102] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L104] var_1_14 = __VERIFIER_nondet_ushort() [L105] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] var_1_16 = __VERIFIER_nondet_uchar() [L108] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] RET updateVariables() [L123] CALL step() [L55] EXPR \read(*var_1_7_Pointer) [L55] (*(var_1_6_Pointer)) = (*(var_1_7_Pointer)) [L56] EXPR \read(*var_1_5_Pointer) [L56] EXPR \read(*var_1_13_Pointer) [L56] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L56] COND TRUE (*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))) [L57] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L57] EXPR \read(*var_1_14_Pointer) [L57] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] (*(var_1_12_Pointer)) = (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))) [L59] EXPR \read(*var_1_9_Pointer) [L59] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L59] COND TRUE ((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer)) [L60] EXPR \read(*var_1_11_Pointer) [L60] (*(var_1_15_Pointer)) = (! (*(var_1_11_Pointer))) [L64] EXPR \read(*var_1_12_Pointer) [L64] EXPR \read(*var_1_3_Pointer) [L64] EXPR \read(*var_1_4_Pointer) [L64] EXPR \read(*var_1_12_Pointer) [L64] (*(var_1_1_Pointer)) = ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L65] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L65] signed long int stepLocal_1 = ((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer)))); [L66] EXPR \read(*var_1_3_Pointer) [L66] unsigned long int stepLocal_0 = (*(var_1_3_Pointer)); [L67] EXPR \read(*var_1_4_Pointer) [L67] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) [L67] EXPR \read(*var_1_4_Pointer) [L67] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, stepLocal_0=1073741824, stepLocal_1=65534, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] COND TRUE stepLocal_1 != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))))) [L68] EXPR \read(*var_1_9_Pointer) [L68] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L68] COND FALSE !((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR \read(*var_1_1_Pointer) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR \read(*var_1_3_Pointer) [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR ((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) [L114] EXPR \read(*var_1_6_Pointer) [L114] EXPR \read(*var_1_7_Pointer) [L114] EXPR ((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer))))) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR (((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) [L114] EXPR \read(*var_1_9_Pointer) [L114] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1 [L114] EXPR ((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1 VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1) [L114] EXPR \read(*var_1_5_Pointer) [L114] EXPR \read(*var_1_13_Pointer) [L114] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1 [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L114] EXPR \read(*var_1_14_Pointer) [L114] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1 VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR ((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) [L114] EXPR \read(*var_1_9_Pointer) [L114] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer))))) [L114] EXPR \read(*var_1_15_Pointer) [L114] EXPR \read(*var_1_11_Pointer) [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_16_Pointer)) [L114] EXPR \read(*var_1_16_Pointer) [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] EXPR (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114-L115] return (((((*(var_1_1_Pointer)) == ((unsigned long int) ((*(var_1_12_Pointer)) + ((*(var_1_3_Pointer)) - ((*(var_1_4_Pointer)) - (*(var_1_12_Pointer))))))) && ((*(var_1_6_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((((*(var_1_12_Pointer))) < ((*(var_1_12_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_12_Pointer))))) != (((((*(var_1_4_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_3_Pointer)))))) ? (((*(var_1_9_Pointer)) == (*(var_1_10_Pointer))) ? ((*(var_1_6_Pointer)) ? (((*(var_1_3_Pointer)) >= (*(var_1_12_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_7_Pointer)) || (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) : 1) : 1) : ((*(var_1_8_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))))) && (((*(var_1_5_Pointer)) <= ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))))))) : 1)) && ((((*(var_1_9_Pointer)) * 16.5f) > (*(var_1_10_Pointer))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (! (*(var_1_11_Pointer))))) : ((*(var_1_15_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) && (*(var_1_16_Pointer)))))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.5s, OverallIterations: 29, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8706 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8687 mSDsluCounter, 27905 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23667 mSDsCounter, 1280 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10199 IncrementalHoareTripleChecker+Invalid, 11479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1280 mSolverCounterUnsat, 4238 mSDtfsCounter, 10199 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2724 GetRequests, 2190 SyntacticMatches, 5 SemanticMatches, 529 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3722 ImplicationChecksByTransitivity, 20.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1002occurred in iteration=20, InterpolantAutomatonStates: 349, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 3000 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 20.4s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 4748 NumberOfCodeBlocks, 4748 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 5147 ConstructedInterpolants, 0 QuantifiedInterpolants, 41901 SizeOfPredicates, 69 NumberOfNonLiveVariables, 2701 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 36 InterpolantComputations, 24 PerfectInterpolantSequences, 20479/22032 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:39:43,473 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...