/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/ofuf_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:55:43,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:55:43,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:55:43,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:55:43,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:55:43,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:55:43,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:55:43,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:55:43,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:55:43,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:55:43,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:55:43,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:55:43,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:55:43,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:55:43,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:55:43,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:55:43,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:55:43,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:55:43,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:55:43,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:55:43,245 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:55:43,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:55:43,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:55:43,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:55:43,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:55:43,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:55:43,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:55:43,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:55:43,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:55:43,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:55:43,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:55:43,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:55:43,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:55:43,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:55:43,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:55:43,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:55:43,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:55:43,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:55:43,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:55:43,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:55:43,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:55:43,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:55:43,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:55:43,279 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:55:43,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:55:43,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:55:43,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:55:43,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:55:43,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:55:43,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:55:43,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:55:43,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:55:43,282 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:55:43,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:55:43,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:55:43,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:55:43,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:55:43,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:55:43,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:55:43,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:55:43,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:55:43,283 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:55:43,283 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:55:43,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:55:43,283 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:55:43,283 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:55:43,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:55:43,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:55:43,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:55:43,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:55:43,500 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:55:43,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/ofuf_2.c [2022-04-28 09:55:43,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8c78157/90253b9930244887bddd4a645feeee55/FLAG9b272ff9e [2022-04-28 09:55:43,932 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:55:43,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/ofuf_2.c [2022-04-28 09:55:43,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8c78157/90253b9930244887bddd4a645feeee55/FLAG9b272ff9e [2022-04-28 09:55:44,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8c78157/90253b9930244887bddd4a645feeee55 [2022-04-28 09:55:44,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:55:44,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:55:44,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:55:44,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:55:44,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:55:44,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:55:44" (1/1) ... [2022-04-28 09:55:44,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2262e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:55:44, skipping insertion in model container [2022-04-28 09:55:44,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:55:44" (1/1) ... [2022-04-28 09:55:44,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:55:44,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:55:44,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/ofuf_2.c[11342,11355] [2022-04-28 09:55:44,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:55:44,551 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:55:44,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/ofuf_2.c[11342,11355] [2022-04-28 09:55:44,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:55:44,622 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:55:44,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:55:44 WrapperNode [2022-04-28 09:55:44,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:55:44,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:55:44,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:55:44,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:55:44,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:55:44" (1/1) ... [2022-04-28 09:55:44,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:55:44" (1/1) ... [2022-04-28 09:55:44,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:55:44" (1/1) ... [2022-04-28 09:55:44,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:55:44" (1/1) ... [2022-04-28 09:55:44,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:55:44" (1/1) ... [2022-04-28 09:55:44,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:55:44" (1/1) ... [2022-04-28 09:55:44,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:55:44" (1/1) ... [2022-04-28 09:55:44,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:55:44,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:55:44,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:55:44,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:55:44,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:55:44" (1/1) ... [2022-04-28 09:55:44,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:55:44,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:55:44,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:55:44,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:55:44,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:55:44,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:55:44,735 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:55:44,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:55:44,735 INFO L138 BoogieDeclarations]: Found implementation of procedure avoid_zero [2022-04-28 09:55:44,735 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_89 [2022-04-28 09:55:44,736 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_92 [2022-04-28 09:55:44,736 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_95 [2022-04-28 09:55:44,736 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_96 [2022-04-28 09:55:44,736 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_97 [2022-04-28 09:55:44,736 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_99 [2022-04-28 09:55:44,736 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_100 [2022-04-28 09:55:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:55:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:55:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:55:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:55:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:55:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:55:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:55:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure avoid_zero [2022-04-28 09:55:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2022-04-28 09:55:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_89 [2022-04-28 09:55:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_92 [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_95 [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_96 [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_97 [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_99 [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_100 [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:55:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 09:55:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 09:55:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:55:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-04-28 09:55:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:55:44,860 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:55:44,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:55:45,304 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:55:45,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:55:45,313 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-04-28 09:55:45,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:55:45 BoogieIcfgContainer [2022-04-28 09:55:45,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:55:45,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:55:45,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:55:45,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:55:45,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:55:44" (1/3) ... [2022-04-28 09:55:45,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24aa20bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:55:45, skipping insertion in model container [2022-04-28 09:55:45,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:55:44" (2/3) ... [2022-04-28 09:55:45,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24aa20bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:55:45, skipping insertion in model container [2022-04-28 09:55:45,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:55:45" (3/3) ... [2022-04-28 09:55:45,321 INFO L111 eAbstractionObserver]: Analyzing ICFG ofuf_2.c [2022-04-28 09:55:45,330 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:55:45,330 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:55:45,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:55:45,378 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@603b698a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fd3507f [2022-04-28 09:55:45,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:55:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 99 states have (on average 1.5353535353535352) internal successors, (152), 101 states have internal predecessors, (152), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 09:55:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 09:55:45,395 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:55:45,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:55:45,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:55:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:55:45,399 INFO L85 PathProgramCache]: Analyzing trace with hash -540283313, now seen corresponding path program 1 times [2022-04-28 09:55:45,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:55:45,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [544235252] [2022-04-28 09:55:45,410 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:55:45,410 INFO L85 PathProgramCache]: Analyzing trace with hash -540283313, now seen corresponding path program 2 times [2022-04-28 09:55:45,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:55:45,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739129155] [2022-04-28 09:55:45,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:55:45,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:55:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:55:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:55:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:55:45,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(and (= ~Id_MCDC_110~0.offset |old(~Id_MCDC_110~0.offset)|) (= ~Id_MCDC_109~0.offset |old(~Id_MCDC_109~0.offset)|) (= |~#Id_MCDC_112~0.base| |old(~#Id_MCDC_112~0.base)|) (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) (= |old(~Id_MCDC_106~0)| ~Id_MCDC_106~0) (= ~Id_MCDC_107~0.base |old(~Id_MCDC_107~0.base)|) (= |old(~#Id_MCDC_112~0.offset)| |~#Id_MCDC_112~0.offset|) (= ~Id_MCDC_108~0.base |old(~Id_MCDC_108~0.base)|) (= |old(~Id_MCDC_109~0.base)| ~Id_MCDC_109~0.base) (= |old(~#Id_MCDC_113~0.base)| |~#Id_MCDC_113~0.base|) (= |old(~#Id_MCDC_113~0.offset)| |~#Id_MCDC_113~0.offset|) (= |old(~Id_MCDC_110~0.base)| ~Id_MCDC_110~0.base) (= |old(~Id_MCDC_104~0)| ~Id_MCDC_104~0) (= |old(~Id_MCDC_108~0.offset)| ~Id_MCDC_108~0.offset) (= |old(~Id_MCDC_105~0)| ~Id_MCDC_105~0) (= ~Id_MCDC_107~0.offset |old(~Id_MCDC_107~0.offset)|) (= |old(~Id_MCDC_111~0.offset)| ~Id_MCDC_111~0.offset) (= |#NULL.offset| |old(#NULL.offset)|) (= ~Id_MCDC_111~0.base |old(~Id_MCDC_111~0.base)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(114, 4, 0, 1);call write~init~int(115, 4, 1, 1);call write~init~int(118, 4, 2, 1);call write~init~int(100, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(3, 5);call write~init~int(119, 5, 0, 1);call write~init~int(111, 5, 1, 1);call write~init~int(0, 5, 2, 1);call #Ultimate.allocInit(20, 6);call #Ultimate.allocInit(5, 7);call write~init~int(114, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(118, 7, 2, 1);call write~init~int(100, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(119, 8, 0, 1);call write~init~int(111, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(7, 9);call write~init~int(105, 9, 0, 1);call write~init~int(110, 9, 1, 1);call write~init~int(46, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(115, 9, 5, 1);call write~init~int(0, 9, 6, 1);call #Ultimate.allocInit(2, 10);call write~init~int(114, 10, 0, 1);call write~init~int(0, 10, 1, 1);~Id_MCDC_104~0 := 0;~Id_MCDC_105~0 := 0;~Id_MCDC_106~0 := 0;~Id_MCDC_107~0.base, ~Id_MCDC_107~0.offset := 0, 0;~Id_MCDC_108~0.base, ~Id_MCDC_108~0.offset := 0, 0;~Id_MCDC_109~0.base, ~Id_MCDC_109~0.offset := 0, 0;~Id_MCDC_110~0.base, ~Id_MCDC_110~0.offset := 0, 0;~Id_MCDC_111~0.base, ~Id_MCDC_111~0.offset := 0, 0;~#Id_MCDC_112~0.base, ~#Id_MCDC_112~0.offset := 11, 0;call #Ultimate.allocInit(16, 11);call write~init~int(0, ~#Id_MCDC_112~0.base, ~#Id_MCDC_112~0.offset, 4);call write~init~int(0, ~#Id_MCDC_112~0.base, 4 + ~#Id_MCDC_112~0.offset, 4);call write~init~int(0, ~#Id_MCDC_112~0.base, 8 + ~#Id_MCDC_112~0.offset, 4);call write~init~int(0, ~#Id_MCDC_112~0.base, 12 + ~#Id_MCDC_112~0.offset, 4);~#Id_MCDC_113~0.base, ~#Id_MCDC_113~0.offset := 12, 0;call #Ultimate.allocInit(36, 12);call write~init~int(0, ~#Id_MCDC_113~0.base, ~#Id_MCDC_113~0.offset, 1);call write~init~int(0, ~#Id_MCDC_113~0.base, 1 + ~#Id_MCDC_113~0.offset, 2);call write~init~int(0, ~#Id_MCDC_113~0.base, 3 + ~#Id_MCDC_113~0.offset, 1);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 4 + ~#Id_MCDC_113~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 12 + ~#Id_MCDC_113~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 20 + ~#Id_MCDC_113~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 28 + ~#Id_MCDC_113~0.offset, 8);~Id_MCDC_114~0 := 0; {131#true} is VALID [2022-04-28 09:55:45,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume true; {131#true} is VALID [2022-04-28 09:55:45,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131#true} {131#true} #387#return; {131#true} is VALID [2022-04-28 09:55:45,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:55:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:55:45,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~Id_MCDC_123~0;havoc ~Id_MCDC_124~0;havoc ~Id_MCDC_125~0;havoc ~Id_MCDC_126~0;havoc ~Id_MCDC_127~0;call ~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset, 4);havoc ~Id_MCDC_129~0;call ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset, 4);call ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset, 4);~Id_MCDC_35~0 := 0;~Id_MCDC_132~0 := 0;~Id_MCDC_36~0 := 0;~Id_MCDC_133~0 := 0;~Id_MCDC_134~0 := 0;call ~#Id_MCDC_135~0.base, ~#Id_MCDC_135~0.offset := #Ultimate.allocOnStack(4);call ~#Id_MCDC_136~0.base, ~#Id_MCDC_136~0.offset := #Ultimate.allocOnStack(8);havoc ~Id_MCDC_137~0.base, ~Id_MCDC_137~0.offset;havoc ~Id_MCDC_138~0;~Id_MCDC_123~0 := 6144;~Id_MCDC_132~0 := 0; {131#true} is VALID [2022-04-28 09:55:45,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume !(~Id_MCDC_132~0 % 256 < 4); {131#true} is VALID [2022-04-28 09:55:45,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} assume !(~Id_MCDC_123~0 % 4294967296 <= 6147); {131#true} is VALID [2022-04-28 09:55:45,768 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#true} #res := 0;call ULTIMATE.dealloc(~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset);havoc ~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset);havoc ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset);havoc ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_135~0.base, ~#Id_MCDC_135~0.offset);havoc ~#Id_MCDC_135~0.base, ~#Id_MCDC_135~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_136~0.base, ~#Id_MCDC_136~0.offset);havoc ~#Id_MCDC_136~0.base, ~#Id_MCDC_136~0.offset; {131#true} is VALID [2022-04-28 09:55:45,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {131#true} assume true; {131#true} is VALID [2022-04-28 09:55:45,768 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {131#true} {131#true} #367#return; {131#true} is VALID [2022-04-28 09:55:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:55:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:55:45,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#true} ~y := #in~y; {131#true} is VALID [2022-04-28 09:55:45,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume 0 == ~y;assume false; {132#false} is VALID [2022-04-28 09:55:45,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#false} assume true; {132#false} is VALID [2022-04-28 09:55:45,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#false} {131#true} #361#return; {132#false} is VALID [2022-04-28 09:55:45,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {131#true} call ULTIMATE.init(); {146#(and (= ~Id_MCDC_110~0.offset |old(~Id_MCDC_110~0.offset)|) (= ~Id_MCDC_109~0.offset |old(~Id_MCDC_109~0.offset)|) (= |~#Id_MCDC_112~0.base| |old(~#Id_MCDC_112~0.base)|) (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) (= |old(~Id_MCDC_106~0)| ~Id_MCDC_106~0) (= ~Id_MCDC_107~0.base |old(~Id_MCDC_107~0.base)|) (= |old(~#Id_MCDC_112~0.offset)| |~#Id_MCDC_112~0.offset|) (= ~Id_MCDC_108~0.base |old(~Id_MCDC_108~0.base)|) (= |old(~Id_MCDC_109~0.base)| ~Id_MCDC_109~0.base) (= |old(~#Id_MCDC_113~0.base)| |~#Id_MCDC_113~0.base|) (= |old(~#Id_MCDC_113~0.offset)| |~#Id_MCDC_113~0.offset|) (= |old(~Id_MCDC_110~0.base)| ~Id_MCDC_110~0.base) (= |old(~Id_MCDC_104~0)| ~Id_MCDC_104~0) (= |old(~Id_MCDC_108~0.offset)| ~Id_MCDC_108~0.offset) (= |old(~Id_MCDC_105~0)| ~Id_MCDC_105~0) (= ~Id_MCDC_107~0.offset |old(~Id_MCDC_107~0.offset)|) (= |old(~Id_MCDC_111~0.offset)| ~Id_MCDC_111~0.offset) (= |#NULL.offset| |old(#NULL.offset)|) (= ~Id_MCDC_111~0.base |old(~Id_MCDC_111~0.base)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:55:45,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#(and (= ~Id_MCDC_110~0.offset |old(~Id_MCDC_110~0.offset)|) (= ~Id_MCDC_109~0.offset |old(~Id_MCDC_109~0.offset)|) (= |~#Id_MCDC_112~0.base| |old(~#Id_MCDC_112~0.base)|) (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) (= |old(~Id_MCDC_106~0)| ~Id_MCDC_106~0) (= ~Id_MCDC_107~0.base |old(~Id_MCDC_107~0.base)|) (= |old(~#Id_MCDC_112~0.offset)| |~#Id_MCDC_112~0.offset|) (= ~Id_MCDC_108~0.base |old(~Id_MCDC_108~0.base)|) (= |old(~Id_MCDC_109~0.base)| ~Id_MCDC_109~0.base) (= |old(~#Id_MCDC_113~0.base)| |~#Id_MCDC_113~0.base|) (= |old(~#Id_MCDC_113~0.offset)| |~#Id_MCDC_113~0.offset|) (= |old(~Id_MCDC_110~0.base)| ~Id_MCDC_110~0.base) (= |old(~Id_MCDC_104~0)| ~Id_MCDC_104~0) (= |old(~Id_MCDC_108~0.offset)| ~Id_MCDC_108~0.offset) (= |old(~Id_MCDC_105~0)| ~Id_MCDC_105~0) (= ~Id_MCDC_107~0.offset |old(~Id_MCDC_107~0.offset)|) (= |old(~Id_MCDC_111~0.offset)| ~Id_MCDC_111~0.offset) (= |#NULL.offset| |old(#NULL.offset)|) (= ~Id_MCDC_111~0.base |old(~Id_MCDC_111~0.base)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(114, 4, 0, 1);call write~init~int(115, 4, 1, 1);call write~init~int(118, 4, 2, 1);call write~init~int(100, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(3, 5);call write~init~int(119, 5, 0, 1);call write~init~int(111, 5, 1, 1);call write~init~int(0, 5, 2, 1);call #Ultimate.allocInit(20, 6);call #Ultimate.allocInit(5, 7);call write~init~int(114, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(118, 7, 2, 1);call write~init~int(100, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(119, 8, 0, 1);call write~init~int(111, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(7, 9);call write~init~int(105, 9, 0, 1);call write~init~int(110, 9, 1, 1);call write~init~int(46, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(115, 9, 5, 1);call write~init~int(0, 9, 6, 1);call #Ultimate.allocInit(2, 10);call write~init~int(114, 10, 0, 1);call write~init~int(0, 10, 1, 1);~Id_MCDC_104~0 := 0;~Id_MCDC_105~0 := 0;~Id_MCDC_106~0 := 0;~Id_MCDC_107~0.base, ~Id_MCDC_107~0.offset := 0, 0;~Id_MCDC_108~0.base, ~Id_MCDC_108~0.offset := 0, 0;~Id_MCDC_109~0.base, ~Id_MCDC_109~0.offset := 0, 0;~Id_MCDC_110~0.base, ~Id_MCDC_110~0.offset := 0, 0;~Id_MCDC_111~0.base, ~Id_MCDC_111~0.offset := 0, 0;~#Id_MCDC_112~0.base, ~#Id_MCDC_112~0.offset := 11, 0;call #Ultimate.allocInit(16, 11);call write~init~int(0, ~#Id_MCDC_112~0.base, ~#Id_MCDC_112~0.offset, 4);call write~init~int(0, ~#Id_MCDC_112~0.base, 4 + ~#Id_MCDC_112~0.offset, 4);call write~init~int(0, ~#Id_MCDC_112~0.base, 8 + ~#Id_MCDC_112~0.offset, 4);call write~init~int(0, ~#Id_MCDC_112~0.base, 12 + ~#Id_MCDC_112~0.offset, 4);~#Id_MCDC_113~0.base, ~#Id_MCDC_113~0.offset := 12, 0;call #Ultimate.allocInit(36, 12);call write~init~int(0, ~#Id_MCDC_113~0.base, ~#Id_MCDC_113~0.offset, 1);call write~init~int(0, ~#Id_MCDC_113~0.base, 1 + ~#Id_MCDC_113~0.offset, 2);call write~init~int(0, ~#Id_MCDC_113~0.base, 3 + ~#Id_MCDC_113~0.offset, 1);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 4 + ~#Id_MCDC_113~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 12 + ~#Id_MCDC_113~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 20 + ~#Id_MCDC_113~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 28 + ~#Id_MCDC_113~0.offset, 8);~Id_MCDC_114~0 := 0; {131#true} is VALID [2022-04-28 09:55:45,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} assume true; {131#true} is VALID [2022-04-28 09:55:45,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} #387#return; {131#true} is VALID [2022-04-28 09:55:45,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {131#true} call #t~ret62 := main(); {131#true} is VALID [2022-04-28 09:55:45,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#true} havoc ~Id_MCDC_143~0.base, ~Id_MCDC_143~0.offset;havoc ~Id_MCDC_144~0.base, ~Id_MCDC_144~0.offset;havoc ~Id_MCDC_145~0.base, ~Id_MCDC_145~0.offset;havoc ~Id_MCDC_146~0.base, ~Id_MCDC_146~0.offset;havoc ~Id_MCDC_147~0.base, ~Id_MCDC_147~0.offset;havoc ~Id_MCDC_148~0.base, ~Id_MCDC_148~0.offset;havoc ~Id_MCDC_149~0;havoc ~Id_MCDC_150~0;havoc ~Id_MCDC_151~0;havoc ~Id_MCDC_152~0;havoc ~Id_MCDC_153~0;havoc ~Id_MCDC_154~0;havoc ~Id_MCDC_155~0;havoc ~Id_MCDC_156~0;havoc ~Id_MCDC_157~0;havoc ~Id_MCDC_158~0.base, ~Id_MCDC_158~0.offset;havoc ~Id_MCDC_159~0;havoc ~Id_MCDC_160~0;~Id_MCDC_161~0 := 0;~Id_MCDC_162~0 := 0;havoc ~Id_MCDC_163~0;havoc ~Id_MCDC_164~0;call #t~ret61.base, #t~ret61.offset := fopen(9, 0, 10, 0);~Id_MCDC_158~0.base, ~Id_MCDC_158~0.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {131#true} is VALID [2022-04-28 09:55:45,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {131#true} assume !(~Id_MCDC_158~0.base == 0 && ~Id_MCDC_158~0.offset == 0); {131#true} is VALID [2022-04-28 09:55:45,780 INFO L272 TraceCheckUtils]: 7: Hoare triple {131#true} call Id_MCDC_100(); {131#true} is VALID [2022-04-28 09:55:45,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {131#true} havoc ~Id_MCDC_141~0;havoc ~Id_MCDC_142~0.base, ~Id_MCDC_142~0.offset; {131#true} is VALID [2022-04-28 09:55:45,780 INFO L272 TraceCheckUtils]: 9: Hoare triple {131#true} call Id_MCDC_99(); {131#true} is VALID [2022-04-28 09:55:45,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {131#true} call ~#Id_MCDC_139~0.base, ~#Id_MCDC_139~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_139~0.base, ~#Id_MCDC_139~0.offset, 1);call write~init~int(0, ~#Id_MCDC_139~0.base, 1 + ~#Id_MCDC_139~0.offset, 1);call write~init~int(0, ~#Id_MCDC_139~0.base, 2 + ~#Id_MCDC_139~0.offset, 1);call write~init~int(0, ~#Id_MCDC_139~0.base, 3 + ~#Id_MCDC_139~0.offset, 1);~Id_MCDC_140~0 := 0;call #t~malloc50.base, #t~malloc50.offset := #Ultimate.allocOnHeap(372);call write~$Pointer$(#t~malloc50.base, #t~malloc50.offset, ~#Id_MCDC_113~0.base, 20 + ~#Id_MCDC_113~0.offset, 8);havoc #t~malloc50.base, #t~malloc50.offset; {131#true} is VALID [2022-04-28 09:55:45,782 INFO L272 TraceCheckUtils]: 11: Hoare triple {131#true} call #t~ret51 := Id_MCDC_97(); {147#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 09:55:45,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {147#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~Id_MCDC_123~0;havoc ~Id_MCDC_124~0;havoc ~Id_MCDC_125~0;havoc ~Id_MCDC_126~0;havoc ~Id_MCDC_127~0;call ~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset, 4);havoc ~Id_MCDC_129~0;call ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset, 4);call ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset, 4);~Id_MCDC_35~0 := 0;~Id_MCDC_132~0 := 0;~Id_MCDC_36~0 := 0;~Id_MCDC_133~0 := 0;~Id_MCDC_134~0 := 0;call ~#Id_MCDC_135~0.base, ~#Id_MCDC_135~0.offset := #Ultimate.allocOnStack(4);call ~#Id_MCDC_136~0.base, ~#Id_MCDC_136~0.offset := #Ultimate.allocOnStack(8);havoc ~Id_MCDC_137~0.base, ~Id_MCDC_137~0.offset;havoc ~Id_MCDC_138~0;~Id_MCDC_123~0 := 6144;~Id_MCDC_132~0 := 0; {131#true} is VALID [2022-04-28 09:55:45,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {131#true} assume !(~Id_MCDC_132~0 % 256 < 4); {131#true} is VALID [2022-04-28 09:55:45,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {131#true} assume !(~Id_MCDC_123~0 % 4294967296 <= 6147); {131#true} is VALID [2022-04-28 09:55:45,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {131#true} #res := 0;call ULTIMATE.dealloc(~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset);havoc ~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset);havoc ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset);havoc ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_135~0.base, ~#Id_MCDC_135~0.offset);havoc ~#Id_MCDC_135~0.base, ~#Id_MCDC_135~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_136~0.base, ~#Id_MCDC_136~0.offset);havoc ~#Id_MCDC_136~0.base, ~#Id_MCDC_136~0.offset; {131#true} is VALID [2022-04-28 09:55:45,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {131#true} assume true; {131#true} is VALID [2022-04-28 09:55:45,783 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {131#true} {131#true} #367#return; {131#true} is VALID [2022-04-28 09:55:45,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {131#true} havoc #t~ret51;~Id_MCDC_140~0 := 0; {131#true} is VALID [2022-04-28 09:55:45,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {131#true} assume !(~Id_MCDC_140~0 % 4294967296 < 4); {131#true} is VALID [2022-04-28 09:55:45,784 INFO L272 TraceCheckUtils]: 20: Hoare triple {131#true} call #t~ret60 := Id_MCDC_95(4, ~#Id_MCDC_139~0.base, ~#Id_MCDC_139~0.offset); {131#true} is VALID [2022-04-28 09:55:45,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {131#true} ~Id_MCDC_93 := #in~Id_MCDC_93;~Id_MCDC_94.base, ~Id_MCDC_94.offset := #in~Id_MCDC_94.base, #in~Id_MCDC_94.offset;~Id_MCDC_121~0 := 0;~Id_MCDC_122~0 := 0; {131#true} is VALID [2022-04-28 09:55:45,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {131#true} assume !(~Id_MCDC_93 % 4294967296 < 2); {131#true} is VALID [2022-04-28 09:55:45,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {131#true} assume !(2 != ~Id_MCDC_93 % 4294967296);call #t~mem19 := read~int(~Id_MCDC_94.base, 1 + ~Id_MCDC_94.offset, 1);~Id_MCDC_122~0 := #t~mem19;havoc #t~mem19; {131#true} is VALID [2022-04-28 09:55:45,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {131#true} call #t~mem20 := read~int(~Id_MCDC_94.base, ~Id_MCDC_94.offset, 1); {131#true} is VALID [2022-04-28 09:55:45,784 INFO L272 TraceCheckUtils]: 25: Hoare triple {131#true} call #t~ret21 := Id_MCDC_92(#t~mem20, ~Id_MCDC_122~0); {131#true} is VALID [2022-04-28 09:55:45,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {131#true} ~Id_MCDC_90 := #in~Id_MCDC_90;~Id_MCDC_91 := #in~Id_MCDC_91;~Id_MCDC_117~0 := 0;~Id_MCDC_118~0 := 0;~Id_MCDC_119~0 := 1;~Id_MCDC_120~0 := 0; {131#true} is VALID [2022-04-28 09:55:45,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {131#true} assume ~Id_MCDC_90 % 4294967296 > ~Id_MCDC_91 % 4294967296;~Id_MCDC_117~0 := ~Id_MCDC_90;~Id_MCDC_118~0 := ~Id_MCDC_91; {131#true} is VALID [2022-04-28 09:55:45,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {131#true} assume !!(0 != ~Id_MCDC_119~0 % 4294967296); {131#true} is VALID [2022-04-28 09:55:45,785 INFO L272 TraceCheckUtils]: 29: Hoare triple {131#true} call avoid_zero((if 0 != ~Id_MCDC_118~0 % 4294967296 then 1 else 0)); {131#true} is VALID [2022-04-28 09:55:45,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {131#true} ~y := #in~y; {131#true} is VALID [2022-04-28 09:55:45,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {131#true} assume 0 == ~y;assume false; {132#false} is VALID [2022-04-28 09:55:45,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {132#false} assume true; {132#false} is VALID [2022-04-28 09:55:45,789 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {132#false} {131#true} #361#return; {132#false} is VALID [2022-04-28 09:55:45,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {132#false} ~Id_MCDC_120~0 := (if ~Id_MCDC_117~0 % 4294967296 < 0 && 0 != ~Id_MCDC_117~0 % 4294967296 % (~Id_MCDC_118~0 % 4294967296) then (if ~Id_MCDC_118~0 % 4294967296 < 0 then ~Id_MCDC_117~0 % 4294967296 / (~Id_MCDC_118~0 % 4294967296) - 1 else 1 + ~Id_MCDC_117~0 % 4294967296 / (~Id_MCDC_118~0 % 4294967296)) else ~Id_MCDC_117~0 % 4294967296 / (~Id_MCDC_118~0 % 4294967296)); {132#false} is VALID [2022-04-28 09:55:45,790 INFO L272 TraceCheckUtils]: 35: Hoare triple {132#false} call __VERIFIER_assert((if (~Id_MCDC_117~0 - ~Id_MCDC_120~0 * ~Id_MCDC_118~0) % 4294967296 >= 0 && (~Id_MCDC_117~0 - ~Id_MCDC_120~0 * ~Id_MCDC_118~0) % 4294967296 <= 4294967295 then 1 else 0)); {132#false} is VALID [2022-04-28 09:55:45,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {132#false} ~Id_MCDC_103 := #in~Id_MCDC_103; {132#false} is VALID [2022-04-28 09:55:45,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {132#false} assume 0 == ~Id_MCDC_103; {132#false} is VALID [2022-04-28 09:55:45,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {132#false} assume !false; {132#false} is VALID [2022-04-28 09:55:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:55:45,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:55:45,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739129155] [2022-04-28 09:55:45,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739129155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:55:45,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:55:45,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:55:45,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:55:45,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [544235252] [2022-04-28 09:55:45,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [544235252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:55:45,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:55:45,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:55:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927114097] [2022-04-28 09:55:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:55:45,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-04-28 09:55:45,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:55:45,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 09:55:45,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:55:45,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:55:45,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:55:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:55:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:55:45,867 INFO L87 Difference]: Start difference. First operand has 128 states, 99 states have (on average 1.5353535353535352) internal successors, (152), 101 states have internal predecessors, (152), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 09:55:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:55:46,839 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2022-04-28 09:55:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:55:46,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-04-28 09:55:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:55:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 09:55:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 363 transitions. [2022-04-28 09:55:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 09:55:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 363 transitions. [2022-04-28 09:55:46,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 363 transitions. [2022-04-28 09:55:47,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:55:47,317 INFO L225 Difference]: With dead ends: 243 [2022-04-28 09:55:47,317 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 09:55:47,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:55:47,322 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 238 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:55:47,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 138 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:55:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 09:55:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-04-28 09:55:47,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:55:47,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 119 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 95 states have internal predecessors, (137), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 09:55:47,358 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 119 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 95 states have internal predecessors, (137), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 09:55:47,358 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 119 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 95 states have internal predecessors, (137), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 09:55:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:55:47,364 INFO L93 Difference]: Finished difference Result 119 states and 165 transitions. [2022-04-28 09:55:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2022-04-28 09:55:47,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:55:47,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:55:47,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 95 states have internal predecessors, (137), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 119 states. [2022-04-28 09:55:47,366 INFO L87 Difference]: Start difference. First operand has 119 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 95 states have internal predecessors, (137), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 119 states. [2022-04-28 09:55:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:55:47,370 INFO L93 Difference]: Finished difference Result 119 states and 165 transitions. [2022-04-28 09:55:47,371 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2022-04-28 09:55:47,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:55:47,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:55:47,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:55:47,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:55:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 95 states have internal predecessors, (137), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 09:55:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2022-04-28 09:55:47,377 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 39 [2022-04-28 09:55:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:55:47,377 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2022-04-28 09:55:47,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 09:55:47,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 165 transitions. [2022-04-28 09:55:47,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:55:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2022-04-28 09:55:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 09:55:47,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:55:47,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:55:47,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:55:47,667 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:55:47,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:55:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1349629939, now seen corresponding path program 1 times [2022-04-28 09:55:47,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:55:47,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1138580105] [2022-04-28 09:55:47,668 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:55:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1349629939, now seen corresponding path program 2 times [2022-04-28 09:55:47,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:55:47,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664371667] [2022-04-28 09:55:47,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:55:47,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:55:47,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:55:47,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013995103] [2022-04-28 09:55:47,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:55:47,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:55:47,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:55:47,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:55:47,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:55:47,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:55:47,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:55:47,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 09:55:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:55:47,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:55:48,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {1115#true} call ULTIMATE.init(); {1115#true} is VALID [2022-04-28 09:55:48,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(114, 4, 0, 1);call write~init~int(115, 4, 1, 1);call write~init~int(118, 4, 2, 1);call write~init~int(100, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(3, 5);call write~init~int(119, 5, 0, 1);call write~init~int(111, 5, 1, 1);call write~init~int(0, 5, 2, 1);call #Ultimate.allocInit(20, 6);call #Ultimate.allocInit(5, 7);call write~init~int(114, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(118, 7, 2, 1);call write~init~int(100, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(119, 8, 0, 1);call write~init~int(111, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(7, 9);call write~init~int(105, 9, 0, 1);call write~init~int(110, 9, 1, 1);call write~init~int(46, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(115, 9, 5, 1);call write~init~int(0, 9, 6, 1);call #Ultimate.allocInit(2, 10);call write~init~int(114, 10, 0, 1);call write~init~int(0, 10, 1, 1);~Id_MCDC_104~0 := 0;~Id_MCDC_105~0 := 0;~Id_MCDC_106~0 := 0;~Id_MCDC_107~0.base, ~Id_MCDC_107~0.offset := 0, 0;~Id_MCDC_108~0.base, ~Id_MCDC_108~0.offset := 0, 0;~Id_MCDC_109~0.base, ~Id_MCDC_109~0.offset := 0, 0;~Id_MCDC_110~0.base, ~Id_MCDC_110~0.offset := 0, 0;~Id_MCDC_111~0.base, ~Id_MCDC_111~0.offset := 0, 0;~#Id_MCDC_112~0.base, ~#Id_MCDC_112~0.offset := 11, 0;call #Ultimate.allocInit(16, 11);call write~init~int(0, ~#Id_MCDC_112~0.base, ~#Id_MCDC_112~0.offset, 4);call write~init~int(0, ~#Id_MCDC_112~0.base, 4 + ~#Id_MCDC_112~0.offset, 4);call write~init~int(0, ~#Id_MCDC_112~0.base, 8 + ~#Id_MCDC_112~0.offset, 4);call write~init~int(0, ~#Id_MCDC_112~0.base, 12 + ~#Id_MCDC_112~0.offset, 4);~#Id_MCDC_113~0.base, ~#Id_MCDC_113~0.offset := 12, 0;call #Ultimate.allocInit(36, 12);call write~init~int(0, ~#Id_MCDC_113~0.base, ~#Id_MCDC_113~0.offset, 1);call write~init~int(0, ~#Id_MCDC_113~0.base, 1 + ~#Id_MCDC_113~0.offset, 2);call write~init~int(0, ~#Id_MCDC_113~0.base, 3 + ~#Id_MCDC_113~0.offset, 1);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 4 + ~#Id_MCDC_113~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 12 + ~#Id_MCDC_113~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 20 + ~#Id_MCDC_113~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 28 + ~#Id_MCDC_113~0.offset, 8);~Id_MCDC_114~0 := 0; {1115#true} is VALID [2022-04-28 09:55:48,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2022-04-28 09:55:48,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1115#true} #387#return; {1115#true} is VALID [2022-04-28 09:55:48,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {1115#true} call #t~ret62 := main(); {1115#true} is VALID [2022-04-28 09:55:48,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {1115#true} havoc ~Id_MCDC_143~0.base, ~Id_MCDC_143~0.offset;havoc ~Id_MCDC_144~0.base, ~Id_MCDC_144~0.offset;havoc ~Id_MCDC_145~0.base, ~Id_MCDC_145~0.offset;havoc ~Id_MCDC_146~0.base, ~Id_MCDC_146~0.offset;havoc ~Id_MCDC_147~0.base, ~Id_MCDC_147~0.offset;havoc ~Id_MCDC_148~0.base, ~Id_MCDC_148~0.offset;havoc ~Id_MCDC_149~0;havoc ~Id_MCDC_150~0;havoc ~Id_MCDC_151~0;havoc ~Id_MCDC_152~0;havoc ~Id_MCDC_153~0;havoc ~Id_MCDC_154~0;havoc ~Id_MCDC_155~0;havoc ~Id_MCDC_156~0;havoc ~Id_MCDC_157~0;havoc ~Id_MCDC_158~0.base, ~Id_MCDC_158~0.offset;havoc ~Id_MCDC_159~0;havoc ~Id_MCDC_160~0;~Id_MCDC_161~0 := 0;~Id_MCDC_162~0 := 0;havoc ~Id_MCDC_163~0;havoc ~Id_MCDC_164~0;call #t~ret61.base, #t~ret61.offset := fopen(9, 0, 10, 0);~Id_MCDC_158~0.base, ~Id_MCDC_158~0.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {1115#true} is VALID [2022-04-28 09:55:48,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {1115#true} assume !(~Id_MCDC_158~0.base == 0 && ~Id_MCDC_158~0.offset == 0); {1115#true} is VALID [2022-04-28 09:55:48,046 INFO L272 TraceCheckUtils]: 7: Hoare triple {1115#true} call Id_MCDC_100(); {1115#true} is VALID [2022-04-28 09:55:48,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {1115#true} havoc ~Id_MCDC_141~0;havoc ~Id_MCDC_142~0.base, ~Id_MCDC_142~0.offset; {1115#true} is VALID [2022-04-28 09:55:48,046 INFO L272 TraceCheckUtils]: 9: Hoare triple {1115#true} call Id_MCDC_99(); {1115#true} is VALID [2022-04-28 09:55:48,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {1115#true} call ~#Id_MCDC_139~0.base, ~#Id_MCDC_139~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_139~0.base, ~#Id_MCDC_139~0.offset, 1);call write~init~int(0, ~#Id_MCDC_139~0.base, 1 + ~#Id_MCDC_139~0.offset, 1);call write~init~int(0, ~#Id_MCDC_139~0.base, 2 + ~#Id_MCDC_139~0.offset, 1);call write~init~int(0, ~#Id_MCDC_139~0.base, 3 + ~#Id_MCDC_139~0.offset, 1);~Id_MCDC_140~0 := 0;call #t~malloc50.base, #t~malloc50.offset := #Ultimate.allocOnHeap(372);call write~$Pointer$(#t~malloc50.base, #t~malloc50.offset, ~#Id_MCDC_113~0.base, 20 + ~#Id_MCDC_113~0.offset, 8);havoc #t~malloc50.base, #t~malloc50.offset; {1115#true} is VALID [2022-04-28 09:55:48,046 INFO L272 TraceCheckUtils]: 11: Hoare triple {1115#true} call #t~ret51 := Id_MCDC_97(); {1115#true} is VALID [2022-04-28 09:55:48,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {1115#true} havoc ~Id_MCDC_123~0;havoc ~Id_MCDC_124~0;havoc ~Id_MCDC_125~0;havoc ~Id_MCDC_126~0;havoc ~Id_MCDC_127~0;call ~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset, 4);havoc ~Id_MCDC_129~0;call ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset, 4);call ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset, 4);~Id_MCDC_35~0 := 0;~Id_MCDC_132~0 := 0;~Id_MCDC_36~0 := 0;~Id_MCDC_133~0 := 0;~Id_MCDC_134~0 := 0;call ~#Id_MCDC_135~0.base, ~#Id_MCDC_135~0.offset := #Ultimate.allocOnStack(4);call ~#Id_MCDC_136~0.base, ~#Id_MCDC_136~0.offset := #Ultimate.allocOnStack(8);havoc ~Id_MCDC_137~0.base, ~Id_MCDC_137~0.offset;havoc ~Id_MCDC_138~0;~Id_MCDC_123~0 := 6144;~Id_MCDC_132~0 := 0; {1115#true} is VALID [2022-04-28 09:55:48,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {1115#true} assume !(~Id_MCDC_132~0 % 256 < 4); {1115#true} is VALID [2022-04-28 09:55:48,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {1115#true} assume !(~Id_MCDC_123~0 % 4294967296 <= 6147); {1115#true} is VALID [2022-04-28 09:55:48,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {1115#true} #res := 0;call ULTIMATE.dealloc(~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset);havoc ~#Id_MCDC_128~0.base, ~#Id_MCDC_128~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset);havoc ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset);havoc ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_135~0.base, ~#Id_MCDC_135~0.offset);havoc ~#Id_MCDC_135~0.base, ~#Id_MCDC_135~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_136~0.base, ~#Id_MCDC_136~0.offset);havoc ~#Id_MCDC_136~0.base, ~#Id_MCDC_136~0.offset; {1115#true} is VALID [2022-04-28 09:55:48,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {1115#true} assume true; {1115#true} is VALID [2022-04-28 09:55:48,047 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1115#true} {1115#true} #367#return; {1115#true} is VALID [2022-04-28 09:55:48,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {1115#true} havoc #t~ret51;~Id_MCDC_140~0 := 0; {1115#true} is VALID [2022-04-28 09:55:48,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {1115#true} assume !(~Id_MCDC_140~0 % 4294967296 < 4); {1115#true} is VALID [2022-04-28 09:55:48,048 INFO L272 TraceCheckUtils]: 20: Hoare triple {1115#true} call #t~ret60 := Id_MCDC_95(4, ~#Id_MCDC_139~0.base, ~#Id_MCDC_139~0.offset); {1115#true} is VALID [2022-04-28 09:55:48,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {1115#true} ~Id_MCDC_93 := #in~Id_MCDC_93;~Id_MCDC_94.base, ~Id_MCDC_94.offset := #in~Id_MCDC_94.base, #in~Id_MCDC_94.offset;~Id_MCDC_121~0 := 0;~Id_MCDC_122~0 := 0; {1115#true} is VALID [2022-04-28 09:55:48,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {1115#true} assume !(~Id_MCDC_93 % 4294967296 < 2); {1115#true} is VALID [2022-04-28 09:55:48,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {1115#true} assume !(2 != ~Id_MCDC_93 % 4294967296);call #t~mem19 := read~int(~Id_MCDC_94.base, 1 + ~Id_MCDC_94.offset, 1);~Id_MCDC_122~0 := #t~mem19;havoc #t~mem19; {1115#true} is VALID [2022-04-28 09:55:48,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {1115#true} call #t~mem20 := read~int(~Id_MCDC_94.base, ~Id_MCDC_94.offset, 1); {1115#true} is VALID [2022-04-28 09:55:48,048 INFO L272 TraceCheckUtils]: 25: Hoare triple {1115#true} call #t~ret21 := Id_MCDC_92(#t~mem20, ~Id_MCDC_122~0); {1115#true} is VALID [2022-04-28 09:55:48,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {1115#true} ~Id_MCDC_90 := #in~Id_MCDC_90;~Id_MCDC_91 := #in~Id_MCDC_91;~Id_MCDC_117~0 := 0;~Id_MCDC_118~0 := 0;~Id_MCDC_119~0 := 1;~Id_MCDC_120~0 := 0; {1115#true} is VALID [2022-04-28 09:55:48,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {1115#true} assume ~Id_MCDC_90 % 4294967296 > ~Id_MCDC_91 % 4294967296;~Id_MCDC_117~0 := ~Id_MCDC_90;~Id_MCDC_118~0 := ~Id_MCDC_91; {1115#true} is VALID [2022-04-28 09:55:48,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {1115#true} assume !!(0 != ~Id_MCDC_119~0 % 4294967296); {1115#true} is VALID [2022-04-28 09:55:48,049 INFO L272 TraceCheckUtils]: 29: Hoare triple {1115#true} call avoid_zero((if 0 != ~Id_MCDC_118~0 % 4294967296 then 1 else 0)); {1115#true} is VALID [2022-04-28 09:55:48,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {1115#true} ~y := #in~y; {1115#true} is VALID [2022-04-28 09:55:48,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {1115#true} assume !(0 == ~y); {1115#true} is VALID [2022-04-28 09:55:48,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {1115#true} assume true; {1115#true} is VALID [2022-04-28 09:55:48,049 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1115#true} {1115#true} #361#return; {1115#true} is VALID [2022-04-28 09:55:48,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {1115#true} ~Id_MCDC_120~0 := (if ~Id_MCDC_117~0 % 4294967296 < 0 && 0 != ~Id_MCDC_117~0 % 4294967296 % (~Id_MCDC_118~0 % 4294967296) then (if ~Id_MCDC_118~0 % 4294967296 < 0 then ~Id_MCDC_117~0 % 4294967296 / (~Id_MCDC_118~0 % 4294967296) - 1 else 1 + ~Id_MCDC_117~0 % 4294967296 / (~Id_MCDC_118~0 % 4294967296)) else ~Id_MCDC_117~0 % 4294967296 / (~Id_MCDC_118~0 % 4294967296)); {1115#true} is VALID [2022-04-28 09:55:48,050 INFO L272 TraceCheckUtils]: 35: Hoare triple {1115#true} call __VERIFIER_assert((if (~Id_MCDC_117~0 - ~Id_MCDC_120~0 * ~Id_MCDC_118~0) % 4294967296 >= 0 && (~Id_MCDC_117~0 - ~Id_MCDC_120~0 * ~Id_MCDC_118~0) % 4294967296 <= 4294967295 then 1 else 0)); {1225#(<= 1 |__VERIFIER_assert_#in~Id_MCDC_103|)} is VALID [2022-04-28 09:55:48,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {1225#(<= 1 |__VERIFIER_assert_#in~Id_MCDC_103|)} ~Id_MCDC_103 := #in~Id_MCDC_103; {1229#(<= 1 __VERIFIER_assert_~Id_MCDC_103)} is VALID [2022-04-28 09:55:48,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {1229#(<= 1 __VERIFIER_assert_~Id_MCDC_103)} assume 0 == ~Id_MCDC_103; {1116#false} is VALID [2022-04-28 09:55:48,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {1116#false} assume !false; {1116#false} is VALID [2022-04-28 09:55:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:55:48,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:55:48,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:55:48,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664371667] [2022-04-28 09:55:48,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:55:48,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013995103] [2022-04-28 09:55:48,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013995103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:55:48,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:55:48,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:55:48,053 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:55:48,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1138580105] [2022-04-28 09:55:48,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1138580105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:55:48,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:55:48,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:55:48,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209246040] [2022-04-28 09:55:48,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:55:48,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-04-28 09:55:48,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:55:48,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 09:55:48,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:55:48,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:55:48,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:55:48,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:55:48,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:55:48,091 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 09:55:48,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:55:48,385 INFO L93 Difference]: Finished difference Result 119 states and 165 transitions. [2022-04-28 09:55:48,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:55:48,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-04-28 09:55:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:55:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 09:55:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-28 09:55:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 09:55:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-28 09:55:48,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-28 09:55:48,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:55:48,505 INFO L225 Difference]: With dead ends: 119 [2022-04-28 09:55:48,505 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:55:48,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 09:55:48,507 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 5 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:55:48,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 477 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:55:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:55:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:55:48,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:55:48,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:55:48,508 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:55:48,508 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:55:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:55:48,508 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:55:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:55:48,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:55:48,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:55:48,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:55:48,509 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:55:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:55:48,509 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:55:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:55:48,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:55:48,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:55:48,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:55:48,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:55:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:55:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:55:48,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-28 09:55:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:55:48,510 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:55:48,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 09:55:48,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:55:48,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:55:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:55:48,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:55:48,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:55:48,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:55:48,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:55:48,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:55:49,133 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 09:55:49,134 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 09:55:49,134 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 09:55:49,134 INFO L902 garLoopResultBuilder]: At program point L221(line 221) the Hoare annotation is: true [2022-04-28 09:55:49,134 INFO L902 garLoopResultBuilder]: At program point L217(line 217) the Hoare annotation is: true [2022-04-28 09:55:49,134 INFO L902 garLoopResultBuilder]: At program point L217-2(line 217) the Hoare annotation is: true [2022-04-28 09:55:49,134 INFO L902 garLoopResultBuilder]: At program point L209(lines 209 225) the Hoare annotation is: true [2022-04-28 09:55:49,134 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_89ENTRY(lines 193 248) the Hoare annotation is: true [2022-04-28 09:55:49,134 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_89EXIT(lines 193 248) the Hoare annotation is: true [2022-04-28 09:55:49,134 INFO L902 garLoopResultBuilder]: At program point L234(line 234) the Hoare annotation is: true [2022-04-28 09:55:49,134 INFO L902 garLoopResultBuilder]: At program point L234-2(line 234) the Hoare annotation is: true [2022-04-28 09:55:49,134 INFO L902 garLoopResultBuilder]: At program point L234-3(line 234) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L234-5(lines 234 246) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L226-1(lines 226 233) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L226-3(lines 226 233) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L226-4(lines 226 233) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L218(line 218) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L214(line 214) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L214-2(line 214) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L202(lines 202 208) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L202-2(lines 202 208) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_89FINAL(lines 193 248) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L198(lines 198 201) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L223(line 223) the Hoare annotation is: true [2022-04-28 09:55:49,135 INFO L902 garLoopResultBuilder]: At program point L215(line 215) the Hoare annotation is: true [2022-04-28 09:55:49,136 INFO L902 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: true [2022-04-28 09:55:49,136 INFO L902 garLoopResultBuilder]: At program point L211-2(line 211) the Hoare annotation is: true [2022-04-28 09:55:49,136 INFO L902 garLoopResultBuilder]: At program point L236(lines 236 241) the Hoare annotation is: true [2022-04-28 09:55:49,136 INFO L902 garLoopResultBuilder]: At program point L236-1(lines 234 246) the Hoare annotation is: true [2022-04-28 09:55:49,136 INFO L902 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: true [2022-04-28 09:55:49,136 INFO L902 garLoopResultBuilder]: At program point L220-2(line 220) the Hoare annotation is: true [2022-04-28 09:55:49,136 INFO L902 garLoopResultBuilder]: At program point L212(line 212) the Hoare annotation is: true [2022-04-28 09:55:49,136 INFO L902 garLoopResultBuilder]: At program point L204(lines 204 207) the Hoare annotation is: true [2022-04-28 09:55:49,136 INFO L902 garLoopResultBuilder]: At program point L229(lines 229 232) the Hoare annotation is: true [2022-04-28 09:55:49,136 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 427 458) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-04-28 09:55:49,136 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 427 458) the Hoare annotation is: true [2022-04-28 09:55:49,136 INFO L895 garLoopResultBuilder]: At program point L457(line 457) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 427 458) the Hoare annotation is: true [2022-04-28 09:55:49,137 INFO L895 garLoopResultBuilder]: At program point L452(lines 452 455) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_92EXIT(lines 249 279) the Hoare annotation is: true [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_92FINAL(lines 249 279) the Hoare annotation is: true [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point L261(lines 261 269) the Hoare annotation is: true [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point L255(lines 255 269) the Hoare annotation is: true [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_92ENTRY(lines 249 279) the Hoare annotation is: true [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point L274(line 274) the Hoare annotation is: true [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point L274-1(line 274) the Hoare annotation is: true [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point L272(line 272) the Hoare annotation is: true [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point L272-1(line 272) the Hoare annotation is: true [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point L270-1(lines 250 279) the Hoare annotation is: true [2022-04-28 09:55:49,137 INFO L902 garLoopResultBuilder]: At program point L270-2(lines 270 277) the Hoare annotation is: true [2022-04-28 09:55:49,138 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_100FINAL(lines 420 426) the Hoare annotation is: true [2022-04-28 09:55:49,138 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_100EXIT(lines 420 426) the Hoare annotation is: true [2022-04-28 09:55:49,138 INFO L895 garLoopResultBuilder]: At program point L424(line 424) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-04-28 09:55:49,138 INFO L895 garLoopResultBuilder]: At program point Id_MCDC_100ENTRY(lines 420 426) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-04-28 09:55:49,138 INFO L895 garLoopResultBuilder]: At program point L417(line 417) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-28 09:55:49,138 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-28 09:55:49,138 INFO L895 garLoopResultBuilder]: At program point L405-1(line 405) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-28 09:55:49,138 INFO L895 garLoopResultBuilder]: At program point Id_MCDC_99ENTRY(lines 400 419) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-04-28 09:55:49,138 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_99EXIT(lines 400 419) the Hoare annotation is: true [2022-04-28 09:55:49,139 INFO L895 garLoopResultBuilder]: At program point L408(line 408) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-28 09:55:49,139 INFO L895 garLoopResultBuilder]: At program point L408-2(lines 408 415) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-28 09:55:49,139 INFO L895 garLoopResultBuilder]: At program point L406-2(lines 406 416) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-28 09:55:49,139 INFO L895 garLoopResultBuilder]: At program point L406-3(lines 406 416) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-28 09:55:49,139 INFO L895 garLoopResultBuilder]: At program point L406-4(lines 406 416) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-28 09:55:49,139 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_99FINAL(lines 400 419) the Hoare annotation is: true [2022-04-28 09:55:49,139 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-28 09:55:49,139 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-28 09:55:49,139 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-28 09:55:49,139 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-28 09:55:49,139 INFO L902 garLoopResultBuilder]: At program point L378(line 378) the Hoare annotation is: true [2022-04-28 09:55:49,139 INFO L902 garLoopResultBuilder]: At program point L378-1(lines 378 381) the Hoare annotation is: true [2022-04-28 09:55:49,139 INFO L895 garLoopResultBuilder]: At program point Id_MCDC_97ENTRY(lines 331 399) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-04-28 09:55:49,139 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_97EXIT(lines 331 399) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L358-2(lines 358 396) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L358-3(lines 358 396) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L371(line 371) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L371-1(lines 371 374) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_97FINAL(lines 331 399) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L388(line 388) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L388-1(line 388) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L376-2(lines 376 393) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L376-3(lines 376 393) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L376-4(lines 376 393) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L389(lines 389 392) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L356(lines 356 397) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L352-2(lines 352 355) the Hoare annotation is: true [2022-04-28 09:55:49,140 INFO L902 garLoopResultBuilder]: At program point L352-3(lines 352 355) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L352-4(lines 332 399) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L365(line 365) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L365-1(lines 365 368) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L361(line 361) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L361-1(lines 361 364) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L290-1(line 290) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L288(lines 288 295) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L288-2(lines 288 295) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L284(lines 284 287) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_95ENTRY(lines 280 299) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_95EXIT(lines 280 299) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L297(line 297) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L296(line 296) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L297-1(line 297) the Hoare annotation is: true [2022-04-28 09:55:49,141 INFO L902 garLoopResultBuilder]: At program point L296-1(line 296) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L290(line 290) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_95FINAL(lines 280 299) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L318(lines 318 323) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L318-1(lines 316 328) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L316(line 316) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L316-2(line 316) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L316-3(line 316) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L316-5(lines 316 328) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L308-1(lines 308 315) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L308-3(lines 308 315) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L304(lines 304 307) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L308-4(lines 308 315) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_96FINAL(lines 300 330) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point L311(lines 311 314) the Hoare annotation is: true [2022-04-28 09:55:49,142 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_96ENTRY(lines 300 330) the Hoare annotation is: true [2022-04-28 09:55:49,143 INFO L902 garLoopResultBuilder]: At program point Id_MCDC_96EXIT(lines 300 330) the Hoare annotation is: true [2022-04-28 09:55:49,143 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:55:49,143 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~Id_MCDC_110~0.offset |old(~Id_MCDC_110~0.offset)|) (= ~Id_MCDC_109~0.offset |old(~Id_MCDC_109~0.offset)|) (= |~#Id_MCDC_112~0.base| |old(~#Id_MCDC_112~0.base)|) (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) (= |old(~Id_MCDC_106~0)| ~Id_MCDC_106~0) (= ~Id_MCDC_107~0.base |old(~Id_MCDC_107~0.base)|) (= |old(~#Id_MCDC_112~0.offset)| |~#Id_MCDC_112~0.offset|) (= ~Id_MCDC_108~0.base |old(~Id_MCDC_108~0.base)|) (= |old(~Id_MCDC_109~0.base)| ~Id_MCDC_109~0.base) (= |old(~#Id_MCDC_113~0.base)| |~#Id_MCDC_113~0.base|) (= |old(~#Id_MCDC_113~0.offset)| |~#Id_MCDC_113~0.offset|) (= |old(~Id_MCDC_110~0.base)| ~Id_MCDC_110~0.base) (= |old(~Id_MCDC_104~0)| ~Id_MCDC_104~0) (= |old(~Id_MCDC_108~0.offset)| ~Id_MCDC_108~0.offset) (= |old(~Id_MCDC_105~0)| ~Id_MCDC_105~0) (= ~Id_MCDC_107~0.offset |old(~Id_MCDC_107~0.offset)|) (= |old(~Id_MCDC_111~0.offset)| ~Id_MCDC_111~0.offset) (= |#NULL.offset| |old(#NULL.offset)|) (= ~Id_MCDC_111~0.base |old(~Id_MCDC_111~0.base)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:55:49,143 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:55:49,143 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:55:49,143 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:55:49,143 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:55:49,143 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:55:49,143 INFO L902 garLoopResultBuilder]: At program point avoid_zeroEXIT(lines 9 15) the Hoare annotation is: true [2022-04-28 09:55:49,143 INFO L902 garLoopResultBuilder]: At program point L11(lines 11 14) the Hoare annotation is: true [2022-04-28 09:55:49,143 INFO L902 garLoopResultBuilder]: At program point L11-2(lines 9 15) the Hoare annotation is: true [2022-04-28 09:55:49,143 INFO L902 garLoopResultBuilder]: At program point avoid_zeroENTRY(lines 9 15) the Hoare annotation is: true [2022-04-28 09:55:49,144 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~Id_MCDC_103|)) [2022-04-28 09:55:49,144 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 459 466) the Hoare annotation is: true [2022-04-28 09:55:49,144 INFO L895 garLoopResultBuilder]: At program point L461(lines 461 464) the Hoare annotation is: (or (<= 1 __VERIFIER_assert_~Id_MCDC_103) (not (<= 1 |__VERIFIER_assert_#in~Id_MCDC_103|))) [2022-04-28 09:55:49,144 INFO L895 garLoopResultBuilder]: At program point L461-2(lines 459 466) the Hoare annotation is: (or (<= 1 __VERIFIER_assert_~Id_MCDC_103) (not (<= 1 |__VERIFIER_assert_#in~Id_MCDC_103|))) [2022-04-28 09:55:49,144 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 459 466) the Hoare annotation is: (or (<= 1 __VERIFIER_assert_~Id_MCDC_103) (not (<= 1 |__VERIFIER_assert_#in~Id_MCDC_103|))) [2022-04-28 09:55:49,144 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 463) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~Id_MCDC_103|)) [2022-04-28 09:55:49,146 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-28 09:55:49,147 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:55:49,149 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:55:49,150 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:55:49,152 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:55:49,153 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 09:55:49,153 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 09:55:49,156 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-28 09:55:49,161 INFO L163 areAnnotationChecker]: CFG has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:55:49,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:55:49 BoogieIcfgContainer [2022-04-28 09:55:49,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:55:49,169 INFO L158 Benchmark]: Toolchain (without parser) took 4868.50ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 135.5MB in the beginning and 81.0MB in the end (delta: 54.6MB). Peak memory consumption was 92.4MB. Max. memory is 8.0GB. [2022-04-28 09:55:49,169 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:55:49,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.79ms. Allocated memory is still 182.5MB. Free memory was 135.4MB in the beginning and 152.3MB in the end (delta: -16.9MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-28 09:55:49,170 INFO L158 Benchmark]: Boogie Preprocessor took 51.05ms. Allocated memory is still 182.5MB. Free memory was 152.3MB in the beginning and 147.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-04-28 09:55:49,170 INFO L158 Benchmark]: RCFGBuilder took 639.33ms. Allocated memory is still 182.5MB. Free memory was 147.5MB in the beginning and 110.3MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-04-28 09:55:49,170 INFO L158 Benchmark]: TraceAbstraction took 3852.71ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 109.8MB in the beginning and 81.0MB in the end (delta: 28.8MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2022-04-28 09:55:49,171 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 319.79ms. Allocated memory is still 182.5MB. Free memory was 135.4MB in the beginning and 152.3MB in the end (delta: -16.9MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.05ms. Allocated memory is still 182.5MB. Free memory was 152.3MB in the beginning and 147.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 639.33ms. Allocated memory is still 182.5MB. Free memory was 147.5MB in the beginning and 110.3MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3852.71ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 109.8MB in the beginning and 81.0MB in the end (delta: 28.8MB). Peak memory consumption was 67.1MB. 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 - PositiveResult [Line: 463]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 135 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 615 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 293 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 128 LocationsWithAnnotation, 424 PreInvPairs, 536 NumberOfFragments, 354 HoareAnnotationTreeSize, 424 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 128 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: \old(Id_MCDC_114) == Id_MCDC_114 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 420]: Procedure Contract for Id_MCDC_100 Derived contract for procedure Id_MCDC_100: 1 - ProcedureContractResult [Line: 400]: Procedure Contract for Id_MCDC_99 Derived contract for procedure Id_MCDC_99: 1 - ProcedureContractResult [Line: 193]: Procedure Contract for Id_MCDC_89 Derived contract for procedure Id_MCDC_89: 1 - ProcedureContractResult [Line: 331]: Procedure Contract for Id_MCDC_97 Derived contract for procedure Id_MCDC_97: 1 - ProcedureContractResult [Line: 427]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 280]: Procedure Contract for Id_MCDC_95 Derived contract for procedure Id_MCDC_95: 1 - ProcedureContractResult [Line: 300]: Procedure Contract for Id_MCDC_96 Derived contract for procedure Id_MCDC_96: 1 - ProcedureContractResult [Line: 249]: Procedure Contract for Id_MCDC_92 Derived contract for procedure Id_MCDC_92: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for avoid_zero Derived contract for procedure avoid_zero: 1 - ProcedureContractResult [Line: 459]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 <= Id_MCDC_103 || !(1 <= \old(Id_MCDC_103)) RESULT: Ultimate proved your program to be correct! [2022-04-28 09:55:49,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...