/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-60.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:30:57,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:30:57,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:30:57,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:30:57,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:30:57,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:30:57,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:30:57,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:30:57,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:30:57,893 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:30:57,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:30:57,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:30:57,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:30:57,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:30:57,895 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:30:57,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:30:57,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:30:57,895 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:30:57,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:30:57,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:30:57,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:30:57,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:30:57,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:30:57,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:30:57,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:30:57,897 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:30:57,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:30:57,897 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:30:57,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:30:57,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:30:57,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:30:57,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:30:57,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:30:57,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:30:57,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:30:57,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:30:57,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:30:57,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:30:57,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:30:57,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:30:57,899 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:30:57,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:30:57,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:30:57,900 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:30:58,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:30:58,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:30:58,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:30:58,058 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:30:58,058 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:30:58,059 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-60.i [2023-12-15 21:30:59,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:30:59,262 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:30:59,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-60.i [2023-12-15 21:30:59,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c425a73d/8fdfdb9df26b4eef8ff6fd5eb52185f2/FLAGba4ae2c2a [2023-12-15 21:30:59,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c425a73d/8fdfdb9df26b4eef8ff6fd5eb52185f2 [2023-12-15 21:30:59,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:30:59,284 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:30:59,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:30:59,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:30:59,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:30:59,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6edaef8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59, skipping insertion in model container [2023-12-15 21:30:59,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:30:59,401 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-60.i[916,929] [2023-12-15 21:30:59,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:30:59,457 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:30:59,469 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-60.i[916,929] [2023-12-15 21:30:59,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:30:59,505 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:30:59,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59 WrapperNode [2023-12-15 21:30:59,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:30:59,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:30:59,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:30:59,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:30:59,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,556 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2023-12-15 21:30:59,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:30:59,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:30:59,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:30:59,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:30:59,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,593 INFO L175 MemorySlicer]: Split 130 memory accesses to 6 slices as follows [2, 14, 30, 59, 13, 12]. 45 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 4, 7, 2, 1]. The 18 writes are split as follows [0, 2, 4, 8, 3, 1]. [2023-12-15 21:30:59,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:30:59,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:30:59,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:30:59,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:30:59,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (1/1) ... [2023-12-15 21:30:59,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:30:59,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:59,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:30:59,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:30:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:30:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:30:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:30:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:30:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:30:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:30:59,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:30:59,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:30:59,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:30:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:30:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:30:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:30:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:30:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:30:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:30:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:30:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:30:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:30:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:30:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:30:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:30:59,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:30:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:30:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:30:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:30:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:30:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:30:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:30:59,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:30:59,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:30:59,836 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:30:59,837 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:31:00,156 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:31:00,192 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:31:00,192 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:31:00,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:31:00 BoogieIcfgContainer [2023-12-15 21:31:00,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:31:00,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:31:00,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:31:00,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:31:00,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:30:59" (1/3) ... [2023-12-15 21:31:00,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737b1191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:31:00, skipping insertion in model container [2023-12-15 21:31:00,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:59" (2/3) ... [2023-12-15 21:31:00,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737b1191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:31:00, skipping insertion in model container [2023-12-15 21:31:00,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:31:00" (3/3) ... [2023-12-15 21:31:00,198 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-60.i [2023-12-15 21:31:00,211 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:31:00,211 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:31:00,262 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:31:00,268 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;@540c7e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:31:00,268 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:31:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 94 states have (on average 1.5) internal successors, (141), 95 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:31:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-15 21:31:00,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:00,290 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:00,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:00,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:00,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1865273767, now seen corresponding path program 1 times [2023-12-15 21:31:00,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:00,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145072050] [2023-12-15 21:31:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:31:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:31:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:31:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:31:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:31:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:31:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:31:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:31:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:31:00,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:00,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145072050] [2023-12-15 21:31:00,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145072050] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:00,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:00,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:31:00,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839962893] [2023-12-15 21:31:00,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:00,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:31:00,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:00,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:31:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:31:00,639 INFO L87 Difference]: Start difference. First operand has 112 states, 94 states have (on average 1.5) internal successors, (141), 95 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:31:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:00,676 INFO L93 Difference]: Finished difference Result 221 states and 355 transitions. [2023-12-15 21:31:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:31:00,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2023-12-15 21:31:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:00,685 INFO L225 Difference]: With dead ends: 221 [2023-12-15 21:31:00,686 INFO L226 Difference]: Without dead ends: 110 [2023-12-15 21:31:00,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:31:00,694 INFO L413 NwaCegarLoop]: 162 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, 162 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:00,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:00,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-15 21:31:00,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-12-15 21:31:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:31:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 166 transitions. [2023-12-15 21:31:00,751 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 166 transitions. Word has length 129 [2023-12-15 21:31:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:00,751 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 166 transitions. [2023-12-15 21:31:00,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:31:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 166 transitions. [2023-12-15 21:31:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-15 21:31:00,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:00,760 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:00,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:31:00,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:00,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash 828310565, now seen corresponding path program 1 times [2023-12-15 21:31:00,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:00,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141907972] [2023-12-15 21:31:00,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:31:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:31:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:31:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:31:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:31:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:31:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:31:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:31:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:31:01,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:01,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141907972] [2023-12-15 21:31:01,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141907972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:01,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:01,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:01,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511620482] [2023-12-15 21:31:01,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:01,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:01,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:01,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:01,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:01,071 INFO L87 Difference]: Start difference. First operand 110 states and 166 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:31:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:01,137 INFO L93 Difference]: Finished difference Result 225 states and 340 transitions. [2023-12-15 21:31:01,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:31:01,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2023-12-15 21:31:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:01,138 INFO L225 Difference]: With dead ends: 225 [2023-12-15 21:31:01,138 INFO L226 Difference]: Without dead ends: 116 [2023-12-15 21:31:01,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:01,140 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 10 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 475 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-15 21:31:01,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 475 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-15 21:31:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2023-12-15 21:31:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 95 states have internal predecessors, (138), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:31:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 168 transitions. [2023-12-15 21:31:01,149 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 168 transitions. Word has length 129 [2023-12-15 21:31:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:01,149 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 168 transitions. [2023-12-15 21:31:01,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:31:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 168 transitions. [2023-12-15 21:31:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-15 21:31:01,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:01,151 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:01,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:31:01,151 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:01,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:01,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1048172253, now seen corresponding path program 1 times [2023-12-15 21:31:01,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:01,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920938901] [2023-12-15 21:31:01,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:01,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:31:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:31:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:31:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:31:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:31:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:31:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:31:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:31:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:31:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:31:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:31:01,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:01,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920938901] [2023-12-15 21:31:01,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920938901] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:01,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:01,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:01,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287616846] [2023-12-15 21:31:01,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:01,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:01,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:01,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:01,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:01,362 INFO L87 Difference]: Start difference. First operand 112 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:31:01,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:01,422 INFO L93 Difference]: Finished difference Result 245 states and 368 transitions. [2023-12-15 21:31:01,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:31:01,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-12-15 21:31:01,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:01,425 INFO L225 Difference]: With dead ends: 245 [2023-12-15 21:31:01,426 INFO L226 Difference]: Without dead ends: 134 [2023-12-15 21:31:01,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:01,427 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 45 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:01,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 485 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-15 21:31:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2023-12-15 21:31:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.443298969072165) internal successors, (140), 97 states have internal predecessors, (140), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:31:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 170 transitions. [2023-12-15 21:31:01,435 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 170 transitions. Word has length 129 [2023-12-15 21:31:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:01,435 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 170 transitions. [2023-12-15 21:31:01,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:31:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 170 transitions. [2023-12-15 21:31:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-15 21:31:01,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:01,446 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:01,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:31:01,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:01,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:01,447 INFO L85 PathProgramCache]: Analyzing trace with hash -990913951, now seen corresponding path program 1 times [2023-12-15 21:31:01,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:01,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539045696] [2023-12-15 21:31:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:31:01,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:31:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:31:01,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:31:01,686 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:31:01,687 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:31:01,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:31:01,691 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-15 21:31:01,693 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:31:01,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:31:01 BoogieIcfgContainer [2023-12-15 21:31:01,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:31:01,789 INFO L158 Benchmark]: Toolchain (without parser) took 2504.88ms. Allocated memory is still 328.2MB. Free memory was 280.6MB in the beginning and 185.7MB in the end (delta: 95.0MB). Peak memory consumption was 95.2MB. Max. memory is 8.0GB. [2023-12-15 21:31:01,789 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 228.6MB. Free memory was 176.9MB in the beginning and 176.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:31:01,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.31ms. Allocated memory is still 328.2MB. Free memory was 280.6MB in the beginning and 265.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:31:01,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.53ms. Allocated memory is still 328.2MB. Free memory was 265.6MB in the beginning and 261.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:31:01,790 INFO L158 Benchmark]: Boogie Preprocessor took 86.13ms. Allocated memory is still 328.2MB. Free memory was 261.5MB in the beginning and 256.5MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:31:01,790 INFO L158 Benchmark]: RCFGBuilder took 549.38ms. Allocated memory is still 328.2MB. Free memory was 256.5MB in the beginning and 276.0MB in the end (delta: -19.5MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. [2023-12-15 21:31:01,791 INFO L158 Benchmark]: TraceAbstraction took 1594.68ms. Allocated memory is still 328.2MB. Free memory was 274.9MB in the beginning and 185.7MB in the end (delta: 89.3MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. [2023-12-15 21:31:01,800 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.10ms. Allocated memory is still 228.6MB. Free memory was 176.9MB in the beginning and 176.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.31ms. Allocated memory is still 328.2MB. Free memory was 280.6MB in the beginning and 265.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.53ms. Allocated memory is still 328.2MB. Free memory was 265.6MB in the beginning and 261.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 86.13ms. Allocated memory is still 328.2MB. Free memory was 261.5MB in the beginning and 256.5MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 549.38ms. Allocated memory is still 328.2MB. Free memory was 256.5MB in the beginning and 276.0MB in the end (delta: -19.5MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. * TraceAbstraction took 1594.68ms. Allocated memory is still 328.2MB. Free memory was 274.9MB in the beginning and 185.7MB in the end (delta: 89.3MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryArithmeticDOUBLEoperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryArithmeticFLOAToperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[2][2] = { {2.5, 64.25}, {31.2, 9999.6} }; [L25-L27] double double_Array_0[2][2] = { {2.5, 64.25}, {31.2, 9999.6} }; [L25-L27] double double_Array_0[2][2] = { {2.5, 64.25}, {31.2, 9999.6} }; [L25-L27] double double_Array_0[2][2] = { {2.5, 64.25}, {31.2, 9999.6} }; [L25-L27] double double_Array_0[2][2] = { {2.5, 64.25}, {31.2, 9999.6} }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L28-L30] float float_Array_0[7] = { 10.5, 4.4, 64.8, 5.8, 32.902, 8.6, 999.375 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { 10, 1 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { 10, 1 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { 10, 1 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 2 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 2 }; [L37] float last_1_float_Array_0_5_ = 8.6; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] EXPR float_Array_0[5] [L95] last_1_float_Array_0_5_ = float_Array_0[5] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L68] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L68] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] double_Array_0[1][0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[1][0] [L74] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L74] EXPR double_Array_0[1][0] [L74] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] double_Array_0[0][1] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[0][1] [L76] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F [L76] EXPR double_Array_0[0][1] [L76] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] CALL assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] RET assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854765600e+12F && double_Array_0[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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] float_Array_0[0] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -230584.3009213691390e+13F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -230584.3009213691390e+13F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 2305843.009213691390e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 2305843.009213691390e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 2305843.009213691390e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[0] >= -230584.3009213691390e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 2305843.009213691390e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] float_Array_0[1] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= -115292.1504606845700e+13F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= -115292.1504606845700e+13F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 1152921.504606845700e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 1152921.504606845700e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 1152921.504606845700e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[1] >= -115292.1504606845700e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 1152921.504606845700e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] float_Array_0[2] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[2] [L82] EXPR float_Array_0[2] >= 0.0F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L82] EXPR float_Array_0[2] [L82] EXPR float_Array_0[2] >= 0.0F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] float_Array_0[4] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[4] [L84] EXPR float_Array_0[4] >= 0.0F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F [L84] EXPR float_Array_0[4] [L84] EXPR float_Array_0[4] >= 0.0F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 4611686.018427382800e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 4611686.018427382800e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 4611686.018427382800e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 4611686.018427382800e+12F && float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] float_Array_0[6] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[6] [L86] EXPR float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] EXPR float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F [L86] EXPR float_Array_0[6] [L86] EXPR float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] EXPR (float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F) || (float_Array_0[6] <= 1152921.504606845700e+12F && float_Array_0[6] >= 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] EXPR (float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F) || (float_Array_0[6] <= 1152921.504606845700e+12F && float_Array_0[6] >= 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] CALL assume_abort_if_not((float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F) || (float_Array_0[6] <= 1152921.504606845700e+12F && float_Array_0[6] >= 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] RET assume_abort_if_not((float_Array_0[6] >= -115292.1504606845700e+13F && float_Array_0[6] <= -1.0e-20F) || (float_Array_0[6] <= 1152921.504606845700e+12F && float_Array_0[6] >= 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L88] EXPR signed_long_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] EXPR signed_long_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L91] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L106] RET updateVariables() [L107] CALL step() [L41] EXPR double_Array_0[0][1] [L41] EXPR double_Array_0[1][0] [L41] double_Array_0[1][1] = (double_Array_0[0][1] - double_Array_0[1][0]) [L42] EXPR unsigned_char_Array_0[0] [L42] EXPR signed_long_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L42] COND FALSE !((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) [L51] EXPR BOOL_unsigned_char_Array_0[0] [L51] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L52] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L52] COND TRUE BOOL_unsigned_char_Array_0[1] && stepLocal_0 [L53] EXPR float_Array_0[2] [L53] EXPR float_Array_0[4] [L53] EXPR float_Array_0[0] [L53] EXPR float_Array_0[1] [L53] EXPR float_Array_0[6] [L53] float_Array_0[3] = ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))) [L55] double_Array_0[0][0] = 500.25 [L56] EXPR double_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] COND FALSE !(double_Array_0[0][1] > last_1_float_Array_0_5_) [L63] EXPR float_Array_0[0] [L63] float_Array_0[5] = float_Array_0[0] [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR double_Array_0[1][1] [L98] EXPR double_Array_0[0][1] [L98] EXPR double_Array_0[1][0] [L98] EXPR (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR (double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR ((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR ((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR (((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1)) && (double_Array_0[0][0] == ((double) 500.25)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR (((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1)) && (double_Array_0[0][0] == ((double) 500.25)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR ((((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1)) && (double_Array_0[0][0] == ((double) 500.25))) && ((double_Array_0[0][1] > last_1_float_Array_0_5_) ? (BOOL_unsigned_char_Array_0[0] ? ((double_Array_0[1][0] <= ((((last_1_float_Array_0_5_) < (float_Array_0[4])) ? (last_1_float_Array_0_5_) : (float_Array_0[4])))) ? (float_Array_0[5] == ((float) (float_Array_0[6] + float_Array_0[4]))) : 1) : 1) : (float_Array_0[5] == ((float) float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] EXPR ((((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1)) && (double_Array_0[0][0] == ((double) 500.25))) && ((double_Array_0[0][1] > last_1_float_Array_0_5_) ? (BOOL_unsigned_char_Array_0[0] ? ((double_Array_0[1][0] <= ((((last_1_float_Array_0_5_) < (float_Array_0[4])) ? (last_1_float_Array_0_5_) : (float_Array_0[4])))) ? (float_Array_0[5] == ((float) (float_Array_0[6] + float_Array_0[4]))) : 1) : 1) : (float_Array_0[5] == ((float) float_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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98-L99] return ((((double_Array_0[1][1] == ((double) (double_Array_0[0][1] - double_Array_0[1][0]))) && (((- unsigned_char_Array_0[0]) >= signed_long_int_Array_0[0]) ? ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? ((double_Array_0[1][0] == double_Array_0[1][1]) ? (signed_long_int_Array_0[1] == ((signed long int) (256 - (unsigned_char_Array_0[0] + 5)))) : (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[0]))) : 1) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (float_Array_0[3] == ((float) ((float_Array_0[2] - float_Array_0[4]) + (float_Array_0[0] + (float_Array_0[1] + float_Array_0[6]))))) : 1)) && (double_Array_0[0][0] == ((double) 500.25))) && ((double_Array_0[0][1] > last_1_float_Array_0_5_) ? (BOOL_unsigned_char_Array_0[0] ? ((double_Array_0[1][0] <= ((((last_1_float_Array_0_5_) < (float_Array_0[4])) ? (last_1_float_Array_0_5_) : (float_Array_0[4])))) ? (float_Array_0[5] == ((float) (float_Array_0[6] + float_Array_0[4]))) : 1) : 1) : (float_Array_0[5] == ((float) float_Array_0[0]))) ; [L108] RET, EXPR property() [L108] 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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8: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_float_Array_0_5_=43/5, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 1122 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 640 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 482 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=3, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1260/1260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 21:31:01,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...