/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:36:48,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:36:48,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:36:48,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:36:48,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:36:48,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:36:48,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:36:48,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:36:48,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:36:48,498 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:36:48,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:36:48,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:36:48,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:36:48,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:36:48,504 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:36:48,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:36:48,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:36:48,505 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:36:48,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:36:48,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:36:48,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:36:48,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:36:48,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:36:48,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:36:48,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:36:48,507 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:36:48,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:36:48,508 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:36:48,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:36:48,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:36:48,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:36:48,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:36:48,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:36:48,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:36:48,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:36:48,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:36:48,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:36:48,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:36:48,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:36:48,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:36:48,510 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:36:48,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:36:48,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:36:48,510 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:36:48,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:36:48,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:36:48,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:36:48,748 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:36:48,749 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:36:48,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i [2023-12-15 21:36:49,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:36:49,986 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:36:49,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i [2023-12-15 21:36:49,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a29e60d/72971260a8d7478f8259d1fad6c0ef9b/FLAG3026316a2 [2023-12-15 21:36:50,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a29e60d/72971260a8d7478f8259d1fad6c0ef9b [2023-12-15 21:36:50,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:36:50,014 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:36:50,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:36:50,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:36:50,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:36:50,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406713a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50, skipping insertion in model container [2023-12-15 21:36:50,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,043 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:36:50,154 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i[915,928] [2023-12-15 21:36:50,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:36:50,210 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:36:50,217 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i[915,928] [2023-12-15 21:36:50,259 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:36:50,280 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:36:50,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50 WrapperNode [2023-12-15 21:36:50,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:36:50,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:36:50,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:36:50,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:36:50,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,328 INFO L138 Inliner]: procedures = 29, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 665 [2023-12-15 21:36:50,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:36:50,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:36:50,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:36:50,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:36:50,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,364 INFO L175 MemorySlicer]: Split 151 memory accesses to 15 slices as follows [2, 5, 8, 10, 5, 10, 8, 12, 8, 8, 5, 14, 14, 12, 30]. 20 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1]. [2023-12-15 21:36:50,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:36:50,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:36:50,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:36:50,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:36:50,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (1/1) ... [2023-12-15 21:36:50,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:36:50,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:50,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:36:50,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:36:50,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:36:50,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:36:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:36:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:36:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:36:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:36:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:36:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-15 21:36:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-15 21:36:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-15 21:36:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-15 21:36:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-15 21:36:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-15 21:36:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-15 21:36:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2023-12-15 21:36:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2023-12-15 21:36:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:36:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:36:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:36:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:36:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:36:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:36:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-15 21:36:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-15 21:36:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-15 21:36:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-15 21:36:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-15 21:36:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-15 21:36:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-15 21:36:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-15 21:36:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-15 21:36:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2023-12-15 21:36:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2023-12-15 21:36:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:36:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:36:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:36:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:36:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:36:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:36:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:36:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-15 21:36:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-15 21:36:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-15 21:36:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-15 21:36:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-15 21:36:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-15 21:36:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-15 21:36:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2023-12-15 21:36:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2023-12-15 21:36:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:36:50,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:36:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:36:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:36:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:36:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:36:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:36:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:36:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-15 21:36:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-15 21:36:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-15 21:36:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-15 21:36:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-15 21:36:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-15 21:36:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-15 21:36:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-15 21:36:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-15 21:36:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:36:50,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:36:50,718 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:36:50,719 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:36:51,156 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:36:51,182 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:36:51,182 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:36:51,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:36:51 BoogieIcfgContainer [2023-12-15 21:36:51,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:36:51,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:36:51,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:36:51,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:36:51,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:36:50" (1/3) ... [2023-12-15 21:36:51,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5187344e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:36:51, skipping insertion in model container [2023-12-15 21:36:51,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:50" (2/3) ... [2023-12-15 21:36:51,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5187344e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:36:51, skipping insertion in model container [2023-12-15 21:36:51,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:36:51" (3/3) ... [2023-12-15 21:36:51,187 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-3.i [2023-12-15 21:36:51,199 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:36:51,199 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:36:51,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:36:51,234 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;@234290a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:36:51,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:36:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:36:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-15 21:36:51,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:51,249 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:51,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:51,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash 941451293, now seen corresponding path program 1 times [2023-12-15 21:36:51,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:51,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406352037] [2023-12-15 21:36:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:51,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:51,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:51,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406352037] [2023-12-15 21:36:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406352037] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:51,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:51,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:36:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648244115] [2023-12-15 21:36:51,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:51,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:36:51,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:51,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:36:51,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:36:51,664 INFO L87 Difference]: Start difference. First operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 21:36:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:51,721 INFO L93 Difference]: Finished difference Result 281 states and 444 transitions. [2023-12-15 21:36:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:36:51,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-12-15 21:36:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:51,733 INFO L225 Difference]: With dead ends: 281 [2023-12-15 21:36:51,733 INFO L226 Difference]: Without dead ends: 140 [2023-12-15 21:36:51,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:36:51,740 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:51,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-15 21:36:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-12-15 21:36:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.459016393442623) internal successors, (178), 122 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:36:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 210 transitions. [2023-12-15 21:36:51,777 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 210 transitions. Word has length 128 [2023-12-15 21:36:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:51,778 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 210 transitions. [2023-12-15 21:36:51,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 21:36:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 210 transitions. [2023-12-15 21:36:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-15 21:36:51,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:51,780 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:51,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:36:51,781 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:51,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash 488259973, now seen corresponding path program 1 times [2023-12-15 21:36:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896620144] [2023-12-15 21:36:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:51,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:52,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:52,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896620144] [2023-12-15 21:36:52,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896620144] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:52,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:52,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:36:52,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382313559] [2023-12-15 21:36:52,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:52,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:36:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:52,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:36:52,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:36:52,151 INFO L87 Difference]: Start difference. First operand 140 states and 210 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 21:36:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:52,219 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2023-12-15 21:36:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:36:52,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-12-15 21:36:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:52,222 INFO L225 Difference]: With dead ends: 285 [2023-12-15 21:36:52,222 INFO L226 Difference]: Without dead ends: 146 [2023-12-15 21:36:52,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:52,226 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 10 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:52,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 610 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-15 21:36:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-12-15 21:36:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 124 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:36:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2023-12-15 21:36:52,240 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 128 [2023-12-15 21:36:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:52,241 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2023-12-15 21:36:52,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 21:36:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2023-12-15 21:36:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-15 21:36:52,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:52,243 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:52,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:36:52,243 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:52,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash 882626759, now seen corresponding path program 1 times [2023-12-15 21:36:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:52,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670586899] [2023-12-15 21:36:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:52,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:52,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670586899] [2023-12-15 21:36:52,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670586899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:52,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:52,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:36:52,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903250141] [2023-12-15 21:36:52,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:52,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:36:52,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:52,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:36:52,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:36:52,488 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:52,526 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2023-12-15 21:36:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:36:52,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-12-15 21:36:52,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:52,529 INFO L225 Difference]: With dead ends: 321 [2023-12-15 21:36:52,529 INFO L226 Difference]: Without dead ends: 180 [2023-12-15 21:36:52,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:52,532 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 67 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:52,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 696 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-15 21:36:52,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2023-12-15 21:36:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:36:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2023-12-15 21:36:52,553 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 128 [2023-12-15 21:36:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:52,554 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2023-12-15 21:36:52,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:52,555 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2023-12-15 21:36:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-15 21:36:52,558 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:52,558 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:52,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:36:52,558 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:52,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1535191051, now seen corresponding path program 1 times [2023-12-15 21:36:52,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:52,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156693596] [2023-12-15 21:36:52,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:52,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:52,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156693596] [2023-12-15 21:36:52,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156693596] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:52,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:52,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:36:52,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830048336] [2023-12-15 21:36:52,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:52,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:36:52,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:36:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:36:52,701 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:52,723 INFO L93 Difference]: Finished difference Result 363 states and 541 transitions. [2023-12-15 21:36:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:36:52,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-12-15 21:36:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:52,724 INFO L225 Difference]: With dead ends: 363 [2023-12-15 21:36:52,724 INFO L226 Difference]: Without dead ends: 220 [2023-12-15 21:36:52,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:36:52,725 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 111 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:52,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 399 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-15 21:36:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 176. [2023-12-15 21:36:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 158 states have internal predecessors, (231), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:36:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 263 transitions. [2023-12-15 21:36:52,730 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 263 transitions. Word has length 130 [2023-12-15 21:36:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:52,730 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 263 transitions. [2023-12-15 21:36:52,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 263 transitions. [2023-12-15 21:36:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-15 21:36:52,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:52,732 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:52,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:36:52,732 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:52,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash -187713908, now seen corresponding path program 1 times [2023-12-15 21:36:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:52,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162360738] [2023-12-15 21:36:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:52,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:52,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162360738] [2023-12-15 21:36:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162360738] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:52,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:52,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277924783] [2023-12-15 21:36:52,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:52,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:52,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:52,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:52,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:52,937 INFO L87 Difference]: Start difference. First operand 176 states and 263 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:52,996 INFO L93 Difference]: Finished difference Result 526 states and 787 transitions. [2023-12-15 21:36:52,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:36:52,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-12-15 21:36:52,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:52,998 INFO L225 Difference]: With dead ends: 526 [2023-12-15 21:36:52,998 INFO L226 Difference]: Without dead ends: 351 [2023-12-15 21:36:52,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:36:52,999 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 348 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:52,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 801 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-12-15 21:36:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 343. [2023-12-15 21:36:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 308 states have (on average 1.4545454545454546) internal successors, (448), 308 states have internal predecessors, (448), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 21:36:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 512 transitions. [2023-12-15 21:36:53,009 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 512 transitions. Word has length 130 [2023-12-15 21:36:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:53,009 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 512 transitions. [2023-12-15 21:36:53,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 512 transitions. [2023-12-15 21:36:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-15 21:36:53,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:53,011 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:53,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:36:53,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:53,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash -239013210, now seen corresponding path program 1 times [2023-12-15 21:36:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:53,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217279212] [2023-12-15 21:36:53,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217279212] [2023-12-15 21:36:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217279212] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:53,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:53,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:36:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392053736] [2023-12-15 21:36:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:53,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:36:53,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:53,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:36:53,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:36:53,336 INFO L87 Difference]: Start difference. First operand 343 states and 512 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:53,426 INFO L93 Difference]: Finished difference Result 658 states and 981 transitions. [2023-12-15 21:36:53,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:36:53,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-12-15 21:36:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:53,429 INFO L225 Difference]: With dead ends: 658 [2023-12-15 21:36:53,429 INFO L226 Difference]: Without dead ends: 483 [2023-12-15 21:36:53,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:36:53,430 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 247 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:53,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1287 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-12-15 21:36:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 450. [2023-12-15 21:36:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 411 states have internal predecessors, (598), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 21:36:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 670 transitions. [2023-12-15 21:36:53,442 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 670 transitions. Word has length 131 [2023-12-15 21:36:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:53,442 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 670 transitions. [2023-12-15 21:36:53,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 670 transitions. [2023-12-15 21:36:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-15 21:36:53,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:53,443 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:53,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:36:53,443 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:53,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:53,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2080596326, now seen corresponding path program 1 times [2023-12-15 21:36:53,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:53,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102340973] [2023-12-15 21:36:53,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:53,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:53,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:53,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102340973] [2023-12-15 21:36:53,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102340973] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:53,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:53,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:36:53,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188960392] [2023-12-15 21:36:53,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:53,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:36:53,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:53,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:36:53,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:36:53,687 INFO L87 Difference]: Start difference. First operand 450 states and 670 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:53,815 INFO L93 Difference]: Finished difference Result 939 states and 1399 transitions. [2023-12-15 21:36:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:36:53,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-12-15 21:36:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:53,818 INFO L225 Difference]: With dead ends: 939 [2023-12-15 21:36:53,818 INFO L226 Difference]: Without dead ends: 490 [2023-12-15 21:36:53,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:36:53,819 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 390 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:53,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1046 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2023-12-15 21:36:53,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 450. [2023-12-15 21:36:53,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 410 states have (on average 1.4560975609756097) internal successors, (597), 411 states have internal predecessors, (597), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 21:36:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 669 transitions. [2023-12-15 21:36:53,832 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 669 transitions. Word has length 132 [2023-12-15 21:36:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:53,832 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 669 transitions. [2023-12-15 21:36:53,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 669 transitions. [2023-12-15 21:36:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-15 21:36:53,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:53,834 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:53,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:36:53,834 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:53,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:53,834 INFO L85 PathProgramCache]: Analyzing trace with hash 250262094, now seen corresponding path program 1 times [2023-12-15 21:36:53,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:53,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274805840] [2023-12-15 21:36:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:53,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:53,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:53,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274805840] [2023-12-15 21:36:53,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274805840] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:53,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:53,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:53,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887283658] [2023-12-15 21:36:53,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:53,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:53,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:53,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:53,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:53,998 INFO L87 Difference]: Start difference. First operand 450 states and 669 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:54,061 INFO L93 Difference]: Finished difference Result 1130 states and 1683 transitions. [2023-12-15 21:36:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:36:54,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-12-15 21:36:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:54,064 INFO L225 Difference]: With dead ends: 1130 [2023-12-15 21:36:54,064 INFO L226 Difference]: Without dead ends: 681 [2023-12-15 21:36:54,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:36:54,066 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 124 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:54,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 900 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:54,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-12-15 21:36:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 453. [2023-12-15 21:36:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 413 states have (on average 1.4527845036319613) internal successors, (600), 414 states have internal predecessors, (600), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 21:36:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 672 transitions. [2023-12-15 21:36:54,086 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 672 transitions. Word has length 132 [2023-12-15 21:36:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:54,087 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 672 transitions. [2023-12-15 21:36:54,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 672 transitions. [2023-12-15 21:36:54,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 21:36:54,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:54,088 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:54,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:36:54,088 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:54,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:54,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1364529179, now seen corresponding path program 1 times [2023-12-15 21:36:54,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:54,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703248820] [2023-12-15 21:36:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:54,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:54,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703248820] [2023-12-15 21:36:54,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703248820] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:54,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:54,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:54,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314761813] [2023-12-15 21:36:54,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:54,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:54,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:54,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:54,244 INFO L87 Difference]: Start difference. First operand 453 states and 672 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:54,288 INFO L93 Difference]: Finished difference Result 980 states and 1457 transitions. [2023-12-15 21:36:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:36:54,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-12-15 21:36:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:54,292 INFO L225 Difference]: With dead ends: 980 [2023-12-15 21:36:54,292 INFO L226 Difference]: Without dead ends: 528 [2023-12-15 21:36:54,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:54,294 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 144 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:54,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 765 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-15 21:36:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 462. [2023-12-15 21:36:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 422 states have (on average 1.4431279620853081) internal successors, (609), 423 states have internal predecessors, (609), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 21:36:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 681 transitions. [2023-12-15 21:36:54,307 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 681 transitions. Word has length 133 [2023-12-15 21:36:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:54,307 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 681 transitions. [2023-12-15 21:36:54,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 681 transitions. [2023-12-15 21:36:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 21:36:54,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:54,309 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:54,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:36:54,309 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:54,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:54,309 INFO L85 PathProgramCache]: Analyzing trace with hash -398224276, now seen corresponding path program 1 times [2023-12-15 21:36:54,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:54,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961401504] [2023-12-15 21:36:54,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:54,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:54,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:54,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961401504] [2023-12-15 21:36:54,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961401504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:54,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:54,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:36:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687937068] [2023-12-15 21:36:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:54,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:36:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:36:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:36:54,697 INFO L87 Difference]: Start difference. First operand 462 states and 681 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:54,868 INFO L93 Difference]: Finished difference Result 853 states and 1258 transitions. [2023-12-15 21:36:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:36:54,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-12-15 21:36:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:54,871 INFO L225 Difference]: With dead ends: 853 [2023-12-15 21:36:54,871 INFO L226 Difference]: Without dead ends: 563 [2023-12-15 21:36:54,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:36:54,872 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 494 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:54,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1039 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2023-12-15 21:36:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 522. [2023-12-15 21:36:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 469 states have (on average 1.4307036247334755) internal successors, (671), 469 states have internal predecessors, (671), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 21:36:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 767 transitions. [2023-12-15 21:36:54,886 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 767 transitions. Word has length 133 [2023-12-15 21:36:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:54,886 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 767 transitions. [2023-12-15 21:36:54,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 767 transitions. [2023-12-15 21:36:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 21:36:54,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:54,887 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:54,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:36:54,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:54,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:54,888 INFO L85 PathProgramCache]: Analyzing trace with hash 26607360, now seen corresponding path program 1 times [2023-12-15 21:36:54,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:54,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357254279] [2023-12-15 21:36:54,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:54,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:55,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:55,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357254279] [2023-12-15 21:36:55,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357254279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:55,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:55,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:36:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868537569] [2023-12-15 21:36:55,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:55,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:36:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:55,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:36:55,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:36:55,246 INFO L87 Difference]: Start difference. First operand 522 states and 767 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:55,391 INFO L93 Difference]: Finished difference Result 954 states and 1402 transitions. [2023-12-15 21:36:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:36:55,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-12-15 21:36:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:55,396 INFO L225 Difference]: With dead ends: 954 [2023-12-15 21:36:55,396 INFO L226 Difference]: Without dead ends: 604 [2023-12-15 21:36:55,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:36:55,397 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 574 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:55,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 978 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:55,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2023-12-15 21:36:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 355. [2023-12-15 21:36:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 319 states have (on average 1.4231974921630095) internal successors, (454), 319 states have internal predecessors, (454), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 21:36:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 518 transitions. [2023-12-15 21:36:55,411 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 518 transitions. Word has length 133 [2023-12-15 21:36:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:55,412 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 518 transitions. [2023-12-15 21:36:55,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 518 transitions. [2023-12-15 21:36:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-15 21:36:55,413 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:55,413 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:55,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:36:55,413 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:55,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:55,414 INFO L85 PathProgramCache]: Analyzing trace with hash -341486804, now seen corresponding path program 1 times [2023-12-15 21:36:55,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:55,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385299303] [2023-12-15 21:36:55,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:55,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:55,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385299303] [2023-12-15 21:36:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385299303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:36:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146958265] [2023-12-15 21:36:55,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:55,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:36:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:36:55,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:36:55,805 INFO L87 Difference]: Start difference. First operand 355 states and 518 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:56,089 INFO L93 Difference]: Finished difference Result 894 states and 1303 transitions. [2023-12-15 21:36:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:36:56,090 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-15 21:36:56,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:56,091 INFO L225 Difference]: With dead ends: 894 [2023-12-15 21:36:56,091 INFO L226 Difference]: Without dead ends: 540 [2023-12-15 21:36:56,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:36:56,093 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 403 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:56,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 2632 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2023-12-15 21:36:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 469. [2023-12-15 21:36:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 428 states have (on average 1.425233644859813) internal successors, (610), 429 states have internal predecessors, (610), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 21:36:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 682 transitions. [2023-12-15 21:36:56,106 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 682 transitions. Word has length 134 [2023-12-15 21:36:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:56,106 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 682 transitions. [2023-12-15 21:36:56,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 682 transitions. [2023-12-15 21:36:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-15 21:36:56,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:56,107 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:56,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:36:56,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:56,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash -734513814, now seen corresponding path program 1 times [2023-12-15 21:36:56,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:56,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036626833] [2023-12-15 21:36:56,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:56,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:56,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:56,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036626833] [2023-12-15 21:36:56,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036626833] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:56,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:56,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213118691] [2023-12-15 21:36:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:56,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:56,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:56,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:56,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:56,219 INFO L87 Difference]: Start difference. First operand 469 states and 682 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:56,295 INFO L93 Difference]: Finished difference Result 1028 states and 1493 transitions. [2023-12-15 21:36:56,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:36:56,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-15 21:36:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:56,297 INFO L225 Difference]: With dead ends: 1028 [2023-12-15 21:36:56,298 INFO L226 Difference]: Without dead ends: 560 [2023-12-15 21:36:56,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:56,299 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 200 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:56,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1250 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2023-12-15 21:36:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 487. [2023-12-15 21:36:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 437 states have (on average 1.414187643020595) internal successors, (618), 439 states have internal predecessors, (618), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-15 21:36:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 706 transitions. [2023-12-15 21:36:56,317 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 706 transitions. Word has length 134 [2023-12-15 21:36:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:56,317 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 706 transitions. [2023-12-15 21:36:56,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 706 transitions. [2023-12-15 21:36:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-15 21:36:56,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:56,319 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:56,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:36:56,319 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:56,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2030430546, now seen corresponding path program 1 times [2023-12-15 21:36:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:56,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797559064] [2023-12-15 21:36:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:56,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:56,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797559064] [2023-12-15 21:36:56,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797559064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:56,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:56,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:56,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071648786] [2023-12-15 21:36:56,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:56,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:56,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:56,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:56,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:56,430 INFO L87 Difference]: Start difference. First operand 487 states and 706 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:56,508 INFO L93 Difference]: Finished difference Result 1007 states and 1456 transitions. [2023-12-15 21:36:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:36:56,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-15 21:36:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:56,510 INFO L225 Difference]: With dead ends: 1007 [2023-12-15 21:36:56,511 INFO L226 Difference]: Without dead ends: 529 [2023-12-15 21:36:56,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:56,513 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 225 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:56,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1131 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-12-15 21:36:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 471. [2023-12-15 21:36:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 429 states have (on average 1.4195804195804196) internal successors, (609), 430 states have internal predecessors, (609), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 21:36:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 681 transitions. [2023-12-15 21:36:56,526 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 681 transitions. Word has length 134 [2023-12-15 21:36:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:56,526 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 681 transitions. [2023-12-15 21:36:56,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 681 transitions. [2023-12-15 21:36:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-15 21:36:56,527 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:56,527 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:56,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:36:56,528 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:56,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1871509740, now seen corresponding path program 1 times [2023-12-15 21:36:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:56,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427335101] [2023-12-15 21:36:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:56,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:56,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427335101] [2023-12-15 21:36:56,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427335101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:56,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:56,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:36:56,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409872765] [2023-12-15 21:36:56,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:56,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:36:56,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:56,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:36:56,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:36:56,905 INFO L87 Difference]: Start difference. First operand 471 states and 681 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:57,155 INFO L93 Difference]: Finished difference Result 991 states and 1430 transitions. [2023-12-15 21:36:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:36:57,155 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-15 21:36:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:57,157 INFO L225 Difference]: With dead ends: 991 [2023-12-15 21:36:57,157 INFO L226 Difference]: Without dead ends: 521 [2023-12-15 21:36:57,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-12-15 21:36:57,159 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 331 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:57,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 2690 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2023-12-15 21:36:57,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 432. [2023-12-15 21:36:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 390 states have (on average 1.4153846153846155) internal successors, (552), 391 states have internal predecessors, (552), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 21:36:57,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 624 transitions. [2023-12-15 21:36:57,172 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 624 transitions. Word has length 134 [2023-12-15 21:36:57,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:57,173 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 624 transitions. [2023-12-15 21:36:57,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 624 transitions. [2023-12-15 21:36:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-15 21:36:57,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:57,174 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:57,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:36:57,175 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:57,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:57,175 INFO L85 PathProgramCache]: Analyzing trace with hash -675021143, now seen corresponding path program 1 times [2023-12-15 21:36:57,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:57,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361238482] [2023-12-15 21:36:57,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:57,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:57,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:57,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361238482] [2023-12-15 21:36:57,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361238482] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:57,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:57,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:36:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744879446] [2023-12-15 21:36:57,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:57,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:36:57,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:57,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:36:57,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:36:57,261 INFO L87 Difference]: Start difference. First operand 432 states and 624 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:57,288 INFO L93 Difference]: Finished difference Result 924 states and 1327 transitions. [2023-12-15 21:36:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:36:57,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-15 21:36:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:57,290 INFO L225 Difference]: With dead ends: 924 [2023-12-15 21:36:57,290 INFO L226 Difference]: Without dead ends: 501 [2023-12-15 21:36:57,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:36:57,291 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 102 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:57,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 489 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-12-15 21:36:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 409. [2023-12-15 21:36:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 367 states have (on average 1.3923705722070845) internal successors, (511), 368 states have internal predecessors, (511), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-15 21:36:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 583 transitions. [2023-12-15 21:36:57,306 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 583 transitions. Word has length 134 [2023-12-15 21:36:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:57,307 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 583 transitions. [2023-12-15 21:36:57,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 583 transitions. [2023-12-15 21:36:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 21:36:57,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:57,308 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:57,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:36:57,308 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:57,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1387420490, now seen corresponding path program 1 times [2023-12-15 21:36:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810715049] [2023-12-15 21:36:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810715049] [2023-12-15 21:36:57,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810715049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:57,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:57,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:36:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292428376] [2023-12-15 21:36:57,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:57,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:36:57,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:36:57,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:36:57,803 INFO L87 Difference]: Start difference. First operand 409 states and 583 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:58,188 INFO L93 Difference]: Finished difference Result 1217 states and 1744 transitions. [2023-12-15 21:36:58,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:36:58,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-12-15 21:36:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:58,191 INFO L225 Difference]: With dead ends: 1217 [2023-12-15 21:36:58,191 INFO L226 Difference]: Without dead ends: 817 [2023-12-15 21:36:58,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2023-12-15 21:36:58,192 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 770 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:58,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1613 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2023-12-15 21:36:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 673. [2023-12-15 21:36:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 624 states have (on average 1.4070512820512822) internal successors, (878), 627 states have internal predecessors, (878), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:36:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 958 transitions. [2023-12-15 21:36:58,211 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 958 transitions. Word has length 135 [2023-12-15 21:36:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:58,212 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 958 transitions. [2023-12-15 21:36:58,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 958 transitions. [2023-12-15 21:36:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-15 21:36:58,213 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:58,213 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:58,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:36:58,213 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:58,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1083401524, now seen corresponding path program 1 times [2023-12-15 21:36:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:58,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206902365] [2023-12-15 21:36:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:58,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:36:58,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:58,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206902365] [2023-12-15 21:36:58,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206902365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:58,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:58,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:58,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273341302] [2023-12-15 21:36:58,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:58,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:58,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:58,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:58,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:58,368 INFO L87 Difference]: Start difference. First operand 673 states and 958 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:58,443 INFO L93 Difference]: Finished difference Result 1637 states and 2341 transitions. [2023-12-15 21:36:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:36:58,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-12-15 21:36:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:58,446 INFO L225 Difference]: With dead ends: 1637 [2023-12-15 21:36:58,447 INFO L226 Difference]: Without dead ends: 977 [2023-12-15 21:36:58,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:36:58,448 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 198 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:58,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 823 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2023-12-15 21:36:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 843. [2023-12-15 21:36:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 794 states have (on average 1.4105793450881612) internal successors, (1120), 797 states have internal predecessors, (1120), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:36:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1200 transitions. [2023-12-15 21:36:58,470 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1200 transitions. Word has length 135 [2023-12-15 21:36:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:58,471 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1200 transitions. [2023-12-15 21:36:58,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:36:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1200 transitions. [2023-12-15 21:36:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-15 21:36:58,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:58,472 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:58,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 21:36:58,473 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:58,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash -7179097, now seen corresponding path program 1 times [2023-12-15 21:36:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:58,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572725083] [2023-12-15 21:36:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:36:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-15 21:36:58,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:58,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572725083] [2023-12-15 21:36:58,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572725083] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:36:58,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701532567] [2023-12-15 21:36:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:58,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:58,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:58,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:36:59,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:36:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:59,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-15 21:36:59,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:59,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:37:00,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 68 [2023-12-15 21:37:00,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2023-12-15 21:37:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-15 21:37:00,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:37:01,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2023-12-15 21:37:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-15 21:37:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701532567] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:37:01,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:37:01,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 16] total 33 [2023-12-15 21:37:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515328939] [2023-12-15 21:37:01,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:37:01,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-15 21:37:01,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:37:01,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-15 21:37:01,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2023-12-15 21:37:01,299 INFO L87 Difference]: Start difference. First operand 843 states and 1200 transitions. Second operand has 33 states, 30 states have (on average 5.766666666666667) internal successors, (173), 32 states have internal predecessors, (173), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) [2023-12-15 21:37:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:37:03,701 INFO L93 Difference]: Finished difference Result 2098 states and 2946 transitions. [2023-12-15 21:37:03,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-12-15 21:37:03,701 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.766666666666667) internal successors, (173), 32 states have internal predecessors, (173), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) Word has length 137 [2023-12-15 21:37:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:37:03,704 INFO L225 Difference]: With dead ends: 2098 [2023-12-15 21:37:03,705 INFO L226 Difference]: Without dead ends: 1268 [2023-12-15 21:37:03,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1605, Invalid=7707, Unknown=0, NotChecked=0, Total=9312 [2023-12-15 21:37:03,708 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 2992 mSDsluCounter, 4894 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 5199 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 21:37:03,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2993 Valid, 5199 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 21:37:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2023-12-15 21:37:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 943. [2023-12-15 21:37:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 883 states have (on average 1.3975084937712345) internal successors, (1234), 883 states have internal predecessors, (1234), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 21:37:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1330 transitions. [2023-12-15 21:37:03,766 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1330 transitions. Word has length 137 [2023-12-15 21:37:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:37:03,766 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1330 transitions. [2023-12-15 21:37:03,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.766666666666667) internal successors, (173), 32 states have internal predecessors, (173), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) [2023-12-15 21:37:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1330 transitions. [2023-12-15 21:37:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-15 21:37:03,767 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:37:03,767 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:37:03,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:37:03,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:37:03,974 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:37:03,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:37:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 172240624, now seen corresponding path program 1 times [2023-12-15 21:37:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:37:03,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529307976] [2023-12-15 21:37:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:37:03,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:37:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:37:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:37:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:37:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:37:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:37:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:37:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:37:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:37:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:37:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:37:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:37:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:37:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:37:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:37:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:37:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:37:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:37:04,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:37:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529307976] [2023-12-15 21:37:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529307976] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:37:04,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:37:04,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:37:04,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567250155] [2023-12-15 21:37:04,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:37:04,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:37:04,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:37:04,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:37:04,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:37:04,118 INFO L87 Difference]: Start difference. First operand 943 states and 1330 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:37:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:37:04,228 INFO L93 Difference]: Finished difference Result 1871 states and 2635 transitions. [2023-12-15 21:37:04,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:37:04,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-12-15 21:37:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:37:04,232 INFO L225 Difference]: With dead ends: 1871 [2023-12-15 21:37:04,232 INFO L226 Difference]: Without dead ends: 1168 [2023-12-15 21:37:04,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:37:04,233 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 247 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:37:04,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 963 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:37:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2023-12-15 21:37:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1003. [2023-12-15 21:37:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 932 states have (on average 1.3927038626609443) internal successors, (1298), 933 states have internal predecessors, (1298), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-15 21:37:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1410 transitions. [2023-12-15 21:37:04,268 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1410 transitions. Word has length 137 [2023-12-15 21:37:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:37:04,269 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1410 transitions. [2023-12-15 21:37:04,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:37:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1410 transitions. [2023-12-15 21:37:04,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-15 21:37:04,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:37:04,270 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:37:04,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 21:37:04,270 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:37:04,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:37:04,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1700942396, now seen corresponding path program 1 times [2023-12-15 21:37:04,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:37:04,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462226000] [2023-12-15 21:37:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:37:04,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:37:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:37:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:37:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:37:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:37:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:37:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:37:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:37:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:37:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:37:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:37:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:37:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:37:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:37:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:37:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:37:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:37:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:37:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-15 21:37:04,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:37:04,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462226000] [2023-12-15 21:37:04,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462226000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:37:04,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:37:04,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:37:04,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361963530] [2023-12-15 21:37:04,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:37:04,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:37:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:37:04,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:37:04,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:37:04,421 INFO L87 Difference]: Start difference. First operand 1003 states and 1410 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:37:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:37:04,497 INFO L93 Difference]: Finished difference Result 2082 states and 2920 transitions. [2023-12-15 21:37:04,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:37:04,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-12-15 21:37:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:37:04,501 INFO L225 Difference]: With dead ends: 2082 [2023-12-15 21:37:04,501 INFO L226 Difference]: Without dead ends: 1080 [2023-12-15 21:37:04,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:37:04,502 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 133 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:37:04,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 740 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:37:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2023-12-15 21:37:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 990. [2023-12-15 21:37:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 919 states have (on average 1.3895538628944506) internal successors, (1277), 920 states have internal predecessors, (1277), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-15 21:37:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1389 transitions. [2023-12-15 21:37:04,532 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1389 transitions. Word has length 138 [2023-12-15 21:37:04,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:37:04,532 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1389 transitions. [2023-12-15 21:37:04,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-15 21:37:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1389 transitions. [2023-12-15 21:37:04,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-15 21:37:04,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:37:04,533 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:37:04,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 21:37:04,534 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:37:04,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:37:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2004961362, now seen corresponding path program 1 times [2023-12-15 21:37:04,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:37:04,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286687012] [2023-12-15 21:37:04,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:37:04,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:37:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:37:04,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:37:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:37:04,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:37:04,708 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:37:04,708 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:37:04,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 21:37:04,714 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:37:04,717 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:37:04,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:37:04 BoogieIcfgContainer [2023-12-15 21:37:04,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:37:04,858 INFO L158 Benchmark]: Toolchain (without parser) took 14843.86ms. Allocated memory was 185.6MB in the beginning and 633.3MB in the end (delta: 447.7MB). Free memory was 141.9MB in the beginning and 240.4MB in the end (delta: -98.5MB). Peak memory consumption was 350.1MB. Max. memory is 8.0GB. [2023-12-15 21:37:04,859 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:37:04,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.80ms. Allocated memory is still 185.6MB. Free memory was 141.9MB in the beginning and 126.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:37:04,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.81ms. Allocated memory is still 185.6MB. Free memory was 126.9MB in the beginning and 123.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:37:04,862 INFO L158 Benchmark]: Boogie Preprocessor took 101.15ms. Allocated memory is still 185.6MB. Free memory was 123.1MB in the beginning and 117.1MB in the end (delta: 5.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:37:04,863 INFO L158 Benchmark]: RCFGBuilder took 752.16ms. Allocated memory was 185.6MB in the beginning and 336.6MB in the end (delta: 151.0MB). Free memory was 117.1MB in the beginning and 283.6MB in the end (delta: -166.4MB). Peak memory consumption was 40.7MB. Max. memory is 8.0GB. [2023-12-15 21:37:04,864 INFO L158 Benchmark]: TraceAbstraction took 13673.84ms. Allocated memory was 336.6MB in the beginning and 633.3MB in the end (delta: 296.7MB). Free memory was 283.0MB in the beginning and 240.4MB in the end (delta: 42.6MB). Peak memory consumption was 339.9MB. Max. memory is 8.0GB. [2023-12-15 21:37:04,866 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.11ms. Allocated memory is still 185.6MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.80ms. Allocated memory is still 185.6MB. Free memory was 141.9MB in the beginning and 126.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.81ms. Allocated memory is still 185.6MB. Free memory was 126.9MB in the beginning and 123.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 101.15ms. Allocated memory is still 185.6MB. Free memory was 123.1MB in the beginning and 117.1MB in the end (delta: 5.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 752.16ms. Allocated memory was 185.6MB in the beginning and 336.6MB in the end (delta: 151.0MB). Free memory was 117.1MB in the beginning and 283.6MB in the end (delta: -166.4MB). Peak memory consumption was 40.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13673.84ms. Allocated memory was 336.6MB in the beginning and 633.3MB in the end (delta: 296.7MB). Free memory was 283.0MB in the beginning and 240.4MB in the end (delta: 42.6MB). Peak memory consumption was 339.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someUnaryDOUBLEoperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned char var_1_5 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] signed long int var_1_6 = -64; [L28] signed long int var_1_6 = -64; [L29] signed long int* var_1_6_Pointer = &(var_1_6); [L30] signed long int var_1_7 = -5; [L30] signed long int var_1_7 = -5; [L31] signed long int* var_1_7_Pointer = &(var_1_7); [L32] signed long int var_1_8 = 500; [L32] signed long int var_1_8 = 500; [L33] signed long int* var_1_8_Pointer = &(var_1_8); [L34] signed long int var_1_9 = -5; [L34] signed long int var_1_9 = -5; [L35] signed long int* var_1_9_Pointer = &(var_1_9); [L36] signed long int var_1_10 = -100; [L36] signed long int var_1_10 = -100; [L37] signed long int* var_1_10_Pointer = &(var_1_10); [L38] unsigned char var_1_11 = 1; [L38] unsigned char var_1_11 = 1; [L39] unsigned char* var_1_11_Pointer = &(var_1_11); [L40] double var_1_12 = 127.5; [L40] double var_1_12 = 127.5; [L41] double* var_1_12_Pointer = &(var_1_12); [L42] double var_1_13 = 15.75; [L42] double var_1_13 = 15.75; [L43] double* var_1_13_Pointer = &(var_1_13); [L44] double var_1_14 = -0.5; [L44] double var_1_14 = -0.5; [L45] double* var_1_14_Pointer = &(var_1_14); [L46] double var_1_15 = 5.25; [L46] double var_1_15 = 5.25; [L47] double* var_1_15_Pointer = &(var_1_15); [L48] double var_1_16 = 8.5; [L48] double var_1_16 = 8.5; [L49] double* var_1_16_Pointer = &(var_1_16); [L50] unsigned char last_1_var_1_11 = 1; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] EXPR \read(var_1_11) [L109] last_1_var_1_11 = var_1_11 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] var_1_7 = __VERIFIER_nondet_long() [L88] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] var_1_8 = __VERIFIER_nondet_long() [L91] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] var_1_9 = __VERIFIER_nondet_long() [L94] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] var_1_10 = __VERIFIER_nondet_long() [L97] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] var_1_13 = __VERIFIER_nondet_double() [L100] EXPR \read(var_1_13) [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F [L100] EXPR \read(var_1_13) [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] var_1_14 = __VERIFIER_nondet_double() [L102] EXPR \read(var_1_14) [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F [L102] EXPR \read(var_1_14) [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] var_1_15 = __VERIFIER_nondet_double() [L104] EXPR \read(var_1_15) [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F [L104] EXPR \read(var_1_15) [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] var_1_16 = __VERIFIER_nondet_double() [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] RET updateVariables() [L121] CALL step() [L54] unsigned char stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] COND FALSE !(! last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L60] EXPR \read(*var_1_7_Pointer) [L60] signed long int stepLocal_2 = (*(var_1_7_Pointer)); [L61] EXPR \read(*var_1_10_Pointer) [L61] signed long int stepLocal_1 = (*(var_1_10_Pointer)); [L62] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND FALSE !((*(var_1_8_Pointer)) <= stepLocal_2) [L69] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L69] COND FALSE !(! (*(var_1_11_Pointer))) [L72] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) [L72] EXPR \read(*var_1_9_Pointer) [L72] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=18, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR \read(*var_1_10_Pointer) [L72] EXPR \read(*var_1_7_Pointer) [L72] (*(var_1_6_Pointer)) = (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))) [L74] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] COND FALSE !((*(var_1_4_Pointer))) [L77] EXPR \read(*var_1_15_Pointer) [L77] (*(var_1_12_Pointer)) = (*(var_1_15_Pointer)) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR (! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1 [L112] EXPR (! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) [L112] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))) [L112] EXPR \read(*var_1_6_Pointer) [L112] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) [L112] EXPR \read(*var_1_9_Pointer) [L112] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR \read(*var_1_10_Pointer) [L112] EXPR \read(*var_1_7_Pointer) [L112] EXPR (! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) [L112] EXPR \read(*var_1_8_Pointer) [L112] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1 [L112] EXPR ((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1 VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) [L112] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer)))) [L112] EXPR \read(*var_1_12_Pointer) [L112] EXPR \read(*var_1_15_Pointer) [L112] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer)))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112-L113] return ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 22, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8112 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8110 mSDsluCounter, 26257 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20511 mSDsCounter, 406 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3051 IncrementalHoareTripleChecker+Invalid, 3457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 406 mSolverCounterUnsat, 5746 mSDtfsCounter, 3051 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1214 GetRequests, 988 SyntacticMatches, 1 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1003occurred in iteration=20, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 1990 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 3065 NumberOfCodeBlocks, 3065 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3041 ConstructedInterpolants, 0 QuantifiedInterpolants, 9719 SizeOfPredicates, 25 NumberOfNonLiveVariables, 616 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 10776/11040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 21:37:04,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...