/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-55.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:38:30,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:38:31,084 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:31,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:38:31,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:38:31,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:38:31,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:38:31,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:38:31,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:38:31,121 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:38:31,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:38:31,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:38:31,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:38:31,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:38:31,124 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:38:31,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:38:31,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:38:31,124 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:38:31,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:38:31,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:38:31,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:38:31,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:38:31,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:38:31,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:38:31,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:38:31,127 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:38:31,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:38:31,127 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:38:31,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:38:31,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:38:31,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:38:31,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:38:31,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:38:31,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:38:31,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:38:31,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:38:31,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:38:31,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:38:31,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:38:31,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:38:31,131 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:38:31,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:38:31,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:38:31,132 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:31,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:38:31,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:38:31,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:38:31,360 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:38:31,362 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:38:31,363 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-55.i [2023-12-19 15:38:32,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:38:32,761 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:38:32,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-55.i [2023-12-19 15:38:32,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b206cf5c/72e044a862c142dd8cf296e86b1ccc4b/FLAGe2fa2ff49 [2023-12-19 15:38:32,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b206cf5c/72e044a862c142dd8cf296e86b1ccc4b [2023-12-19 15:38:32,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:38:32,789 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:38:32,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:38:32,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:38:32,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:38:32,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:38:32" (1/1) ... [2023-12-19 15:38:32,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ca5292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:32, skipping insertion in model container [2023-12-19 15:38:32,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:38:32" (1/1) ... [2023-12-19 15:38:32,838 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:38:32,965 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-55.i[916,929] [2023-12-19 15:38:33,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:38:33,022 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:38:33,031 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-55.i[916,929] [2023-12-19 15:38:33,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:38:33,084 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:38:33,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:33 WrapperNode [2023-12-19 15:38:33,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:38:33,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:38:33,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:38:33,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:38:33,091 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:33" (1/1) ... [2023-12-19 15:38:33,101 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:33" (1/1) ... [2023-12-19 15:38:33,141 INFO L138 Inliner]: procedures = 29, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2023-12-19 15:38:33,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:38:33,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:38:33,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:38:33,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:38:33,152 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:33" (1/1) ... [2023-12-19 15:38:33,152 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:33" (1/1) ... [2023-12-19 15:38:33,159 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:33" (1/1) ... [2023-12-19 15:38:33,186 INFO L175 MemorySlicer]: Split 108 memory accesses to 15 slices as follows [2, 19, 8, 6, 3, 10, 8, 8, 8, 6, 10, 3, 3, 8, 6]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2023-12-19 15:38:33,186 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:33" (1/1) ... [2023-12-19 15:38:33,187 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:33" (1/1) ... [2023-12-19 15:38:33,215 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:33" (1/1) ... [2023-12-19 15:38:33,219 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:33" (1/1) ... [2023-12-19 15:38:33,223 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:33" (1/1) ... [2023-12-19 15:38:33,226 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:33" (1/1) ... [2023-12-19 15:38:33,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:38:33,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:38:33,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:38:33,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:38:33,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:33" (1/1) ... [2023-12-19 15:38:33,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:38:33,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:38:33,273 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:33,302 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:33,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:38:33,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:38:33,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:38:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 15:38:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 15:38:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-19 15:38:33,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-19 15:38:33,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-19 15:38:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-19 15:38:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-19 15:38:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-19 15:38:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-19 15:38:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-19 15:38:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-19 15:38:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2023-12-19 15:38:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2023-12-19 15:38:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:38:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:38:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 15:38:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 15:38:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 15:38:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-19 15:38:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-19 15:38:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-19 15:38:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-19 15:38:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-19 15:38:33,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-19 15:38:33,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-19 15:38:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-19 15:38:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-19 15:38:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-19 15:38:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:38:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:38:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 15:38:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 15:38:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-19 15:38:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-19 15:38:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-19 15:38:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-19 15:38:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-19 15:38:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-19 15:38:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-19 15:38:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-19 15:38:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-19 15:38:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2023-12-19 15:38:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2023-12-19 15:38:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:38:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:38:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 15:38:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 15:38:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 15:38:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-19 15:38:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-19 15:38:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-19 15:38:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-19 15:38:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-19 15:38:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-19 15:38:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-19 15:38:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-19 15:38:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-19 15:38:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-19 15:38:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:38:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:38:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 15:38:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 15:38:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-19 15:38:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-19 15:38:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-19 15:38:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-19 15:38:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-19 15:38:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-19 15:38:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-19 15:38:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-19 15:38:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-19 15:38:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2023-12-19 15:38:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2023-12-19 15:38:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:38:33,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:38:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:38:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:38:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 15:38:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 15:38:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 15:38:33,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-19 15:38:33,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-19 15:38:33,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-19 15:38:33,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-19 15:38:33,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-19 15:38:33,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-19 15:38:33,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-19 15:38:33,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-19 15:38:33,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-19 15:38:33,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-19 15:38:33,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:38:33,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:38:33,524 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:38:33,525 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:38:33,952 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:38:33,996 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:38:33,996 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:38:33,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:38:33 BoogieIcfgContainer [2023-12-19 15:38:33,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:38:33,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:38:33,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:38:34,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:38:34,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:38:32" (1/3) ... [2023-12-19 15:38:34,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71308827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:38:34, skipping insertion in model container [2023-12-19 15:38:34,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:38:33" (2/3) ... [2023-12-19 15:38:34,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71308827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:38:34, skipping insertion in model container [2023-12-19 15:38:34,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:38:33" (3/3) ... [2023-12-19 15:38:34,004 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-55.i [2023-12-19 15:38:34,017 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:38:34,018 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:38:34,056 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:38:34,062 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;@6cebde2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:38:34,062 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:38:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 86 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:38:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:38:34,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:34,077 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:34,078 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:34,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1064270320, now seen corresponding path program 1 times [2023-12-19 15:38:34,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:34,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599534360] [2023-12-19 15:38:34,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:34,091 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,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:34,405 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 8 [2023-12-19 15:38:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:34,419 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 29 [2023-12-19 15:38:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:34,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:34,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599534360] [2023-12-19 15:38:34,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599534360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:34,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:34,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:38:34,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045106739] [2023-12-19 15:38:34,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:34,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:38:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:38:34,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:38:34,532 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 86 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:38:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:34,581 INFO L93 Difference]: Finished difference Result 197 states and 312 transitions. [2023-12-19 15:38:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:38:34,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-19 15:38:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:34,592 INFO L225 Difference]: With dead ends: 197 [2023-12-19 15:38:34,592 INFO L226 Difference]: Without dead ends: 98 [2023-12-19 15:38:34,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:38:34,598 INFO L413 NwaCegarLoop]: 142 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, 142 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:34,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 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:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-19 15:38:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-19 15:38:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:38:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2023-12-19 15:38:34,635 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 110 [2023-12-19 15:38:34,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:34,636 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2023-12-19 15:38:34,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:38:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2023-12-19 15:38:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:38:34,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:34,643 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:34,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:38:34,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:34,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:34,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1118529184, now seen corresponding path program 1 times [2023-12-19 15:38:34,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:34,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912548660] [2023-12-19 15:38:34,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:34,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:34,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912548660] [2023-12-19 15:38:34,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912548660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:34,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:34,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:38:34,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348262839] [2023-12-19 15:38:34,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:34,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:38:34,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:34,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:38:34,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:38:34,971 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:38:35,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:35,060 INFO L93 Difference]: Finished difference Result 201 states and 300 transitions. [2023-12-19 15:38:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:38:35,064 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-19 15:38:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:35,066 INFO L225 Difference]: With dead ends: 201 [2023-12-19 15:38:35,066 INFO L226 Difference]: Without dead ends: 104 [2023-12-19 15:38:35,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:35,068 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 10 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:35,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 415 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-19 15:38:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2023-12-19 15:38:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:38:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2023-12-19 15:38:35,079 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 110 [2023-12-19 15:38:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:35,079 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 148 transitions. [2023-12-19 15:38:35,080 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:38:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 148 transitions. [2023-12-19 15:38:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:38:35,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:35,087 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:35,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:38:35,087 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:35,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash -386561758, now seen corresponding path program 1 times [2023-12-19 15:38:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:35,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513123473] [2023-12-19 15:38:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:35,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:35,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513123473] [2023-12-19 15:38:35,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513123473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:35,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:35,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:38:35,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251575822] [2023-12-19 15:38:35,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:35,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:38:35,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:35,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:38:35,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:38:35,283 INFO L87 Difference]: Start difference. First operand 100 states and 148 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:35,346 INFO L93 Difference]: Finished difference Result 211 states and 312 transitions. [2023-12-19 15:38:35,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:38:35,346 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-19 15:38:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:35,348 INFO L225 Difference]: With dead ends: 211 [2023-12-19 15:38:35,348 INFO L226 Difference]: Without dead ends: 112 [2023-12-19 15:38:35,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:35,350 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 21 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:35,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 417 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-19 15:38:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2023-12-19 15:38:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:38:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2023-12-19 15:38:35,363 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 110 [2023-12-19 15:38:35,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:35,363 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2023-12-19 15:38:35,363 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2023-12-19 15:38:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:38:35,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:35,365 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:35,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:38:35,365 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:35,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:35,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1195908384, now seen corresponding path program 1 times [2023-12-19 15:38:35,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:35,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505951929] [2023-12-19 15:38:35,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:35,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505951929] [2023-12-19 15:38:35,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505951929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:35,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:35,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:38:35,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610253102] [2023-12-19 15:38:35,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:35,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:38:35,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:35,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:38:35,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:38:35,519 INFO L87 Difference]: Start difference. First operand 102 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:35,559 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2023-12-19 15:38:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:38:35,560 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-19 15:38:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:35,563 INFO L225 Difference]: With dead ends: 207 [2023-12-19 15:38:35,563 INFO L226 Difference]: Without dead ends: 106 [2023-12-19 15:38:35,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:35,572 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 3 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:35,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 415 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-19 15:38:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2023-12-19 15:38:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:38:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-12-19 15:38:35,586 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2023-12-19 15:38:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:35,587 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-12-19 15:38:35,587 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-12-19 15:38:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:38:35,588 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:35,588 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:35,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:38:35,588 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:35,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:35,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1195848802, now seen corresponding path program 1 times [2023-12-19 15:38:35,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:35,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560610616] [2023-12-19 15:38:35,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:35,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:35,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560610616] [2023-12-19 15:38:35,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560610616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:35,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:35,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:38:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327406284] [2023-12-19 15:38:35,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:35,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:38:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:38:35,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:38:35,735 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:35,759 INFO L93 Difference]: Finished difference Result 207 states and 303 transitions. [2023-12-19 15:38:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:38:35,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-19 15:38:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:35,760 INFO L225 Difference]: With dead ends: 207 [2023-12-19 15:38:35,760 INFO L226 Difference]: Without dead ends: 104 [2023-12-19 15:38:35,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:38:35,762 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:35,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 272 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-19 15:38:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-19 15:38:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 90 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:38:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2023-12-19 15:38:35,783 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 110 [2023-12-19 15:38:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:35,785 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2023-12-19 15:38:35,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2023-12-19 15:38:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 15:38:35,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:35,786 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:35,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:38:35,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:35,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash 129014341, now seen corresponding path program 1 times [2023-12-19 15:38:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:35,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161021776] [2023-12-19 15:38:35,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:35,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:36,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:36,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161021776] [2023-12-19 15:38:36,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161021776] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:36,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:36,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:38:36,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689750457] [2023-12-19 15:38:36,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:36,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:38:36,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:36,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:38:36,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:36,087 INFO L87 Difference]: Start difference. First operand 104 states and 151 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:36,250 INFO L93 Difference]: Finished difference Result 312 states and 453 transitions. [2023-12-19 15:38:36,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:38:36,251 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-19 15:38:36,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:36,252 INFO L225 Difference]: With dead ends: 312 [2023-12-19 15:38:36,252 INFO L226 Difference]: Without dead ends: 209 [2023-12-19 15:38:36,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:38:36,253 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 151 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:36,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 699 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:38:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-19 15:38:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2023-12-19 15:38:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 177 states have internal predecessors, (248), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:38:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 296 transitions. [2023-12-19 15:38:36,266 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 296 transitions. Word has length 112 [2023-12-19 15:38:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:36,267 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 296 transitions. [2023-12-19 15:38:36,267 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 296 transitions. [2023-12-19 15:38:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 15:38:36,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:36,269 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:36,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:38:36,269 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:36,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1817958083, now seen corresponding path program 1 times [2023-12-19 15:38:36,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:36,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782227096] [2023-12-19 15:38:36,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:36,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:36,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:36,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782227096] [2023-12-19 15:38:36,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782227096] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:36,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:36,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:38:36,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279279849] [2023-12-19 15:38:36,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:36,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:38:36,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:36,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:38:36,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:36,673 INFO L87 Difference]: Start difference. First operand 204 states and 296 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:36,864 INFO L93 Difference]: Finished difference Result 603 states and 872 transitions. [2023-12-19 15:38:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:38:36,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-19 15:38:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:36,867 INFO L225 Difference]: With dead ends: 603 [2023-12-19 15:38:36,867 INFO L226 Difference]: Without dead ends: 400 [2023-12-19 15:38:36,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:38:36,869 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 222 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:36,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 578 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:38:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-12-19 15:38:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 263. [2023-12-19 15:38:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 223 states have (on average 1.3946188340807175) internal successors, (311), 223 states have internal predecessors, (311), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:38:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 383 transitions. [2023-12-19 15:38:36,892 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 383 transitions. Word has length 112 [2023-12-19 15:38:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:36,893 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 383 transitions. [2023-12-19 15:38:36,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 383 transitions. [2023-12-19 15:38:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 15:38:36,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:36,894 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:36,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:38:36,894 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:36,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash 347869059, now seen corresponding path program 1 times [2023-12-19 15:38:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:36,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475348173] [2023-12-19 15:38:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475348173] [2023-12-19 15:38:37,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475348173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:37,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:37,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:38:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120646957] [2023-12-19 15:38:37,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:37,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:38:37,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:37,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:38:37,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:37,174 INFO L87 Difference]: Start difference. First operand 263 states and 383 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:37,230 INFO L93 Difference]: Finished difference Result 564 states and 815 transitions. [2023-12-19 15:38:37,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:38:37,230 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-19 15:38:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:37,232 INFO L225 Difference]: With dead ends: 564 [2023-12-19 15:38:37,232 INFO L226 Difference]: Without dead ends: 359 [2023-12-19 15:38:37,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:37,234 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 63 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:37,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 541 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-19 15:38:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 267. [2023-12-19 15:38:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 227 states have (on average 1.3876651982378854) internal successors, (315), 227 states have internal predecessors, (315), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:38:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 387 transitions. [2023-12-19 15:38:37,251 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 387 transitions. Word has length 112 [2023-12-19 15:38:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:37,251 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 387 transitions. [2023-12-19 15:38:37,252 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 387 transitions. [2023-12-19 15:38:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 15:38:37,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:37,253 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:37,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:38:37,253 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:37,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash 213855553, now seen corresponding path program 1 times [2023-12-19 15:38:37,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:37,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028840969] [2023-12-19 15:38:37,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:37,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:37,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028840969] [2023-12-19 15:38:37,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028840969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:37,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:37,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:38:37,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139910867] [2023-12-19 15:38:37,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:37,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:38:37,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:37,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:38:37,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:37,771 INFO L87 Difference]: Start difference. First operand 267 states and 387 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:37,930 INFO L93 Difference]: Finished difference Result 616 states and 887 transitions. [2023-12-19 15:38:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:38:37,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-19 15:38:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:37,933 INFO L225 Difference]: With dead ends: 616 [2023-12-19 15:38:37,933 INFO L226 Difference]: Without dead ends: 411 [2023-12-19 15:38:37,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:38:37,934 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 125 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:37,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 723 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:38:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-19 15:38:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 293. [2023-12-19 15:38:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 253 states have (on average 1.3794466403162056) internal successors, (349), 253 states have internal predecessors, (349), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 15:38:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 421 transitions. [2023-12-19 15:38:37,946 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 421 transitions. Word has length 112 [2023-12-19 15:38:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:37,947 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 421 transitions. [2023-12-19 15:38:37,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 421 transitions. [2023-12-19 15:38:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:38:37,948 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:37,948 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:37,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 15:38:37,948 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:37,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash -258810007, now seen corresponding path program 1 times [2023-12-19 15:38:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:37,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239635231] [2023-12-19 15:38:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:38,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:38,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239635231] [2023-12-19 15:38:38,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239635231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:38,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:38,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:38:38,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159031452] [2023-12-19 15:38:38,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:38,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:38:38,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:38,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:38:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:38:38,152 INFO L87 Difference]: Start difference. First operand 293 states and 421 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:38,228 INFO L93 Difference]: Finished difference Result 625 states and 900 transitions. [2023-12-19 15:38:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:38:38,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:38:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:38,230 INFO L225 Difference]: With dead ends: 625 [2023-12-19 15:38:38,230 INFO L226 Difference]: Without dead ends: 396 [2023-12-19 15:38:38,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:38,232 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 104 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:38,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 421 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:38:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-12-19 15:38:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2023-12-19 15:38:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 340 states have (on average 1.3852941176470588) internal successors, (471), 340 states have internal predecessors, (471), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 15:38:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 567 transitions. [2023-12-19 15:38:38,245 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 567 transitions. Word has length 114 [2023-12-19 15:38:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:38,245 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 567 transitions. [2023-12-19 15:38:38,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 567 transitions. [2023-12-19 15:38:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:38:38,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:38,247 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:38,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 15:38:38,247 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:38,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:38,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1728899031, now seen corresponding path program 1 times [2023-12-19 15:38:38,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:38,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171885544] [2023-12-19 15:38:38,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:38,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171885544] [2023-12-19 15:38:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171885544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:38,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:38,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:38:38,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55085458] [2023-12-19 15:38:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:38,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:38:38,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:38,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:38:38,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:38,510 INFO L87 Difference]: Start difference. First operand 393 states and 567 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:38,685 INFO L93 Difference]: Finished difference Result 1172 states and 1690 transitions. [2023-12-19 15:38:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:38:38,686 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:38:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:38,690 INFO L225 Difference]: With dead ends: 1172 [2023-12-19 15:38:38,690 INFO L226 Difference]: Without dead ends: 837 [2023-12-19 15:38:38,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:38:38,692 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 225 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:38,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 799 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:38:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2023-12-19 15:38:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 734. [2023-12-19 15:38:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 642 states have (on average 1.3769470404984423) internal successors, (884), 642 states have internal predecessors, (884), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:38:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1052 transitions. [2023-12-19 15:38:38,739 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1052 transitions. Word has length 114 [2023-12-19 15:38:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:38,739 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1052 transitions. [2023-12-19 15:38:38,740 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1052 transitions. [2023-12-19 15:38:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:38:38,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:38,741 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:38,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 15:38:38,742 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:38,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:38,742 INFO L85 PathProgramCache]: Analyzing trace with hash 194329003, now seen corresponding path program 1 times [2023-12-19 15:38:38,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:38,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099501343] [2023-12-19 15:38:38,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:38,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:39,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:39,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099501343] [2023-12-19 15:38:39,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099501343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:39,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:39,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:38:39,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282940388] [2023-12-19 15:38:39,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:39,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:38:39,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:39,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:38:39,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:39,010 INFO L87 Difference]: Start difference. First operand 734 states and 1052 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:39,085 INFO L93 Difference]: Finished difference Result 1651 states and 2364 transitions. [2023-12-19 15:38:39,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:38:39,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:38:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:39,089 INFO L225 Difference]: With dead ends: 1651 [2023-12-19 15:38:39,090 INFO L226 Difference]: Without dead ends: 974 [2023-12-19 15:38:39,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:39,091 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 97 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:39,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 752 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2023-12-19 15:38:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 734. [2023-12-19 15:38:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 642 states have (on average 1.3629283489096573) internal successors, (875), 642 states have internal predecessors, (875), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:38:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1043 transitions. [2023-12-19 15:38:39,125 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1043 transitions. Word has length 114 [2023-12-19 15:38:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:39,125 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1043 transitions. [2023-12-19 15:38:39,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1043 transitions. [2023-12-19 15:38:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:38:39,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:39,127 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:39,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 15:38:39,127 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:39,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1024123046, now seen corresponding path program 1 times [2023-12-19 15:38:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:39,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762522057] [2023-12-19 15:38:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:39,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:39,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762522057] [2023-12-19 15:38:39,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762522057] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:39,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:39,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:38:39,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707031408] [2023-12-19 15:38:39,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:39,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:38:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:39,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:38:39,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:39,334 INFO L87 Difference]: Start difference. First operand 734 states and 1043 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:39,396 INFO L93 Difference]: Finished difference Result 1575 states and 2231 transitions. [2023-12-19 15:38:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:38:39,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:38:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:39,400 INFO L225 Difference]: With dead ends: 1575 [2023-12-19 15:38:39,400 INFO L226 Difference]: Without dead ends: 1104 [2023-12-19 15:38:39,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:39,401 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 131 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:39,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 564 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2023-12-19 15:38:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 772. [2023-12-19 15:38:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 680 states have (on average 1.3691176470588236) internal successors, (931), 680 states have internal predecessors, (931), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:38:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1099 transitions. [2023-12-19 15:38:39,455 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1099 transitions. Word has length 114 [2023-12-19 15:38:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:39,455 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 1099 transitions. [2023-12-19 15:38:39,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1099 transitions. [2023-12-19 15:38:39,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:38:39,456 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:39,457 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:39,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 15:38:39,457 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:39,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash 437317032, now seen corresponding path program 1 times [2023-12-19 15:38:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:39,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496217790] [2023-12-19 15:38:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:39,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:39,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496217790] [2023-12-19 15:38:39,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496217790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:39,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:39,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:38:39,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230758808] [2023-12-19 15:38:39,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:39,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:38:39,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:39,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:38:39,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:39,622 INFO L87 Difference]: Start difference. First operand 772 states and 1099 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:39,684 INFO L93 Difference]: Finished difference Result 1613 states and 2297 transitions. [2023-12-19 15:38:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:38:39,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:38:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:39,688 INFO L225 Difference]: With dead ends: 1613 [2023-12-19 15:38:39,688 INFO L226 Difference]: Without dead ends: 898 [2023-12-19 15:38:39,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:38:39,689 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 80 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:39,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 544 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2023-12-19 15:38:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 790. [2023-12-19 15:38:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 698 states have (on average 1.359598853868195) internal successors, (949), 698 states have internal predecessors, (949), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:38:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1117 transitions. [2023-12-19 15:38:39,722 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1117 transitions. Word has length 114 [2023-12-19 15:38:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:39,722 INFO L495 AbstractCegarLoop]: Abstraction has 790 states and 1117 transitions. [2023-12-19 15:38:39,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1117 transitions. [2023-12-19 15:38:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 15:38:39,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:39,724 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:39,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 15:38:39,724 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:39,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1075260272, now seen corresponding path program 1 times [2023-12-19 15:38:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:39,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993372521] [2023-12-19 15:38:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:39,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:39,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993372521] [2023-12-19 15:38:39,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993372521] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:39,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:39,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:38:39,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893960713] [2023-12-19 15:38:39,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:39,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:38:39,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:39,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:38:39,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:38:39,869 INFO L87 Difference]: Start difference. First operand 790 states and 1117 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:39,934 INFO L93 Difference]: Finished difference Result 1719 states and 2419 transitions. [2023-12-19 15:38:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:38:39,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-19 15:38:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:39,938 INFO L225 Difference]: With dead ends: 1719 [2023-12-19 15:38:39,938 INFO L226 Difference]: Without dead ends: 986 [2023-12-19 15:38:39,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:38:39,941 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 66 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:39,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 599 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2023-12-19 15:38:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 812. [2023-12-19 15:38:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 720 states have (on average 1.3486111111111112) internal successors, (971), 720 states have internal predecessors, (971), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:38:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1139 transitions. [2023-12-19 15:38:39,979 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1139 transitions. Word has length 115 [2023-12-19 15:38:39,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:39,979 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1139 transitions. [2023-12-19 15:38:39,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1139 transitions. [2023-12-19 15:38:39,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 15:38:39,981 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:39,981 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:39,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 15:38:39,981 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:39,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:39,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1465736233, now seen corresponding path program 1 times [2023-12-19 15:38:39,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:39,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282652998] [2023-12-19 15:38:39,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:39,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282652998] [2023-12-19 15:38:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282652998] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:40,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:38:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604759256] [2023-12-19 15:38:40,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:40,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:38:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:40,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:38:40,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:38:40,141 INFO L87 Difference]: Start difference. First operand 812 states and 1139 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:40,193 INFO L93 Difference]: Finished difference Result 1874 states and 2611 transitions. [2023-12-19 15:38:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:38:40,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-19 15:38:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:40,198 INFO L225 Difference]: With dead ends: 1874 [2023-12-19 15:38:40,198 INFO L226 Difference]: Without dead ends: 1109 [2023-12-19 15:38:40,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:38:40,200 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 117 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:40,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 314 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:38:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2023-12-19 15:38:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 782. [2023-12-19 15:38:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 690 states have (on average 1.3347826086956522) internal successors, (921), 690 states have internal predecessors, (921), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:38:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1089 transitions. [2023-12-19 15:38:40,234 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1089 transitions. Word has length 117 [2023-12-19 15:38:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:40,235 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1089 transitions. [2023-12-19 15:38:40,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1089 transitions. [2023-12-19 15:38:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 15:38:40,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:40,236 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:40,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 15:38:40,236 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:40,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:40,237 INFO L85 PathProgramCache]: Analyzing trace with hash 5190891, now seen corresponding path program 1 times [2023-12-19 15:38:40,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:40,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018072923] [2023-12-19 15:38:40,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:40,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:38:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:38:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:38:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:38:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:38:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:38:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:38:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:38:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:38:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:38:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:38:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:38:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:38:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:38:40,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:38:40,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018072923] [2023-12-19 15:38:40,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018072923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:38:40,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:38:40,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:38:40,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754487467] [2023-12-19 15:38:40,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:38:40,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:38:40,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:38:40,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:38:40,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:38:40,412 INFO L87 Difference]: Start difference. First operand 782 states and 1089 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:38:40,551 INFO L93 Difference]: Finished difference Result 1806 states and 2494 transitions. [2023-12-19 15:38:40,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:38:40,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-12-19 15:38:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:38:40,556 INFO L225 Difference]: With dead ends: 1806 [2023-12-19 15:38:40,556 INFO L226 Difference]: Without dead ends: 1081 [2023-12-19 15:38:40,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:38:40,558 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 278 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:38:40,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 859 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:38:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2023-12-19 15:38:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 782. [2023-12-19 15:38:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 690 states have (on average 1.3202898550724638) internal successors, (911), 690 states have internal predecessors, (911), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-19 15:38:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1079 transitions. [2023-12-19 15:38:40,592 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1079 transitions. Word has length 119 [2023-12-19 15:38:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:38:40,592 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1079 transitions. [2023-12-19 15:38:40,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:38:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1079 transitions. [2023-12-19 15:38:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 15:38:40,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:38:40,594 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:40,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 15:38:40,594 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:38:40,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:38:40,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1988953815, now seen corresponding path program 1 times [2023-12-19 15:38:40,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:38:40,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578238002] [2023-12-19 15:38:40,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:38:40,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:38:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:38:40,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:38:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:38:40,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:38:40,781 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:38:40,782 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:38:40,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 15:38:40,786 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:38:40,789 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:38:40,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:38:40 BoogieIcfgContainer [2023-12-19 15:38:40,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:38:40,952 INFO L158 Benchmark]: Toolchain (without parser) took 8162.98ms. Allocated memory was 281.0MB in the beginning and 405.8MB in the end (delta: 124.8MB). Free memory was 235.2MB in the beginning and 144.9MB in the end (delta: 90.2MB). Peak memory consumption was 216.6MB. Max. memory is 8.0GB. [2023-12-19 15:38:40,953 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:38:40,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.92ms. Allocated memory is still 281.0MB. Free memory was 235.2MB in the beginning and 221.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 15:38:40,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.79ms. Allocated memory is still 281.0MB. Free memory was 221.0MB in the beginning and 217.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 15:38:40,954 INFO L158 Benchmark]: Boogie Preprocessor took 89.85ms. Allocated memory is still 281.0MB. Free memory was 216.8MB in the beginning and 211.0MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:38:40,954 INFO L158 Benchmark]: RCFGBuilder took 763.67ms. Allocated memory is still 281.0MB. Free memory was 211.0MB in the beginning and 170.7MB in the end (delta: 40.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2023-12-19 15:38:40,954 INFO L158 Benchmark]: TraceAbstraction took 6952.48ms. Allocated memory was 281.0MB in the beginning and 405.8MB in the end (delta: 124.8MB). Free memory was 169.6MB in the beginning and 144.9MB in the end (delta: 24.7MB). Peak memory consumption was 150.5MB. Max. memory is 8.0GB. [2023-12-19 15:38:40,957 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 187.7MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 294.92ms. Allocated memory is still 281.0MB. Free memory was 235.2MB in the beginning and 221.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.79ms. Allocated memory is still 281.0MB. Free memory was 221.0MB in the beginning and 217.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 89.85ms. Allocated memory is still 281.0MB. Free memory was 216.8MB in the beginning and 211.0MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 763.67ms. Allocated memory is still 281.0MB. Free memory was 211.0MB in the beginning and 170.7MB in the end (delta: 40.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 6952.48ms. Allocated memory was 281.0MB in the beginning and 405.8MB in the end (delta: 124.8MB). Free memory was 169.6MB in the beginning and 144.9MB in the end (delta: 24.7MB). Peak memory consumption was 150.5MB. 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 111, overapproximation of shiftRight at line 74, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L22] unsigned short int var_1_1 = 10; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned char var_1_5 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] double var_1_7 = 256.75; [L28] double var_1_7 = 256.75; [L29] double* var_1_7_Pointer = &(var_1_7); [L30] double var_1_8 = 63.5; [L30] double var_1_8 = 63.5; [L31] double* var_1_8_Pointer = &(var_1_8); [L32] double var_1_9 = 1.8; [L32] double var_1_9 = 1.8; [L33] double* var_1_9_Pointer = &(var_1_9); [L34] double var_1_10 = 0.25; [L34] double var_1_10 = 0.25; [L35] double* var_1_10_Pointer = &(var_1_10); [L36] double var_1_11 = 16.5; [L36] double var_1_11 = 16.5; [L37] double* var_1_11_Pointer = &(var_1_11); [L38] signed long int var_1_12 = -5; [L38] signed long int var_1_12 = -5; [L39] signed long int* var_1_12_Pointer = &(var_1_12); [L40] unsigned char var_1_14 = 128; [L40] unsigned char var_1_14 = 128; [L41] unsigned char* var_1_14_Pointer = &(var_1_14); [L42] float var_1_15 = 4.6; [L42] float var_1_15 = 4.6; [L43] float* var_1_15_Pointer = &(var_1_15); [L44] unsigned long int var_1_16 = 500; [L44] unsigned long int var_1_16 = 500; [L45] unsigned long int* var_1_16_Pointer = &(var_1_16); [L46] unsigned char var_1_17 = 2; [L46] unsigned char var_1_17 = 2; [L47] unsigned char* var_1_17_Pointer = &(var_1_17); [L48] unsigned char var_1_18 = 100; [L48] unsigned char var_1_18 = 100; [L49] unsigned char* var_1_18_Pointer = &(var_1_18); [L50] signed long int last_1_var_1_12 = -5; [L51] unsigned char last_1_var_1_17 = 2; [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L107] EXPR \read(var_1_12) [L107] last_1_var_1_12 = var_1_12 [L108] EXPR \read(var_1_17) [L108] last_1_var_1_17 = var_1_17 [L118] RET updateLastVariables() [L119] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] var_1_5 = __VERIFIER_nondet_uchar() [L89] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] var_1_8 = __VERIFIER_nondet_double() [L92] EXPR \read(var_1_8) [L92] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F [L92] EXPR \read(var_1_8) [L92] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR (var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR (var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] var_1_9 = __VERIFIER_nondet_double() [L94] EXPR \read(var_1_9) [L94] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F [L94] EXPR \read(var_1_9) [L94] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] EXPR (var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] EXPR (var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] var_1_10 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_10) [L96] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F [L96] EXPR \read(var_1_10) [L96] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] var_1_11 = __VERIFIER_nondet_double() [L98] EXPR \read(var_1_11) [L98] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F [L98] EXPR \read(var_1_11) [L98] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] var_1_14 = __VERIFIER_nondet_uchar() [L100] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] var_1_18 = __VERIFIER_nondet_uchar() [L103] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] RET updateVariables() [L120] CALL step() [L55] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L56] signed long int stepLocal_0 = last_1_var_1_17; [L57] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L57] COND TRUE (*(var_1_2_Pointer)) [L58] stepLocal_1 && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L58] stepLocal_1 && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L58] COND FALSE !(stepLocal_1 && (*(var_1_5_Pointer))) [L68] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L68] COND TRUE (*(var_1_2_Pointer)) [L69] EXPR \read(*var_1_8_Pointer) [L69] EXPR \read(*var_1_9_Pointer) [L69] EXPR \read(*var_1_10_Pointer) [L69] EXPR \read(*var_1_11_Pointer) [L69] (*(var_1_7_Pointer)) = ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))) [L71] EXPR \read(*var_1_8_Pointer) [L71] (*(var_1_15_Pointer)) = (*(var_1_8_Pointer)) [L72] EXPR \read(*var_1_14_Pointer) [L72] (*(var_1_16_Pointer)) = (*(var_1_14_Pointer)) [L73] EXPR \read(*var_1_18_Pointer) [L73] (*(var_1_17_Pointer)) = (*(var_1_18_Pointer)) [L74] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] EXPR -4 >> (*(var_1_1_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] EXPR (((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer))) [L74] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] EXPR -4 >> (*(var_1_1_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] EXPR (((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L74] signed long int stepLocal_3 = ((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))); [L75] EXPR \read(*var_1_1_Pointer) [L75] signed long int stepLocal_2 = (*(var_1_1_Pointer)) / -8; [L76] EXPR \read(*var_1_17_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] COND FALSE !((~ (*(var_1_17_Pointer))) <= stepLocal_3) [L81] EXPR \read(*var_1_17_Pointer) [L81] EXPR \read(*var_1_14_Pointer) [L81] (*(var_1_12_Pointer)) = ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17)) [L111] EXPR (last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1 [L111] EXPR ((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1) [L111] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1 [L111] EXPR \read(*var_1_7_Pointer) [L111] EXPR \read(*var_1_8_Pointer) [L111] EXPR \read(*var_1_9_Pointer) [L111] EXPR \read(*var_1_10_Pointer) [L111] EXPR \read(*var_1_11_Pointer) [L111] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer))))) && ((*(var_1_16_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR (((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer))))) && ((*(var_1_16_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer))))) && ((*(var_1_16_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR ((((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer))))) && ((*(var_1_16_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111-L112] return ((((((*(var_1_2_Pointer)) ? (((last_1_var_1_12 >= last_1_var_1_17) && (*(var_1_5_Pointer))) ? ((last_1_var_1_12 >= last_1_var_1_17) ? ((*(var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_17))) && ((*(var_1_2_Pointer)) ? ((*(var_1_7_Pointer)) == ((double) ((((*(var_1_8_Pointer)) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) - (*(var_1_11_Pointer))))) : 1)) && (((~ (*(var_1_17_Pointer))) <= (((((-4 >> (*(var_1_1_Pointer)))) < ((*(var_1_1_Pointer)))) ? ((-4 >> (*(var_1_1_Pointer)))) : ((*(var_1_1_Pointer)))))) ? ((((*(var_1_14_Pointer)) - 64) < ((*(var_1_1_Pointer)) / -8)) ? ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_1_Pointer)))) : 1) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_17_Pointer)) - (*(var_1_14_Pointer))))))) && ((*(var_1_15_Pointer)) == ((float) (*(var_1_8_Pointer))))) && ((*(var_1_16_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 18, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1698 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1697 mSDsluCounter, 9054 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6360 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 926 IncrementalHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 2694 mSDtfsCounter, 926 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 530 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=812occurred in iteration=15, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 1954 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2038 NumberOfCodeBlocks, 2038 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1902 ConstructedInterpolants, 0 QuantifiedInterpolants, 3458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 4488/4488 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:38:40,988 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...