/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:24:56,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:24:57,030 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-16 04:24:57,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:24:57,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:24:57,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:24:57,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:24:57,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:24:57,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:24:57,061 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:24:57,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:24:57,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:24:57,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:24:57,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:24:57,063 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:24:57,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:24:57,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:24:57,064 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:24:57,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:24:57,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:24:57,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:24:57,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:24:57,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:24:57,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:24:57,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:24:57,065 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:24:57,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:24:57,066 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:24:57,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:24:57,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:24:57,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:24:57,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:24:57,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:24:57,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:24:57,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:24:57,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:24:57,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:24:57,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:24:57,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:24:57,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:24:57,069 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:24:57,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:24:57,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:24:57,069 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 -> false [2023-12-16 04:24:57,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:24:57,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:24:57,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:24:57,295 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:24:57,304 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:24:57,305 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-22.i [2023-12-16 04:24:58,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:24:58,522 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:24:58,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2023-12-16 04:24:58,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ff4b002/464e5a6272614772ac9888114845c3f8/FLAG1a09b157c [2023-12-16 04:24:58,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ff4b002/464e5a6272614772ac9888114845c3f8 [2023-12-16 04:24:58,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:24:58,540 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:24:58,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:24:58,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:24:58,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:24:58,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ea7714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58, skipping insertion in model container [2023-12-16 04:24:58,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,573 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:24:58,689 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-22.i[916,929] [2023-12-16 04:24:58,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:24:58,760 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:24:58,768 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-22.i[916,929] [2023-12-16 04:24:58,788 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:24:58,803 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:24:58,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58 WrapperNode [2023-12-16 04:24:58,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:24:58,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:24:58,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:24:58,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:24:58,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,852 INFO L138 Inliner]: procedures = 29, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2023-12-16 04:24:58,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:24:58,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:24:58,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:24:58,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:24:58,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,887 INFO L175 MemorySlicer]: Split 96 memory accesses to 11 slices as follows [2, 8, 8, 17, 16, 3, 8, 10, 8, 8, 8]. 18 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 2, 1, 2, 1, 1, 1, 1, 1, 3, 1]. [2023-12-16 04:24:58,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:24:58,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:24:58,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:24:58,916 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:24:58,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (1/1) ... [2023-12-16 04:24:58,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:24:58,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:24:58,963 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-16 04:24:58,982 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-16 04:24:58,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:24:58,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:24:58,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:24:58,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:24:58,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:24:58,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-16 04:24:58,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-16 04:24:58,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-16 04:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-16 04:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-16 04:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-16 04:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-16 04:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:24:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-16 04:24:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-16 04:24:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-16 04:24:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-16 04:24:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-16 04:24:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-16 04:24:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-16 04:24:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:24:58,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:24:58,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:24:58,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:24:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-16 04:24:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-16 04:24:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-16 04:24:58,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-16 04:24:58,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-16 04:24:58,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-16 04:24:58,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:24:58,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:24:58,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:24:58,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:24:58,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:24:58,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:24:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:24:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-16 04:24:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-16 04:24:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-16 04:24:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-16 04:24:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-16 04:24:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-16 04:24:58,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:24:59,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:24:59,160 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:24:59,162 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:24:59,582 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:24:59,610 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:24:59,610 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:24:59,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:24:59 BoogieIcfgContainer [2023-12-16 04:24:59,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:24:59,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:24:59,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:24:59,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:24:59,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:24:58" (1/3) ... [2023-12-16 04:24:59,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d2c603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:24:59, skipping insertion in model container [2023-12-16 04:24:59,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:58" (2/3) ... [2023-12-16 04:24:59,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d2c603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:24:59, skipping insertion in model container [2023-12-16 04:24:59,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:24:59" (3/3) ... [2023-12-16 04:24:59,619 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-22.i [2023-12-16 04:24:59,630 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:24:59,630 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:24:59,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:24:59,674 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;@365d94eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:24:59,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:24:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 04:24:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-16 04:24:59,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:24:59,685 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:24:59,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:24:59,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:24:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash -929713180, now seen corresponding path program 1 times [2023-12-16 04:24:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:24:59,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731188247] [2023-12-16 04:24:59,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:24:59,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:24:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:24:59,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:24:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:24:59,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:24:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:24:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:24:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:24:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:24:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:24:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:24:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:24:59,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:24:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:24:59,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:24:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:24:59,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:24:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:24:59,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:24:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 04:25:00,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:00,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731188247] [2023-12-16 04:25:00,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731188247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:00,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:00,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:25:00,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895241274] [2023-12-16 04:25:00,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:00,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:25:00,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:00,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:25:00,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:25:00,041 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-16 04:25:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:00,090 INFO L93 Difference]: Finished difference Result 181 states and 281 transitions. [2023-12-16 04:25:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:25:00,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2023-12-16 04:25:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:00,098 INFO L225 Difference]: With dead ends: 181 [2023-12-16 04:25:00,099 INFO L226 Difference]: Without dead ends: 90 [2023-12-16 04:25:00,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-16 04:25:00,105 INFO L413 NwaCegarLoop]: 127 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, 127 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-16 04:25:00,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:25:00,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-16 04:25:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-16 04:25:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 79 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 04:25:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2023-12-16 04:25:00,156 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 84 [2023-12-16 04:25:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:00,156 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2023-12-16 04:25:00,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-16 04:25:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2023-12-16 04:25:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-16 04:25:00,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:00,164 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:00,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:25:00,164 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:00,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:00,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1874459298, now seen corresponding path program 1 times [2023-12-16 04:25:00,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:00,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154516892] [2023-12-16 04:25:00,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:00,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:00,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:00,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:00,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:00,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:25:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:00,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:00,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:25:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:00,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:25:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:00,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:25:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 04:25:00,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:00,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154516892] [2023-12-16 04:25:00,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154516892] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:00,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:00,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:25:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869042071] [2023-12-16 04:25:00,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:00,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:25:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:00,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:25:00,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:25:00,384 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-16 04:25:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:00,442 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2023-12-16 04:25:00,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:25:00,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2023-12-16 04:25:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:00,447 INFO L225 Difference]: With dead ends: 185 [2023-12-16 04:25:00,447 INFO L226 Difference]: Without dead ends: 96 [2023-12-16 04:25:00,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-16 04:25:00,449 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 10 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:00,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 370 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:25:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-16 04:25:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2023-12-16 04:25:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 04:25:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 133 transitions. [2023-12-16 04:25:00,459 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 133 transitions. Word has length 84 [2023-12-16 04:25:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:00,460 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 133 transitions. [2023-12-16 04:25:00,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-16 04:25:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 133 transitions. [2023-12-16 04:25:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-16 04:25:00,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:00,461 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:00,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:25:00,461 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:00,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1048700700, now seen corresponding path program 1 times [2023-12-16 04:25:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:00,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558817875] [2023-12-16 04:25:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:01,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:25:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:01,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:25:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:01,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:25:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:25:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 04:25:01,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:01,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558817875] [2023-12-16 04:25:01,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558817875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:01,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:01,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:25:01,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193882909] [2023-12-16 04:25:01,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:01,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:25:01,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:25:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:25:01,546 INFO L87 Difference]: Start difference. First operand 92 states and 133 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:02,055 INFO L93 Difference]: Finished difference Result 687 states and 993 transitions. [2023-12-16 04:25:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 04:25:02,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2023-12-16 04:25:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:02,059 INFO L225 Difference]: With dead ends: 687 [2023-12-16 04:25:02,059 INFO L226 Difference]: Without dead ends: 596 [2023-12-16 04:25:02,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2023-12-16 04:25:02,061 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 1113 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:02,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1692 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:25:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2023-12-16 04:25:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 444. [2023-12-16 04:25:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 393 states have (on average 1.424936386768448) internal successors, (560), 393 states have internal predecessors, (560), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-16 04:25:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 650 transitions. [2023-12-16 04:25:02,122 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 650 transitions. Word has length 84 [2023-12-16 04:25:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:02,122 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 650 transitions. [2023-12-16 04:25:02,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 650 transitions. [2023-12-16 04:25:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-16 04:25:02,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:02,124 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:02,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:25:02,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:02,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:02,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1349395116, now seen corresponding path program 1 times [2023-12-16 04:25:02,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:02,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053085426] [2023-12-16 04:25:02,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:02,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:25:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:25:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:25:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:25:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 04:25:02,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053085426] [2023-12-16 04:25:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053085426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:02,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:02,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:25:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749075773] [2023-12-16 04:25:02,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:02,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:25:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:02,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:25:02,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:25:02,481 INFO L87 Difference]: Start difference. First operand 444 states and 650 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:02,668 INFO L93 Difference]: Finished difference Result 812 states and 1179 transitions. [2023-12-16 04:25:02,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:25:02,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2023-12-16 04:25:02,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:02,670 INFO L225 Difference]: With dead ends: 812 [2023-12-16 04:25:02,670 INFO L226 Difference]: Without dead ends: 369 [2023-12-16 04:25:02,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:25:02,672 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 430 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:02,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1108 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:25:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-12-16 04:25:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 269. [2023-12-16 04:25:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 238 states have (on average 1.415966386554622) internal successors, (337), 238 states have internal predecessors, (337), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-16 04:25:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 391 transitions. [2023-12-16 04:25:02,682 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 391 transitions. Word has length 85 [2023-12-16 04:25:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:02,682 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 391 transitions. [2023-12-16 04:25:02,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 391 transitions. [2023-12-16 04:25:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-16 04:25:02,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:02,684 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:02,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:25:02,684 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:02,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2035680752, now seen corresponding path program 1 times [2023-12-16 04:25:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826499865] [2023-12-16 04:25:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:02,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:25:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:25:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:25:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:25:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 04:25:02,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:02,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826499865] [2023-12-16 04:25:02,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826499865] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:02,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:02,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:25:02,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570885289] [2023-12-16 04:25:02,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:02,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:25:02,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:02,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:25:02,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:25:02,766 INFO L87 Difference]: Start difference. First operand 269 states and 391 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:02,783 INFO L93 Difference]: Finished difference Result 537 states and 781 transitions. [2023-12-16 04:25:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:25:02,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2023-12-16 04:25:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:02,785 INFO L225 Difference]: With dead ends: 537 [2023-12-16 04:25:02,785 INFO L226 Difference]: Without dead ends: 269 [2023-12-16 04:25:02,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-16 04:25:02,786 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 27 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:02,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 220 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:25:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-12-16 04:25:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 198. [2023-12-16 04:25:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 177 states have (on average 1.4124293785310735) internal successors, (250), 177 states have internal predecessors, (250), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:25:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 286 transitions. [2023-12-16 04:25:02,794 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 286 transitions. Word has length 85 [2023-12-16 04:25:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:02,794 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 286 transitions. [2023-12-16 04:25:02,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 286 transitions. [2023-12-16 04:25:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-16 04:25:02,795 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:02,795 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:02,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:25:02,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:02,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:02,796 INFO L85 PathProgramCache]: Analyzing trace with hash -82631991, now seen corresponding path program 1 times [2023-12-16 04:25:02,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:02,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310587928] [2023-12-16 04:25:02,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:02,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:25:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:25:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:25:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:25:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 04:25:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310587928] [2023-12-16 04:25:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310587928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:03,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:25:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226726707] [2023-12-16 04:25:03,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:03,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:25:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:03,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:25:03,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:25:03,271 INFO L87 Difference]: Start difference. First operand 198 states and 286 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:03,549 INFO L93 Difference]: Finished difference Result 386 states and 552 transitions. [2023-12-16 04:25:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:25:03,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2023-12-16 04:25:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:03,550 INFO L225 Difference]: With dead ends: 386 [2023-12-16 04:25:03,550 INFO L226 Difference]: Without dead ends: 295 [2023-12-16 04:25:03,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:25:03,552 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 397 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:03,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1225 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:25:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-12-16 04:25:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 206. [2023-12-16 04:25:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.4108108108108108) internal successors, (261), 185 states have internal predecessors, (261), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:25:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 297 transitions. [2023-12-16 04:25:03,561 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 297 transitions. Word has length 86 [2023-12-16 04:25:03,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:03,562 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 297 transitions. [2023-12-16 04:25:03,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:03,562 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 297 transitions. [2023-12-16 04:25:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-16 04:25:03,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:03,563 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:03,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:25:03,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:03,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash 500352798, now seen corresponding path program 1 times [2023-12-16 04:25:03,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:03,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379835480] [2023-12-16 04:25:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:03,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:25:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:25:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:25:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:25:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 04:25:03,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379835480] [2023-12-16 04:25:03,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379835480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:03,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:03,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:25:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857810421] [2023-12-16 04:25:03,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:03,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:25:03,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:25:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:25:03,955 INFO L87 Difference]: Start difference. First operand 206 states and 297 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:04,143 INFO L93 Difference]: Finished difference Result 418 states and 596 transitions. [2023-12-16 04:25:04,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:25:04,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2023-12-16 04:25:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:04,145 INFO L225 Difference]: With dead ends: 418 [2023-12-16 04:25:04,145 INFO L226 Difference]: Without dead ends: 319 [2023-12-16 04:25:04,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:25:04,146 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 385 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:04,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1107 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:25:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-16 04:25:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 202. [2023-12-16 04:25:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 181 states have (on average 1.4033149171270718) internal successors, (254), 181 states have internal predecessors, (254), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:25:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 290 transitions. [2023-12-16 04:25:04,151 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 290 transitions. Word has length 86 [2023-12-16 04:25:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:04,151 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 290 transitions. [2023-12-16 04:25:04,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 290 transitions. [2023-12-16 04:25:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-16 04:25:04,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:04,152 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:04,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:25:04,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:04,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2065076587, now seen corresponding path program 1 times [2023-12-16 04:25:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:04,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131758874] [2023-12-16 04:25:04,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:04,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:04,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:04,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:04,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:04,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:25:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:04,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:04,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:25:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:04,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:25:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:04,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:25:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 04:25:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131758874] [2023-12-16 04:25:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131758874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:04,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:04,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:25:04,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957915622] [2023-12-16 04:25:04,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:04,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:25:04,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:04,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:25:04,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:25:04,603 INFO L87 Difference]: Start difference. First operand 202 states and 290 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:05,361 INFO L93 Difference]: Finished difference Result 1135 states and 1625 transitions. [2023-12-16 04:25:05,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-16 04:25:05,362 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2023-12-16 04:25:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:05,365 INFO L225 Difference]: With dead ends: 1135 [2023-12-16 04:25:05,365 INFO L226 Difference]: Without dead ends: 1044 [2023-12-16 04:25:05,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2023-12-16 04:25:05,366 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 890 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:05,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1816 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:25:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2023-12-16 04:25:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 486. [2023-12-16 04:25:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 435 states have (on average 1.4) internal successors, (609), 435 states have internal predecessors, (609), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-16 04:25:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 699 transitions. [2023-12-16 04:25:05,386 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 699 transitions. Word has length 87 [2023-12-16 04:25:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:05,386 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 699 transitions. [2023-12-16 04:25:05,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 699 transitions. [2023-12-16 04:25:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-16 04:25:05,387 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:05,387 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:05,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:25:05,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:05,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1247428137, now seen corresponding path program 1 times [2023-12-16 04:25:05,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:05,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695997897] [2023-12-16 04:25:05,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:05,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:25:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:25:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:25:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:25:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 04:25:05,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:05,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695997897] [2023-12-16 04:25:05,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695997897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:05,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:05,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:25:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037582329] [2023-12-16 04:25:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:05,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:25:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:25:05,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:25:05,860 INFO L87 Difference]: Start difference. First operand 486 states and 699 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:06,032 INFO L93 Difference]: Finished difference Result 1096 states and 1578 transitions. [2023-12-16 04:25:06,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:25:06,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2023-12-16 04:25:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:06,036 INFO L225 Difference]: With dead ends: 1096 [2023-12-16 04:25:06,036 INFO L226 Difference]: Without dead ends: 822 [2023-12-16 04:25:06,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:25:06,038 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 200 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:06,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 800 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:25:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2023-12-16 04:25:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 498. [2023-12-16 04:25:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 447 states have (on average 1.4026845637583893) internal successors, (627), 447 states have internal predecessors, (627), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-16 04:25:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 717 transitions. [2023-12-16 04:25:06,076 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 717 transitions. Word has length 87 [2023-12-16 04:25:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:06,076 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 717 transitions. [2023-12-16 04:25:06,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 717 transitions. [2023-12-16 04:25:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-16 04:25:06,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:06,077 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:06,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:25:06,077 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:06,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:06,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1324899888, now seen corresponding path program 1 times [2023-12-16 04:25:06,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:06,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455029759] [2023-12-16 04:25:06,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:06,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:06,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:06,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:06,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:06,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:06,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:25:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:06,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:25:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:06,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:25:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:06,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:25:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 04:25:06,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:06,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455029759] [2023-12-16 04:25:06,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455029759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:06,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:06,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:25:06,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184801807] [2023-12-16 04:25:06,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:06,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:25:06,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:06,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:25:06,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:25:06,187 INFO L87 Difference]: Start difference. First operand 498 states and 717 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:06,232 INFO L93 Difference]: Finished difference Result 1065 states and 1533 transitions. [2023-12-16 04:25:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:25:06,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2023-12-16 04:25:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:06,234 INFO L225 Difference]: With dead ends: 1065 [2023-12-16 04:25:06,234 INFO L226 Difference]: Without dead ends: 568 [2023-12-16 04:25:06,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-16 04:25:06,235 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 66 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 469 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-16 04:25:06,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 469 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:25:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2023-12-16 04:25:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 513. [2023-12-16 04:25:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 462 states have (on average 1.3896103896103895) internal successors, (642), 462 states have internal predecessors, (642), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-16 04:25:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 732 transitions. [2023-12-16 04:25:06,259 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 732 transitions. Word has length 88 [2023-12-16 04:25:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:06,260 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 732 transitions. [2023-12-16 04:25:06,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 04:25:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 732 transitions. [2023-12-16 04:25:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-16 04:25:06,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:06,261 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:06,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:25:06,261 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:06,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash -450107474, now seen corresponding path program 1 times [2023-12-16 04:25:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770897452] [2023-12-16 04:25:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:25:06,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:25:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:25:06,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:25:06,367 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:25:06,368 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:25:06,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:25:06,371 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:25:06,373 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:25:06,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:25:06 BoogieIcfgContainer [2023-12-16 04:25:06,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:25:06,478 INFO L158 Benchmark]: Toolchain (without parser) took 7937.63ms. Allocated memory was 331.4MB in the beginning and 483.4MB in the end (delta: 152.0MB). Free memory was 278.6MB in the beginning and 209.7MB in the end (delta: 68.9MB). Peak memory consumption was 221.9MB. Max. memory is 8.0GB. [2023-12-16 04:25:06,478 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 235.9MB. Free memory is still 187.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:25:06,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.02ms. Allocated memory is still 331.4MB. Free memory was 278.6MB in the beginning and 264.5MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 04:25:06,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.91ms. Allocated memory is still 331.4MB. Free memory was 264.5MB in the beginning and 261.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:25:06,478 INFO L158 Benchmark]: Boogie Preprocessor took 62.98ms. Allocated memory is still 331.4MB. Free memory was 261.1MB in the beginning and 256.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:25:06,478 INFO L158 Benchmark]: RCFGBuilder took 694.54ms. Allocated memory is still 331.4MB. Free memory was 256.2MB in the beginning and 277.3MB in the end (delta: -21.2MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. [2023-12-16 04:25:06,479 INFO L158 Benchmark]: TraceAbstraction took 6864.24ms. Allocated memory was 331.4MB in the beginning and 483.4MB in the end (delta: 152.0MB). Free memory was 276.3MB in the beginning and 209.7MB in the end (delta: 66.5MB). Peak memory consumption was 219.0MB. Max. memory is 8.0GB. [2023-12-16 04:25:06,480 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.16ms. Allocated memory is still 235.9MB. Free memory is still 187.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.02ms. Allocated memory is still 331.4MB. Free memory was 278.6MB in the beginning and 264.5MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.91ms. Allocated memory is still 331.4MB. Free memory was 264.5MB in the beginning and 261.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.98ms. Allocated memory is still 331.4MB. Free memory was 261.1MB in the beginning and 256.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 694.54ms. Allocated memory is still 331.4MB. Free memory was 256.2MB in the beginning and 277.3MB in the end (delta: -21.2MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. * TraceAbstraction took 6864.24ms. Allocated memory was 331.4MB in the beginning and 483.4MB in the end (delta: 152.0MB). Free memory was 276.3MB in the beginning and 209.7MB in the end (delta: 66.5MB). Peak memory consumption was 219.0MB. 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 someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of bitwise operation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L22] signed short int var_1_1 = -5; [L23] signed short int* 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 short int var_1_5 = 256; [L26] unsigned short int var_1_5 = 256; [L27] unsigned short int* var_1_5_Pointer = &(var_1_5); [L28] unsigned short int var_1_6 = 44772; [L28] unsigned short int var_1_6 = 44772; [L29] unsigned short int* var_1_6_Pointer = &(var_1_6); [L30] float var_1_7 = 5.9; [L30] float var_1_7 = 5.9; [L31] float* var_1_7_Pointer = &(var_1_7); [L32] float var_1_8 = 7.6; [L32] float var_1_8 = 7.6; [L33] float* var_1_8_Pointer = &(var_1_8); [L34] float var_1_9 = 64.2; [L34] float var_1_9 = 64.2; [L35] float* var_1_9_Pointer = &(var_1_9); [L36] float var_1_10 = 128.75; [L36] float var_1_10 = 128.75; [L37] float* var_1_10_Pointer = &(var_1_10); [L38] unsigned long int var_1_11 = 8; [L38] unsigned long int var_1_11 = 8; [L39] unsigned long int* var_1_11_Pointer = &(var_1_11); [L40] unsigned long int var_1_12 = 3135928546; [L40] unsigned long int var_1_12 = 3135928546; [L41] unsigned long int* var_1_12_Pointer = &(var_1_12); [L42] signed short int last_1_var_1_1 = -5; [L43] unsigned long int last_1_var_1_11 = 8; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] EXPR \read(var_1_1) [L93] last_1_var_1_1 = var_1_1 [L94] EXPR \read(var_1_11) [L94] last_1_var_1_11 = var_1_11 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L76] var_1_4 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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}] [L77] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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=8, last_1_var_1_1=-5, 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_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}] [L77] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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}] [L78] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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}] [L78] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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=8, last_1_var_1_1=-5, 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_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}] [L78] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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}] [L79] var_1_6 = __VERIFIER_nondet_ushort() [L80] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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}] [L80] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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=8, last_1_var_1_1=-5, 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_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}] [L80] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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}] [L81] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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}] [L81] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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=8, last_1_var_1_1=-5, 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_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}] [L81] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] var_1_8 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_8) [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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 var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F [L83] EXPR \read(var_1_8) [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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 (var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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 (var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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=8, last_1_var_1_1=-5, 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_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_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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_9 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_9) [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F [L85] EXPR \read(var_1_9) [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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=8, last_1_var_1_1=-5, 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_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_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] var_1_10 = __VERIFIER_nondet_float() [L87] EXPR \read(var_1_10) [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L87] EXPR \read(var_1_10) [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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=8, last_1_var_1_1=-5, 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_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] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] var_1_12 = __VERIFIER_nondet_ulong() [L89] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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=8, last_1_var_1_1=-5, 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_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_12 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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=8, last_1_var_1_1=-5, 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_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] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] RET updateVariables() [L106] CALL step() [L47] signed long int stepLocal_0 = last_1_var_1_1; [L48] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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}] [L48] COND TRUE (*(var_1_4_Pointer)) [L49] (*(var_1_5_Pointer)) = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR \read(*var_1_5_Pointer) [L55] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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 TRUE (*(var_1_5_Pointer)) == (*(var_1_5_Pointer)) [L56] EXPR \read(*var_1_5_Pointer) [L56] (*(var_1_1_Pointer)) = ((*(var_1_5_Pointer)) + -16) [L62] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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 !(last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) [L65] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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}] [L65] COND TRUE 5.7 < (*(var_1_9_Pointer)) [L66] (*(var_1_11_Pointer)) = last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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}] [L71] EXPR \read(*var_1_1_Pointer) [L71] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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}] [L71] COND TRUE (*(var_1_1_Pointer)) < (*(var_1_5_Pointer)) [L72] EXPR \read(*var_1_8_Pointer) [L72] EXPR \read(*var_1_9_Pointer) [L72] EXPR \read(*var_1_10_Pointer) [L72] (*(var_1_7_Pointer)) = (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1) [L97] EXPR \read(*var_1_1_Pointer) [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) [L97] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1) [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) [L97] EXPR \read(*var_1_1_Pointer) [L97] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1 [L97] EXPR \read(*var_1_7_Pointer) [L97] EXPR \read(*var_1_8_Pointer) [L97] EXPR \read(*var_1_9_Pointer) [L97] EXPR \read(*var_1_10_Pointer) [L97] EXPR ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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] EXPR (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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-L98] return (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, 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_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=8, last_1_var_1_1=-5, 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_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, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 11, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3519 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3518 mSDsluCounter, 8934 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7045 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1860 IncrementalHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 1889 mSDtfsCounter, 1860 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=513occurred in iteration=10, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1470 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 944 NumberOfCodeBlocks, 944 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 846 ConstructedInterpolants, 0 QuantifiedInterpolants, 2617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 1440/1440 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-16 04:25:06,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...