/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 14:58:42,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 14:58:42,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 14:58:42,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 14:58:42,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 14:58:42,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 14:58:42,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 14:58:42,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 14:58:42,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 14:58:42,204 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 14:58:42,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 14:58:42,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 14:58:42,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 14:58:42,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 14:58:42,206 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 14:58:42,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 14:58:42,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 14:58:42,206 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 14:58:42,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 14:58:42,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 14:58:42,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 14:58:42,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 14:58:42,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 14:58:42,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 14:58:42,208 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 14:58:42,208 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 14:58:42,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 14:58:42,209 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 14:58:42,209 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 14:58:42,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 14:58:42,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 14:58:42,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 14:58:42,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:58:42,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 14:58:42,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 14:58:42,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 14:58:42,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 14:58:42,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 14:58:42,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 14:58:42,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 14:58:42,211 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 14:58:42,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 14:58:42,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 14:58:42,211 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 14:58:42,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 14:58:42,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 14:58:42,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 14:58:42,415 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 14:58:42,416 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 14:58:42,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i [2023-12-19 14:58:43,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 14:58:43,633 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 14:58:43,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i [2023-12-19 14:58:43,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa56af628/a427342f0ae747ed9e0d62893fe91788/FLAG3b7f6a90f [2023-12-19 14:58:43,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa56af628/a427342f0ae747ed9e0d62893fe91788 [2023-12-19 14:58:43,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 14:58:43,661 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 14:58:43,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 14:58:43,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 14:58:43,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 14:58:43,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:43,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2f0c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43, skipping insertion in model container [2023-12-19 14:58:43,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:43,693 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 14:58:43,812 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-a_file-17.i[916,929] [2023-12-19 14:58:43,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:58:43,899 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 14:58:43,909 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-a_file-17.i[916,929] [2023-12-19 14:58:43,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:58:43,974 INFO L206 MainTranslator]: Completed translation [2023-12-19 14:58:43,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43 WrapperNode [2023-12-19 14:58:43,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 14:58:43,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 14:58:43,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 14:58:43,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 14:58:43,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,067 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 626 [2023-12-19 14:58:44,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 14:58:44,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 14:58:44,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 14:58:44,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 14:58:44,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,112 INFO L175 MemorySlicer]: Split 156 memory accesses to 7 slices as follows [2, 14, 89, 3, 21, 22, 5]. 57 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 7, 1, 3, 2, 1]. The 19 writes are split as follows [0, 2, 7, 1, 5, 3, 1]. [2023-12-19 14:58:44,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 14:58:44,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 14:58:44,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 14:58:44,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 14:58:44,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (1/1) ... [2023-12-19 14:58:44,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:58:44,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 14:58:44,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 14:58:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 14:58:44,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 14:58:44,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 14:58:44,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 14:58:44,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 14:58:44,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 14:58:44,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-19 14:58:44,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-19 14:58:44,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-19 14:58:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 14:58:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 14:58:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 14:58:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 14:58:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 14:58:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-19 14:58:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-19 14:58:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 14:58:44,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 14:58:44,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 14:58:44,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 14:58:44,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-19 14:58:44,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-19 14:58:44,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-19 14:58:44,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 14:58:44,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 14:58:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 14:58:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 14:58:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 14:58:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-19 14:58:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-19 14:58:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 14:58:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 14:58:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 14:58:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 14:58:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-19 14:58:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-19 14:58:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-19 14:58:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 14:58:44,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 14:58:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 14:58:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 14:58:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 14:58:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 14:58:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 14:58:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-19 14:58:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-19 14:58:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 14:58:44,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 14:58:44,454 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 14:58:44,456 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 14:58:44,909 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 14:58:44,937 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 14:58:44,937 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 14:58:44,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:58:44 BoogieIcfgContainer [2023-12-19 14:58:44,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 14:58:44,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 14:58:44,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 14:58:44,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 14:58:44,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:58:43" (1/3) ... [2023-12-19 14:58:44,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f39cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:58:44, skipping insertion in model container [2023-12-19 14:58:44,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:43" (2/3) ... [2023-12-19 14:58:44,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f39cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:58:44, skipping insertion in model container [2023-12-19 14:58:44,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:58:44" (3/3) ... [2023-12-19 14:58:44,943 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-17.i [2023-12-19 14:58:44,956 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 14:58:44,957 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 14:58:44,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 14:58:45,004 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;@40cfc749, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 14:58:45,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 14:58:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 14:58:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-19 14:58:45,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:45,020 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:45,021 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:45,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:45,024 INFO L85 PathProgramCache]: Analyzing trace with hash 317667774, now seen corresponding path program 1 times [2023-12-19 14:58:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:45,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317330395] [2023-12-19 14:58:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 14:58:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 14:58:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 14:58:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 14:58:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 14:58:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 14:58:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:58:45,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:45,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317330395] [2023-12-19 14:58:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317330395] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:45,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:45,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 14:58:45,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966411938] [2023-12-19 14:58:45,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:45,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 14:58:45,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:45,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 14:58:45,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 14:58:45,410 INFO L87 Difference]: Start difference. First operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 14:58:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:45,455 INFO L93 Difference]: Finished difference Result 271 states and 428 transitions. [2023-12-19 14:58:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 14:58:45,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2023-12-19 14:58:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:45,463 INFO L225 Difference]: With dead ends: 271 [2023-12-19 14:58:45,463 INFO L226 Difference]: Without dead ends: 135 [2023-12-19 14:58:45,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 14:58:45,468 INFO L413 NwaCegarLoop]: 198 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, 198 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:45,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-19 14:58:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-12-19 14:58:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.452991452991453) internal successors, (170), 117 states have internal predecessors, (170), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 14:58:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2023-12-19 14:58:45,501 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 136 [2023-12-19 14:58:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:45,502 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2023-12-19 14:58:45,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 14:58:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2023-12-19 14:58:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-19 14:58:45,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:45,504 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:45,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 14:58:45,505 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:45,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1627642390, now seen corresponding path program 1 times [2023-12-19 14:58:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:45,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953454802] [2023-12-19 14:58:45,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 14:58:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 14:58:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 14:58:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 14:58:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 14:58:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 14:58:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:58:45,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:45,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953454802] [2023-12-19 14:58:45,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953454802] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:45,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:45,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 14:58:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315474432] [2023-12-19 14:58:45,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:45,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 14:58:45,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:45,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 14:58:45,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 14:58:45,822 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 14:58:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:45,881 INFO L93 Difference]: Finished difference Result 275 states and 412 transitions. [2023-12-19 14:58:45,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 14:58:45,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2023-12-19 14:58:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:45,883 INFO L225 Difference]: With dead ends: 275 [2023-12-19 14:58:45,883 INFO L226 Difference]: Without dead ends: 141 [2023-12-19 14:58:45,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:58:45,884 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 10 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:45,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 586 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:45,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-19 14:58:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2023-12-19 14:58:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 14:58:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2023-12-19 14:58:45,894 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 136 [2023-12-19 14:58:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:45,894 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2023-12-19 14:58:45,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 14:58:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2023-12-19 14:58:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-19 14:58:45,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:45,896 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:45,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 14:58:45,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:45,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1599142100, now seen corresponding path program 1 times [2023-12-19 14:58:45,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:45,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363248494] [2023-12-19 14:58:45,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:45,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 14:58:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 14:58:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 14:58:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 14:58:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 14:58:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 14:58:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:58:46,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:46,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363248494] [2023-12-19 14:58:46,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363248494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:46,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:46,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 14:58:46,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300374927] [2023-12-19 14:58:46,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:46,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 14:58:46,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:46,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 14:58:46,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 14:58:46,154 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:58:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:46,199 INFO L93 Difference]: Finished difference Result 307 states and 458 transitions. [2023-12-19 14:58:46,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 14:58:46,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2023-12-19 14:58:46,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:46,205 INFO L225 Difference]: With dead ends: 307 [2023-12-19 14:58:46,205 INFO L226 Difference]: Without dead ends: 171 [2023-12-19 14:58:46,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:58:46,211 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 66 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:46,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 574 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-19 14:58:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 139. [2023-12-19 14:58:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 14:58:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2023-12-19 14:58:46,219 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 206 transitions. Word has length 136 [2023-12-19 14:58:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:46,220 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 206 transitions. [2023-12-19 14:58:46,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:58:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2023-12-19 14:58:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 14:58:46,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:46,231 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:46,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 14:58:46,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:46,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:46,231 INFO L85 PathProgramCache]: Analyzing trace with hash 142937969, now seen corresponding path program 1 times [2023-12-19 14:58:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:46,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212354596] [2023-12-19 14:58:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:46,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 14:58:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 14:58:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 14:58:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 14:58:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 14:58:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 14:58:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:58:46,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:46,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212354596] [2023-12-19 14:58:46,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212354596] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:46,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:46,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 14:58:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988142359] [2023-12-19 14:58:46,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:46,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 14:58:46,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:46,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 14:58:46,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:58:46,665 INFO L87 Difference]: Start difference. First operand 139 states and 206 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:58:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:46,733 INFO L93 Difference]: Finished difference Result 302 states and 448 transitions. [2023-12-19 14:58:46,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 14:58:46,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-12-19 14:58:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:46,735 INFO L225 Difference]: With dead ends: 302 [2023-12-19 14:58:46,735 INFO L226 Difference]: Without dead ends: 164 [2023-12-19 14:58:46,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 14:58:46,744 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 191 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:46,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 651 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-19 14:58:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 141. [2023-12-19 14:58:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 123 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 14:58:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2023-12-19 14:58:46,756 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 138 [2023-12-19 14:58:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:46,756 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2023-12-19 14:58:46,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:58:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2023-12-19 14:58:46,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 14:58:46,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:46,758 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:46,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 14:58:46,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:46,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:46,758 INFO L85 PathProgramCache]: Analyzing trace with hash -666408657, now seen corresponding path program 1 times [2023-12-19 14:58:46,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:46,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648992257] [2023-12-19 14:58:46,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 14:58:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 14:58:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 14:58:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 14:58:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 14:58:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 14:58:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:58:47,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:47,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648992257] [2023-12-19 14:58:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648992257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:47,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:47,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 14:58:47,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121205371] [2023-12-19 14:58:47,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:47,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 14:58:47,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:47,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 14:58:47,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:47,441 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:58:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:47,674 INFO L93 Difference]: Finished difference Result 588 states and 868 transitions. [2023-12-19 14:58:47,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 14:58:47,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-12-19 14:58:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:47,680 INFO L225 Difference]: With dead ends: 588 [2023-12-19 14:58:47,680 INFO L226 Difference]: Without dead ends: 448 [2023-12-19 14:58:47,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-19 14:58:47,681 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 552 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:47,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1473 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:58:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-12-19 14:58:47,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 418. [2023-12-19 14:58:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 366 states have (on average 1.4289617486338797) internal successors, (523), 366 states have internal predecessors, (523), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 14:58:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2023-12-19 14:58:47,718 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 138 [2023-12-19 14:58:47,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:47,718 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2023-12-19 14:58:47,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 14:58:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2023-12-19 14:58:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 14:58:47,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:47,720 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:47,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 14:58:47,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:47,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:47,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1463924049, now seen corresponding path program 1 times [2023-12-19 14:58:47,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:47,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84914857] [2023-12-19 14:58:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:47,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 14:58:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 14:58:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 14:58:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 14:58:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 14:58:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 14:58:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 14:58:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84914857] [2023-12-19 14:58:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84914857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:48,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:48,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:58:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307981487] [2023-12-19 14:58:48,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:48,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:58:48,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:48,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:58:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:58:48,087 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 14:58:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:48,179 INFO L93 Difference]: Finished difference Result 1149 states and 1688 transitions. [2023-12-19 14:58:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 14:58:48,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2023-12-19 14:58:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:48,182 INFO L225 Difference]: With dead ends: 1149 [2023-12-19 14:58:48,182 INFO L226 Difference]: Without dead ends: 732 [2023-12-19 14:58:48,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:48,184 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 189 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:48,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 948 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2023-12-19 14:58:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 622. [2023-12-19 14:58:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 561 states have (on average 1.429590017825312) internal successors, (802), 564 states have internal predecessors, (802), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-19 14:58:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 910 transitions. [2023-12-19 14:58:48,213 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 910 transitions. Word has length 138 [2023-12-19 14:58:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:48,213 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 910 transitions. [2023-12-19 14:58:48,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 14:58:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 910 transitions. [2023-12-19 14:58:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-19 14:58:48,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:48,215 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:48,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 14:58:48,215 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:48,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash 565057346, now seen corresponding path program 1 times [2023-12-19 14:58:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:48,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646931695] [2023-12-19 14:58:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:48,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 14:58:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 14:58:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 14:58:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 14:58:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 14:58:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-19 14:58:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-19 14:58:48,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:48,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646931695] [2023-12-19 14:58:48,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646931695] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:48,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:48,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 14:58:48,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608430994] [2023-12-19 14:58:48,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:48,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 14:58:48,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:48,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 14:58:48,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-19 14:58:48,861 INFO L87 Difference]: Start difference. First operand 622 states and 910 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 14:58:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:49,595 INFO L93 Difference]: Finished difference Result 1178 states and 1700 transitions. [2023-12-19 14:58:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-19 14:58:49,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2023-12-19 14:58:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:49,601 INFO L225 Difference]: With dead ends: 1178 [2023-12-19 14:58:49,601 INFO L226 Difference]: Without dead ends: 971 [2023-12-19 14:58:49,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2023-12-19 14:58:49,603 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 691 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:49,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1947 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 14:58:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2023-12-19 14:58:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 427. [2023-12-19 14:58:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 384 states have (on average 1.421875) internal successors, (546), 386 states have internal predecessors, (546), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 14:58:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 618 transitions. [2023-12-19 14:58:49,629 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 618 transitions. Word has length 139 [2023-12-19 14:58:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:49,629 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 618 transitions. [2023-12-19 14:58:49,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 14:58:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 618 transitions. [2023-12-19 14:58:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-19 14:58:49,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:49,631 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:49,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 14:58:49,631 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:49,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2029089083, now seen corresponding path program 1 times [2023-12-19 14:58:49,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:49,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519663970] [2023-12-19 14:58:49,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:49,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:58:49,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 14:58:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:58:49,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 14:58:49,772 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 14:58:49,772 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 14:58:49,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 14:58:49,776 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:49,779 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 14:58:49,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:58:49 BoogieIcfgContainer [2023-12-19 14:58:49,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 14:58:49,862 INFO L158 Benchmark]: Toolchain (without parser) took 6201.80ms. Allocated memory was 199.2MB in the beginning and 330.3MB in the end (delta: 131.1MB). Free memory was 147.5MB in the beginning and 174.9MB in the end (delta: -27.5MB). Peak memory consumption was 105.0MB. Max. memory is 8.0GB. [2023-12-19 14:58:49,862 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 14:58:49,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.33ms. Allocated memory is still 199.2MB. Free memory was 147.5MB in the beginning and 131.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-19 14:58:49,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.89ms. Allocated memory is still 199.2MB. Free memory was 131.8MB in the beginning and 127.2MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 14:58:49,863 INFO L158 Benchmark]: Boogie Preprocessor took 133.70ms. Allocated memory is still 199.2MB. Free memory was 127.2MB in the beginning and 121.3MB in the end (delta: 5.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 14:58:49,863 INFO L158 Benchmark]: RCFGBuilder took 735.35ms. Allocated memory was 199.2MB in the beginning and 262.1MB in the end (delta: 62.9MB). Free memory was 121.2MB in the beginning and 204.1MB in the end (delta: -82.8MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-19 14:58:49,863 INFO L158 Benchmark]: TraceAbstraction took 4923.16ms. Allocated memory was 262.1MB in the beginning and 330.3MB in the end (delta: 68.2MB). Free memory was 203.5MB in the beginning and 174.9MB in the end (delta: 28.6MB). Peak memory consumption was 96.6MB. Max. memory is 8.0GB. [2023-12-19 14:58:49,864 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.13ms. Allocated memory is still 199.2MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 312.33ms. Allocated memory is still 199.2MB. Free memory was 147.5MB in the beginning and 131.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 90.89ms. Allocated memory is still 199.2MB. Free memory was 131.8MB in the beginning and 127.2MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 133.70ms. Allocated memory is still 199.2MB. Free memory was 127.2MB in the beginning and 121.3MB in the end (delta: 5.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 735.35ms. Allocated memory was 199.2MB in the beginning and 262.1MB in the end (delta: 62.9MB). Free memory was 121.2MB in the beginning and 204.1MB in the end (delta: -82.8MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4923.16ms. Allocated memory was 262.1MB in the beginning and 330.3MB in the end (delta: 68.2MB). Free memory was 203.5MB in the beginning and 174.9MB in the end (delta: 28.6MB). Peak memory consumption was 96.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L28-L30] float float_Array_0[1] = { 128.4 }; [L28-L30] float float_Array_0[1] = { 128.4 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 100 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 100 }; [L40] unsigned char last_1_unsigned_char_Array_0_1_ = 16; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] EXPR unsigned_char_Array_0[1] [L102] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] double_Array_0[0] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[0] [L80] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L80] EXPR double_Array_0[0] [L80] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] double_Array_0[2] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] double_Array_0[3] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[3] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F [L86] EXPR double_Array_0[3] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not((double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] double_Array_0[4] = __VERIFIER_nondet_double() [L88] EXPR double_Array_0[4] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F [L88] EXPR double_Array_0[4] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] CALL assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] RET assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] double_Array_0[5] = __VERIFIER_nondet_double() [L90] EXPR double_Array_0[5] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F [L90] EXPR double_Array_0[5] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR (double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR (double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] CALL assume_abort_if_not((double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] RET assume_abort_if_not((double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L91] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L92] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L94] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L95] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L97] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L113] RET updateVariables() [L114] CALL step() [L44] unsigned_long_int_Array_0[0] = last_1_unsigned_char_Array_0_1_ [L45] EXPR unsigned_long_int_Array_0[0] [L45] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[0]; [L46] EXPR signed_short_int_Array_0[0] [L46] signed short int stepLocal_0 = signed_short_int_Array_0[0]; [L47] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L47] COND FALSE !(stepLocal_0 >= signed_short_int_Array_0[1]) [L54] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L57] EXPR double_Array_0[1] [L57] EXPR double_Array_0[0] [L57] EXPR double_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L57] COND FALSE !((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) [L60] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L60] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L65] EXPR unsigned_char_Array_0[1] [L65] signed_short_int_Array_0[2] = unsigned_char_Array_0[1] [L68] EXPR double_Array_0[1] [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] COND FALSE !(double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])))) [L105] EXPR double_Array_0[1] [L105] EXPR double_Array_0[0] [L105] EXPR double_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))) [L105] EXPR signed_short_int_Array_0[2] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR ((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105-L106] return ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 137 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1703 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1699 mSDsluCounter, 6377 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4843 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1106 IncrementalHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 1534 mSDtfsCounter, 1106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=622occurred in iteration=6, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 743 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1100 NumberOfCodeBlocks, 1100 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 2204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3360/3360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 14:58:49,883 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...