/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/ofuf_4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:27:16,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:27:16,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:27:16,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:27:16,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:27:16,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:27:16,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:27:16,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:27:16,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:27:16,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:27:16,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:27:16,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:27:16,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:27:16,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:27:16,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:27:16,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:27:16,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:27:16,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:27:16,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:27:16,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:27:16,328 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:27:16,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:27:16,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:27:16,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:27:16,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:27:16,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:27:16,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:27:16,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:27:16,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:27:16,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:27:16,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:27:16,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:27:16,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:27:16,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:27:16,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:27:16,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:27:16,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:27:16,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:27:16,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:27:16,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:27:16,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:27:16,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:27:16,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:27:16,358 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:27:16,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:27:16,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:27:16,359 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:27:16,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:27:16,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:27:16,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:27:16,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:27:16,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:27:16,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:27:16,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:27:16,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:27:16,361 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:27:16,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:27:16,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:27:16,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:27:16,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:27:16,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:27:16,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:27:16,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:27:16,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:27:16,362 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:27:16,362 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:27:16,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:27:16,362 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:27:16,362 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-15 06:27:16,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:27:16,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:27:16,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:27:16,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:27:16,597 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:27:16,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/ofuf_4.c [2022-04-15 06:27:16,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a0d4600/9fd07cab57104455a1f54f23925fb11f/FLAG3437ed442 [2022-04-15 06:27:17,014 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:27:17,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/ofuf_4.c [2022-04-15 06:27:17,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a0d4600/9fd07cab57104455a1f54f23925fb11f/FLAG3437ed442 [2022-04-15 06:27:17,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a0d4600/9fd07cab57104455a1f54f23925fb11f [2022-04-15 06:27:17,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:27:17,034 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:27:17,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:27:17,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:27:17,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:27:17,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:27:17" (1/1) ... [2022-04-15 06:27:17,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b29b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:27:17, skipping insertion in model container [2022-04-15 06:27:17,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:27:17" (1/1) ... [2022-04-15 06:27:17,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:27:17,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:27:17,285 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_4.c[11358,11371] [2022-04-15 06:27:17,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:27:17,305 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:27:17,391 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_4.c[11358,11371] [2022-04-15 06:27:17,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:27:17,410 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:27:17,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:27:17 WrapperNode [2022-04-15 06:27:17,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:27:17,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:27:17,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:27:17,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:27:17,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:27:17" (1/1) ... [2022-04-15 06:27:17,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:27:17" (1/1) ... [2022-04-15 06:27:17,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:27:17" (1/1) ... [2022-04-15 06:27:17,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:27:17" (1/1) ... [2022-04-15 06:27:17,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:27:17" (1/1) ... [2022-04-15 06:27:17,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:27:17" (1/1) ... [2022-04-15 06:27:17,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:27:17" (1/1) ... [2022-04-15 06:27:17,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:27:17,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:27:17,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:27:17,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:27:17,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:27:17" (1/1) ... [2022-04-15 06:27:17,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:27:17,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:17,522 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-15 06:27:17,523 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-15 06:27:17,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:27:17,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:27:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:27:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:27:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure avoid_zero [2022-04-15 06:27:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_89 [2022-04-15 06:27:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_92 [2022-04-15 06:27:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_95 [2022-04-15 06:27:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_96 [2022-04-15 06:27:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_97 [2022-04-15 06:27:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_99 [2022-04-15 06:27:17,559 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_100 [2022-04-15 06:27:17,559 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:27:17,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:27:17,559 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:27:17,559 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:27:17,560 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:27:17,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:27:17,560 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:27:17,560 INFO L130 BoogieDeclarations]: Found specification of procedure avoid_zero [2022-04-15 06:27:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2022-04-15 06:27:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_89 [2022-04-15 06:27:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_92 [2022-04-15 06:27:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_95 [2022-04-15 06:27:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_96 [2022-04-15 06:27:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_97 [2022-04-15 06:27:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 06:27:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_99 [2022-04-15 06:27:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_100 [2022-04-15 06:27:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2022-04-15 06:27:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-04-15 06:27:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:27:17,705 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:27:17,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:27:18,213 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:27:18,219 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:27:18,219 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-04-15 06:27:18,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:27:18 BoogieIcfgContainer [2022-04-15 06:27:18,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:27:18,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:27:18,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:27:18,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:27:18,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:27:17" (1/3) ... [2022-04-15 06:27:18,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e226f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:27:18, skipping insertion in model container [2022-04-15 06:27:18,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:27:17" (2/3) ... [2022-04-15 06:27:18,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e226f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:27:18, skipping insertion in model container [2022-04-15 06:27:18,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:27:18" (3/3) ... [2022-04-15 06:27:18,227 INFO L111 eAbstractionObserver]: Analyzing ICFG ofuf_4.c [2022-04-15 06:27:18,230 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:27:18,230 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:27:18,257 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:27:18,261 INFO L340 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 [2022-04-15 06:27:18,261 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:27:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 100 states have (on average 1.54) internal successors, (154), 102 states have internal predecessors, (154), 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-15 06:27:18,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 06:27:18,283 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:18,283 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 06:27:18,283 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:18,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash -369665950, now seen corresponding path program 1 times [2022-04-15 06:27:18,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:18,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2121695458] [2022-04-15 06:27:18,299 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:27:18,299 INFO L85 PathProgramCache]: Analyzing trace with hash -369665950, now seen corresponding path program 2 times [2022-04-15 06:27:18,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:18,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457431302] [2022-04-15 06:27:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:18,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:18,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#(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(20, 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, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 8 + ~#Id_MCDC_113~0.offset, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 12 + ~#Id_MCDC_113~0.offset, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 16 + ~#Id_MCDC_113~0.offset, 4);~Id_MCDC_114~0 := 0; {132#true} is VALID [2022-04-15 06:27:18,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-15 06:27:18,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {132#true} {132#true} #393#return; {132#true} is VALID [2022-04-15 06:27:18,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:27:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:18,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#(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(4);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; {132#true} is VALID [2022-04-15 06:27:18,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} assume !(~Id_MCDC_132~0 % 256 < 4); {132#true} is VALID [2022-04-15 06:27:18,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume !(~Id_MCDC_123~0 % 4294967296 <= 6147); {132#true} is VALID [2022-04-15 06:27:18,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {132#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; {132#true} is VALID [2022-04-15 06:27:18,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-15 06:27:18,651 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {132#true} {132#true} #371#return; {132#true} is VALID [2022-04-15 06:27:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 06:27:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:18,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#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; {132#true} is VALID [2022-04-15 06:27:18,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} assume !(~Id_MCDC_90 % 4294967296 > ~Id_MCDC_91 % 4294967296); {132#true} is VALID [2022-04-15 06:27:18,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume !(~Id_MCDC_90 % 4294967296 < ~Id_MCDC_91 % 4294967296);#res := ~Id_MCDC_90; {132#true} is VALID [2022-04-15 06:27:18,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-15 06:27:18,663 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {132#true} {132#true} #387#return; {132#true} is VALID [2022-04-15 06:27:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 06:27:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:18,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#true} ~y := #in~y; {132#true} is VALID [2022-04-15 06:27:18,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} assume 0 == ~y;assume false; {133#false} is VALID [2022-04-15 06:27:18,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#false} assume true; {133#false} is VALID [2022-04-15 06:27:18,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133#false} {132#true} #389#return; {133#false} is VALID [2022-04-15 06:27:18,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {152#(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-15 06:27:18,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#(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(20, 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, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 8 + ~#Id_MCDC_113~0.offset, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 12 + ~#Id_MCDC_113~0.offset, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 16 + ~#Id_MCDC_113~0.offset, 4);~Id_MCDC_114~0 := 0; {132#true} is VALID [2022-04-15 06:27:18,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-15 06:27:18,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #393#return; {132#true} is VALID [2022-04-15 06:27:18,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret65 := main(); {132#true} is VALID [2022-04-15 06:27:18,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#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~ret64.base, #t~ret64.offset := fopen(9, 0, 10, 0);~Id_MCDC_158~0.base, ~Id_MCDC_158~0.offset := #t~ret64.base, #t~ret64.offset;havoc #t~ret64.base, #t~ret64.offset; {132#true} is VALID [2022-04-15 06:27:18,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} assume !(~Id_MCDC_158~0.base == 0 && ~Id_MCDC_158~0.offset == 0); {132#true} is VALID [2022-04-15 06:27:18,671 INFO L272 TraceCheckUtils]: 7: Hoare triple {132#true} call Id_MCDC_100(); {132#true} is VALID [2022-04-15 06:27:18,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {132#true} havoc ~Id_MCDC_141~0;havoc ~Id_MCDC_142~0.base, ~Id_MCDC_142~0.offset; {132#true} is VALID [2022-04-15 06:27:18,672 INFO L272 TraceCheckUtils]: 9: Hoare triple {132#true} call Id_MCDC_99(); {132#true} is VALID [2022-04-15 06:27:18,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {132#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~malloc53.base, #t~malloc53.offset := #Ultimate.allocOnHeap(372);call write~$Pointer$(#t~malloc53.base, #t~malloc53.offset, ~#Id_MCDC_113~0.base, 12 + ~#Id_MCDC_113~0.offset, 4);havoc #t~malloc53.base, #t~malloc53.offset; {132#true} is VALID [2022-04-15 06:27:18,676 INFO L272 TraceCheckUtils]: 11: Hoare triple {132#true} call #t~ret54 := Id_MCDC_97(); {153#(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-15 06:27:18,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {153#(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(4);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; {132#true} is VALID [2022-04-15 06:27:18,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {132#true} assume !(~Id_MCDC_132~0 % 256 < 4); {132#true} is VALID [2022-04-15 06:27:18,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {132#true} assume !(~Id_MCDC_123~0 % 4294967296 <= 6147); {132#true} is VALID [2022-04-15 06:27:18,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {132#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; {132#true} is VALID [2022-04-15 06:27:18,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-15 06:27:18,677 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {132#true} {132#true} #371#return; {132#true} is VALID [2022-04-15 06:27:18,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {132#true} havoc #t~ret54;~Id_MCDC_140~0 := 0; {132#true} is VALID [2022-04-15 06:27:18,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {132#true} assume !(~Id_MCDC_140~0 % 4294967296 < 4); {132#true} is VALID [2022-04-15 06:27:18,678 INFO L272 TraceCheckUtils]: 20: Hoare triple {132#true} call #t~ret63 := Id_MCDC_95(4, ~#Id_MCDC_139~0.base, ~#Id_MCDC_139~0.offset); {132#true} is VALID [2022-04-15 06:27:18,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {132#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; {132#true} is VALID [2022-04-15 06:27:18,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {132#true} assume !(~Id_MCDC_93 % 4294967296 < 2); {132#true} is VALID [2022-04-15 06:27:18,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {132#true} assume 2 != ~Id_MCDC_93 % 4294967296; {132#true} is VALID [2022-04-15 06:27:18,679 INFO L272 TraceCheckUtils]: 24: Hoare triple {132#true} call #t~ret18 := Id_MCDC_95(~Id_MCDC_93 - 1, ~Id_MCDC_94.base, 1 + ~Id_MCDC_94.offset); {132#true} is VALID [2022-04-15 06:27:18,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {132#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; {132#true} is VALID [2022-04-15 06:27:18,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {132#true} assume !(~Id_MCDC_93 % 4294967296 < 2); {132#true} is VALID [2022-04-15 06:27:18,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {132#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; {132#true} is VALID [2022-04-15 06:27:18,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {132#true} call #t~mem20 := read~int(~Id_MCDC_94.base, ~Id_MCDC_94.offset, 1); {132#true} is VALID [2022-04-15 06:27:18,680 INFO L272 TraceCheckUtils]: 29: Hoare triple {132#true} call #t~ret21 := Id_MCDC_92(#t~mem20, ~Id_MCDC_122~0); {132#true} is VALID [2022-04-15 06:27:18,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {132#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; {132#true} is VALID [2022-04-15 06:27:18,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {132#true} assume !(~Id_MCDC_90 % 4294967296 > ~Id_MCDC_91 % 4294967296); {132#true} is VALID [2022-04-15 06:27:18,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {132#true} assume !(~Id_MCDC_90 % 4294967296 < ~Id_MCDC_91 % 4294967296);#res := ~Id_MCDC_90; {132#true} is VALID [2022-04-15 06:27:18,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-15 06:27:18,681 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {132#true} {132#true} #387#return; {132#true} is VALID [2022-04-15 06:27:18,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {132#true} ~Id_MCDC_121~0 := #t~ret21;havoc #t~mem20;havoc #t~ret21; {132#true} is VALID [2022-04-15 06:27:18,681 INFO L272 TraceCheckUtils]: 36: Hoare triple {132#true} call avoid_zero((if 0 != ~Id_MCDC_121~0 % 4294967296 then 1 else 0)); {132#true} is VALID [2022-04-15 06:27:18,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {132#true} ~y := #in~y; {132#true} is VALID [2022-04-15 06:27:18,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {132#true} assume 0 == ~y;assume false; {133#false} is VALID [2022-04-15 06:27:18,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {133#false} assume true; {133#false} is VALID [2022-04-15 06:27:18,685 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {133#false} {132#true} #389#return; {133#false} is VALID [2022-04-15 06:27:18,685 INFO L290 TraceCheckUtils]: 41: Hoare triple {133#false} call #t~mem22 := read~int(~Id_MCDC_94.base, ~Id_MCDC_94.offset, 1);#t~short24 := (if #t~mem22 * ~Id_MCDC_122~0 % 4294967296 < 0 && 0 != #t~mem22 * ~Id_MCDC_122~0 % 4294967296 % (~Id_MCDC_121~0 % 4294967296) then (if ~Id_MCDC_121~0 % 4294967296 < 0 then #t~mem22 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296) - 1 else 1 + #t~mem22 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296)) else #t~mem22 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296)) % 4294967296 >= 0; {133#false} is VALID [2022-04-15 06:27:18,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {133#false} assume #t~short24;call #t~mem23 := read~int(~Id_MCDC_94.base, ~Id_MCDC_94.offset, 1);#t~short24 := (if #t~mem23 * ~Id_MCDC_122~0 % 4294967296 < 0 && 0 != #t~mem23 * ~Id_MCDC_122~0 % 4294967296 % (~Id_MCDC_121~0 % 4294967296) then (if ~Id_MCDC_121~0 % 4294967296 < 0 then #t~mem23 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296) - 1 else 1 + #t~mem23 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296)) else #t~mem23 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296)) % 4294967296 <= 4294967295; {133#false} is VALID [2022-04-15 06:27:18,685 INFO L272 TraceCheckUtils]: 43: Hoare triple {133#false} call __VERIFIER_assert((if #t~short24 then 1 else 0)); {133#false} is VALID [2022-04-15 06:27:18,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {133#false} ~Id_MCDC_103 := #in~Id_MCDC_103; {133#false} is VALID [2022-04-15 06:27:18,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {133#false} assume 0 == ~Id_MCDC_103; {133#false} is VALID [2022-04-15 06:27:18,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-04-15 06:27:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:27:18,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:18,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457431302] [2022-04-15 06:27:18,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457431302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:18,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:18,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:27:18,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:18,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2121695458] [2022-04-15 06:27:18,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2121695458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:18,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:18,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:27:18,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691694228] [2022-04-15 06:27:18,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:18,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-04-15 06:27:18,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:18,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 06:27:18,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:18,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:27:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:18,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:27:18,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:27:18,799 INFO L87 Difference]: Start difference. First operand has 129 states, 100 states have (on average 1.54) internal successors, (154), 102 states have internal predecessors, (154), 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 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 06:27:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:19,811 INFO L93 Difference]: Finished difference Result 245 states and 367 transitions. [2022-04-15 06:27:19,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:27:19,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-04-15 06:27:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 06:27:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 367 transitions. [2022-04-15 06:27:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 06:27:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 367 transitions. [2022-04-15 06:27:19,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 367 transitions. [2022-04-15 06:27:20,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:20,296 INFO L225 Difference]: With dead ends: 245 [2022-04-15 06:27:20,296 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 06:27:20,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-15 06:27:20,302 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 242 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:20,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 138 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:27:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 06:27:20,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-15 06:27:20,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:20,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 96 states have internal predecessors, (139), 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-15 06:27:20,350 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 96 states have internal predecessors, (139), 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-15 06:27:20,351 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 96 states have internal predecessors, (139), 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-15 06:27:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:20,363 INFO L93 Difference]: Finished difference Result 120 states and 167 transitions. [2022-04-15 06:27:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 167 transitions. [2022-04-15 06:27:20,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:20,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:20,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 96 states have internal predecessors, (139), 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 120 states. [2022-04-15 06:27:20,373 INFO L87 Difference]: Start difference. First operand has 120 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 96 states have internal predecessors, (139), 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 120 states. [2022-04-15 06:27:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:20,383 INFO L93 Difference]: Finished difference Result 120 states and 167 transitions. [2022-04-15 06:27:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 167 transitions. [2022-04-15 06:27:20,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:20,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:20,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:20,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 96 states have internal predecessors, (139), 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-15 06:27:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 167 transitions. [2022-04-15 06:27:20,395 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 167 transitions. Word has length 47 [2022-04-15 06:27:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:20,395 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 167 transitions. [2022-04-15 06:27:20,396 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 06:27:20,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 167 transitions. [2022-04-15 06:27:20,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 167 transitions. [2022-04-15 06:27:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 06:27:20,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:20,653 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1] [2022-04-15 06:27:20,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:27:20,653 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1781973424, now seen corresponding path program 1 times [2022-04-15 06:27:20,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:20,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1905698434] [2022-04-15 06:27:20,654 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:27:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1781973424, now seen corresponding path program 2 times [2022-04-15 06:27:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:20,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36131952] [2022-04-15 06:27:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:20,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:20,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {1152#(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(20, 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, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 8 + ~#Id_MCDC_113~0.offset, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 12 + ~#Id_MCDC_113~0.offset, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 16 + ~#Id_MCDC_113~0.offset, 4);~Id_MCDC_114~0 := 0; {1129#true} is VALID [2022-04-15 06:27:20,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-04-15 06:27:20,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1129#true} {1129#true} #393#return; {1129#true} is VALID [2022-04-15 06:27:20,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 06:27:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:20,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#(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(4);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; {1129#true} is VALID [2022-04-15 06:27:20,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {1129#true} assume !(~Id_MCDC_132~0 % 256 < 4); {1129#true} is VALID [2022-04-15 06:27:20,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {1129#true} assume !(~Id_MCDC_123~0 % 4294967296 <= 6147); {1129#true} is VALID [2022-04-15 06:27:20,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {1129#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; {1129#true} is VALID [2022-04-15 06:27:20,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-04-15 06:27:20,844 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1129#true} {1129#true} #371#return; {1129#true} is VALID [2022-04-15 06:27:20,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-15 06:27:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:20,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {1129#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; {1129#true} is VALID [2022-04-15 06:27:20,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {1129#true} assume !(~Id_MCDC_90 % 4294967296 > ~Id_MCDC_91 % 4294967296); {1129#true} is VALID [2022-04-15 06:27:20,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {1129#true} assume !(~Id_MCDC_90 % 4294967296 < ~Id_MCDC_91 % 4294967296);#res := ~Id_MCDC_90; {1129#true} is VALID [2022-04-15 06:27:20,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-04-15 06:27:20,859 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1129#true} {1129#true} #387#return; {1129#true} is VALID [2022-04-15 06:27:20,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 06:27:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:20,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {1129#true} ~y := #in~y; {1129#true} is VALID [2022-04-15 06:27:20,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {1129#true} assume !(0 == ~y); {1129#true} is VALID [2022-04-15 06:27:20,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-04-15 06:27:20,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1129#true} {1129#true} #389#return; {1129#true} is VALID [2022-04-15 06:27:20,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {1129#true} call ULTIMATE.init(); {1152#(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-15 06:27:20,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {1152#(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(20, 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, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 8 + ~#Id_MCDC_113~0.offset, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 12 + ~#Id_MCDC_113~0.offset, 4);call write~init~$Pointer$(0, 0, ~#Id_MCDC_113~0.base, 16 + ~#Id_MCDC_113~0.offset, 4);~Id_MCDC_114~0 := 0; {1129#true} is VALID [2022-04-15 06:27:20,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-04-15 06:27:20,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1129#true} {1129#true} #393#return; {1129#true} is VALID [2022-04-15 06:27:20,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {1129#true} call #t~ret65 := main(); {1129#true} is VALID [2022-04-15 06:27:20,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {1129#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~ret64.base, #t~ret64.offset := fopen(9, 0, 10, 0);~Id_MCDC_158~0.base, ~Id_MCDC_158~0.offset := #t~ret64.base, #t~ret64.offset;havoc #t~ret64.base, #t~ret64.offset; {1129#true} is VALID [2022-04-15 06:27:20,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {1129#true} assume !(~Id_MCDC_158~0.base == 0 && ~Id_MCDC_158~0.offset == 0); {1129#true} is VALID [2022-04-15 06:27:20,866 INFO L272 TraceCheckUtils]: 7: Hoare triple {1129#true} call Id_MCDC_100(); {1129#true} is VALID [2022-04-15 06:27:20,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {1129#true} havoc ~Id_MCDC_141~0;havoc ~Id_MCDC_142~0.base, ~Id_MCDC_142~0.offset; {1129#true} is VALID [2022-04-15 06:27:20,866 INFO L272 TraceCheckUtils]: 9: Hoare triple {1129#true} call Id_MCDC_99(); {1129#true} is VALID [2022-04-15 06:27:20,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {1129#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~malloc53.base, #t~malloc53.offset := #Ultimate.allocOnHeap(372);call write~$Pointer$(#t~malloc53.base, #t~malloc53.offset, ~#Id_MCDC_113~0.base, 12 + ~#Id_MCDC_113~0.offset, 4);havoc #t~malloc53.base, #t~malloc53.offset; {1129#true} is VALID [2022-04-15 06:27:20,869 INFO L272 TraceCheckUtils]: 11: Hoare triple {1129#true} call #t~ret54 := Id_MCDC_97(); {1153#(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-15 06:27:20,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {1153#(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(4);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; {1129#true} is VALID [2022-04-15 06:27:20,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {1129#true} assume !(~Id_MCDC_132~0 % 256 < 4); {1129#true} is VALID [2022-04-15 06:27:20,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {1129#true} assume !(~Id_MCDC_123~0 % 4294967296 <= 6147); {1129#true} is VALID [2022-04-15 06:27:20,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {1129#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; {1129#true} is VALID [2022-04-15 06:27:20,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-04-15 06:27:20,870 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1129#true} {1129#true} #371#return; {1129#true} is VALID [2022-04-15 06:27:20,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {1129#true} havoc #t~ret54;~Id_MCDC_140~0 := 0; {1129#true} is VALID [2022-04-15 06:27:20,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {1129#true} assume !(~Id_MCDC_140~0 % 4294967296 < 4); {1129#true} is VALID [2022-04-15 06:27:20,870 INFO L272 TraceCheckUtils]: 20: Hoare triple {1129#true} call #t~ret63 := Id_MCDC_95(4, ~#Id_MCDC_139~0.base, ~#Id_MCDC_139~0.offset); {1129#true} is VALID [2022-04-15 06:27:20,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {1129#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; {1129#true} is VALID [2022-04-15 06:27:20,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {1129#true} assume !(~Id_MCDC_93 % 4294967296 < 2); {1129#true} is VALID [2022-04-15 06:27:20,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {1129#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; {1129#true} is VALID [2022-04-15 06:27:20,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {1129#true} call #t~mem20 := read~int(~Id_MCDC_94.base, ~Id_MCDC_94.offset, 1); {1129#true} is VALID [2022-04-15 06:27:20,871 INFO L272 TraceCheckUtils]: 25: Hoare triple {1129#true} call #t~ret21 := Id_MCDC_92(#t~mem20, ~Id_MCDC_122~0); {1129#true} is VALID [2022-04-15 06:27:20,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {1129#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; {1129#true} is VALID [2022-04-15 06:27:20,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {1129#true} assume !(~Id_MCDC_90 % 4294967296 > ~Id_MCDC_91 % 4294967296); {1129#true} is VALID [2022-04-15 06:27:20,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {1129#true} assume !(~Id_MCDC_90 % 4294967296 < ~Id_MCDC_91 % 4294967296);#res := ~Id_MCDC_90; {1129#true} is VALID [2022-04-15 06:27:20,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-04-15 06:27:20,871 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1129#true} {1129#true} #387#return; {1129#true} is VALID [2022-04-15 06:27:20,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {1129#true} ~Id_MCDC_121~0 := #t~ret21;havoc #t~mem20;havoc #t~ret21; {1129#true} is VALID [2022-04-15 06:27:20,872 INFO L272 TraceCheckUtils]: 32: Hoare triple {1129#true} call avoid_zero((if 0 != ~Id_MCDC_121~0 % 4294967296 then 1 else 0)); {1129#true} is VALID [2022-04-15 06:27:20,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {1129#true} ~y := #in~y; {1129#true} is VALID [2022-04-15 06:27:20,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {1129#true} assume !(0 == ~y); {1129#true} is VALID [2022-04-15 06:27:20,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-04-15 06:27:20,872 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1129#true} {1129#true} #389#return; {1129#true} is VALID [2022-04-15 06:27:20,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {1129#true} call #t~mem22 := read~int(~Id_MCDC_94.base, ~Id_MCDC_94.offset, 1);#t~short24 := (if #t~mem22 * ~Id_MCDC_122~0 % 4294967296 < 0 && 0 != #t~mem22 * ~Id_MCDC_122~0 % 4294967296 % (~Id_MCDC_121~0 % 4294967296) then (if ~Id_MCDC_121~0 % 4294967296 < 0 then #t~mem22 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296) - 1 else 1 + #t~mem22 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296)) else #t~mem22 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296)) % 4294967296 >= 0; {1129#true} is VALID [2022-04-15 06:27:20,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {1129#true} assume #t~short24;call #t~mem23 := read~int(~Id_MCDC_94.base, ~Id_MCDC_94.offset, 1);#t~short24 := (if #t~mem23 * ~Id_MCDC_122~0 % 4294967296 < 0 && 0 != #t~mem23 * ~Id_MCDC_122~0 % 4294967296 % (~Id_MCDC_121~0 % 4294967296) then (if ~Id_MCDC_121~0 % 4294967296 < 0 then #t~mem23 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296) - 1 else 1 + #t~mem23 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296)) else #t~mem23 * ~Id_MCDC_122~0 % 4294967296 / (~Id_MCDC_121~0 % 4294967296)) % 4294967296 <= 4294967295; {1149#|Id_MCDC_95_#t~short24|} is VALID [2022-04-15 06:27:20,876 INFO L272 TraceCheckUtils]: 39: Hoare triple {1149#|Id_MCDC_95_#t~short24|} call __VERIFIER_assert((if #t~short24 then 1 else 0)); {1150#(not (= |__VERIFIER_assert_#in~Id_MCDC_103| 0))} is VALID [2022-04-15 06:27:20,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {1150#(not (= |__VERIFIER_assert_#in~Id_MCDC_103| 0))} ~Id_MCDC_103 := #in~Id_MCDC_103; {1151#(not (= __VERIFIER_assert_~Id_MCDC_103 0))} is VALID [2022-04-15 06:27:20,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {1151#(not (= __VERIFIER_assert_~Id_MCDC_103 0))} assume 0 == ~Id_MCDC_103; {1130#false} is VALID [2022-04-15 06:27:20,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {1130#false} assume !false; {1130#false} is VALID [2022-04-15 06:27:20,877 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-15 06:27:20,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:20,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36131952] [2022-04-15 06:27:20,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36131952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:20,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:20,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:27:20,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:20,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1905698434] [2022-04-15 06:27:20,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1905698434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:20,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:20,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:27:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093774267] [2022-04-15 06:27:20,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:20,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-04-15 06:27:20,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:20,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 06:27:20,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:20,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:27:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:20,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:27:20,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:27:20,908 INFO L87 Difference]: Start difference. First operand 120 states and 167 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 06:27:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:23,018 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2022-04-15 06:27:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:27:23,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-04-15 06:27:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 06:27:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2022-04-15 06:27:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 06:27:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2022-04-15 06:27:23,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 201 transitions. [2022-04-15 06:27:23,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:23,304 INFO L225 Difference]: With dead ends: 148 [2022-04-15 06:27:23,304 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 06:27:23,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:27:23,306 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 233 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:23,307 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 125 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:27:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 06:27:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 06:27:23,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:23,308 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-15 06:27:23,308 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-15 06:27:23,308 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-15 06:27:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:23,308 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:27:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:27:23,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:23,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:23,309 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-15 06:27:23,309 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-15 06:27:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:23,309 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:27:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:27:23,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:23,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:23,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:23,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:23,309 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-15 06:27:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 06:27:23,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-04-15 06:27:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:23,310 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 06:27:23,310 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 06:27:23,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 06:27:23,310 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-15 06:27:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:27:23,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:23,312 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 06:27:23,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:27:23,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 06:27:23,738 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 06:27:23,739 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 06:27:23,739 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 06:27:23,739 INFO L885 garLoopResultBuilder]: At program point L221(line 221) the Hoare annotation is: true [2022-04-15 06:27:23,739 INFO L885 garLoopResultBuilder]: At program point L217(line 217) the Hoare annotation is: true [2022-04-15 06:27:23,739 INFO L885 garLoopResultBuilder]: At program point L217-2(line 217) the Hoare annotation is: true [2022-04-15 06:27:23,739 INFO L885 garLoopResultBuilder]: At program point L209(lines 209 225) the Hoare annotation is: true [2022-04-15 06:27:23,739 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_89ENTRY(lines 193 248) the Hoare annotation is: true [2022-04-15 06:27:23,739 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_89EXIT(lines 193 248) the Hoare annotation is: true [2022-04-15 06:27:23,740 INFO L885 garLoopResultBuilder]: At program point L234(line 234) the Hoare annotation is: true [2022-04-15 06:27:23,740 INFO L885 garLoopResultBuilder]: At program point L234-2(line 234) the Hoare annotation is: true [2022-04-15 06:27:23,740 INFO L885 garLoopResultBuilder]: At program point L234-3(line 234) the Hoare annotation is: true [2022-04-15 06:27:23,740 INFO L885 garLoopResultBuilder]: At program point L234-5(lines 234 246) the Hoare annotation is: true [2022-04-15 06:27:23,740 INFO L885 garLoopResultBuilder]: At program point L226-1(lines 226 233) the Hoare annotation is: true [2022-04-15 06:27:23,740 INFO L885 garLoopResultBuilder]: At program point L226-3(lines 226 233) the Hoare annotation is: true [2022-04-15 06:27:23,740 INFO L885 garLoopResultBuilder]: At program point L226-4(lines 226 233) the Hoare annotation is: true [2022-04-15 06:27:23,740 INFO L885 garLoopResultBuilder]: At program point L218(line 218) the Hoare annotation is: true [2022-04-15 06:27:23,740 INFO L885 garLoopResultBuilder]: At program point L214(line 214) the Hoare annotation is: true [2022-04-15 06:27:23,741 INFO L885 garLoopResultBuilder]: At program point L214-2(line 214) the Hoare annotation is: true [2022-04-15 06:27:23,741 INFO L885 garLoopResultBuilder]: At program point L202(lines 202 208) the Hoare annotation is: true [2022-04-15 06:27:23,741 INFO L885 garLoopResultBuilder]: At program point L202-2(lines 202 208) the Hoare annotation is: true [2022-04-15 06:27:23,741 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_89FINAL(lines 193 248) the Hoare annotation is: true [2022-04-15 06:27:23,741 INFO L885 garLoopResultBuilder]: At program point L198(lines 198 201) the Hoare annotation is: true [2022-04-15 06:27:23,741 INFO L885 garLoopResultBuilder]: At program point L223(line 223) the Hoare annotation is: true [2022-04-15 06:27:23,741 INFO L885 garLoopResultBuilder]: At program point L215(line 215) the Hoare annotation is: true [2022-04-15 06:27:23,741 INFO L885 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: true [2022-04-15 06:27:23,742 INFO L885 garLoopResultBuilder]: At program point L211-2(line 211) the Hoare annotation is: true [2022-04-15 06:27:23,742 INFO L885 garLoopResultBuilder]: At program point L236(lines 236 241) the Hoare annotation is: true [2022-04-15 06:27:23,742 INFO L885 garLoopResultBuilder]: At program point L236-1(lines 234 246) the Hoare annotation is: true [2022-04-15 06:27:23,742 INFO L885 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: true [2022-04-15 06:27:23,742 INFO L885 garLoopResultBuilder]: At program point L220-2(line 220) the Hoare annotation is: true [2022-04-15 06:27:23,742 INFO L885 garLoopResultBuilder]: At program point L212(line 212) the Hoare annotation is: true [2022-04-15 06:27:23,742 INFO L885 garLoopResultBuilder]: At program point L204(lines 204 207) the Hoare annotation is: true [2022-04-15 06:27:23,742 INFO L885 garLoopResultBuilder]: At program point L229(lines 229 232) the Hoare annotation is: true [2022-04-15 06:27:23,742 INFO L878 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-15 06:27:23,743 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 427 458) the Hoare annotation is: true [2022-04-15 06:27:23,743 INFO L878 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-15 06:27:23,743 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 427 458) the Hoare annotation is: true [2022-04-15 06:27:23,743 INFO L878 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-15 06:27:23,743 INFO L885 garLoopResultBuilder]: At program point L255(lines 255 269) the Hoare annotation is: true [2022-04-15 06:27:23,743 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_92ENTRY(lines 249 279) the Hoare annotation is: true [2022-04-15 06:27:23,743 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_92EXIT(lines 249 279) the Hoare annotation is: true [2022-04-15 06:27:23,743 INFO L885 garLoopResultBuilder]: At program point L272(line 272) the Hoare annotation is: true [2022-04-15 06:27:23,743 INFO L885 garLoopResultBuilder]: At program point L272-1(line 272) the Hoare annotation is: true [2022-04-15 06:27:23,744 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_92FINAL(lines 249 279) the Hoare annotation is: true [2022-04-15 06:27:23,744 INFO L885 garLoopResultBuilder]: At program point L270-1(lines 250 279) the Hoare annotation is: true [2022-04-15 06:27:23,744 INFO L885 garLoopResultBuilder]: At program point L270-2(lines 270 277) the Hoare annotation is: true [2022-04-15 06:27:23,744 INFO L885 garLoopResultBuilder]: At program point L261(lines 261 269) the Hoare annotation is: true [2022-04-15 06:27:23,744 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_100FINAL(lines 420 426) the Hoare annotation is: true [2022-04-15 06:27:23,744 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_100EXIT(lines 420 426) the Hoare annotation is: true [2022-04-15 06:27:23,744 INFO L878 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-15 06:27:23,744 INFO L878 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-15 06:27:23,744 INFO L878 garLoopResultBuilder]: At program point L417(line 417) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-15 06:27:23,745 INFO L878 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-15 06:27:23,745 INFO L878 garLoopResultBuilder]: At program point L405-1(line 405) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-15 06:27:23,745 INFO L878 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-15 06:27:23,745 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_99EXIT(lines 400 419) the Hoare annotation is: true [2022-04-15 06:27:23,745 INFO L878 garLoopResultBuilder]: At program point L408(line 408) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-15 06:27:23,745 INFO L878 garLoopResultBuilder]: At program point L408-2(lines 408 415) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-15 06:27:23,745 INFO L878 garLoopResultBuilder]: At program point L406-2(lines 406 416) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-15 06:27:23,745 INFO L878 garLoopResultBuilder]: At program point L406-3(lines 406 416) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-15 06:27:23,745 INFO L878 garLoopResultBuilder]: At program point L406-4(lines 406 416) the Hoare annotation is: (= |old(~Id_MCDC_114~0)| ~Id_MCDC_114~0) [2022-04-15 06:27:23,746 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_99FINAL(lines 400 419) the Hoare annotation is: true [2022-04-15 06:27:23,746 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-15 06:27:23,746 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-15 06:27:23,746 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-15 06:27:23,746 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-15 06:27:23,746 INFO L885 garLoopResultBuilder]: At program point L378(line 378) the Hoare annotation is: true [2022-04-15 06:27:23,746 INFO L885 garLoopResultBuilder]: At program point L378-1(lines 378 381) the Hoare annotation is: true [2022-04-15 06:27:23,746 INFO L878 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-15 06:27:23,746 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_97EXIT(lines 331 399) the Hoare annotation is: true [2022-04-15 06:27:23,746 INFO L885 garLoopResultBuilder]: At program point L358-2(lines 358 396) the Hoare annotation is: true [2022-04-15 06:27:23,747 INFO L885 garLoopResultBuilder]: At program point L358-3(lines 358 396) the Hoare annotation is: true [2022-04-15 06:27:23,747 INFO L885 garLoopResultBuilder]: At program point L371(line 371) the Hoare annotation is: true [2022-04-15 06:27:23,747 INFO L885 garLoopResultBuilder]: At program point L371-1(lines 371 374) the Hoare annotation is: true [2022-04-15 06:27:23,747 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_97FINAL(lines 331 399) the Hoare annotation is: true [2022-04-15 06:27:23,747 INFO L885 garLoopResultBuilder]: At program point L388(line 388) the Hoare annotation is: true [2022-04-15 06:27:23,747 INFO L885 garLoopResultBuilder]: At program point L388-1(line 388) the Hoare annotation is: true [2022-04-15 06:27:23,747 INFO L885 garLoopResultBuilder]: At program point L376-2(lines 376 393) the Hoare annotation is: true [2022-04-15 06:27:23,747 INFO L885 garLoopResultBuilder]: At program point L376-3(lines 376 393) the Hoare annotation is: true [2022-04-15 06:27:23,747 INFO L885 garLoopResultBuilder]: At program point L376-4(lines 376 393) the Hoare annotation is: true [2022-04-15 06:27:23,747 INFO L885 garLoopResultBuilder]: At program point L389(lines 389 392) the Hoare annotation is: true [2022-04-15 06:27:23,748 INFO L885 garLoopResultBuilder]: At program point L356(lines 356 397) the Hoare annotation is: true [2022-04-15 06:27:23,748 INFO L885 garLoopResultBuilder]: At program point L352-2(lines 352 355) the Hoare annotation is: true [2022-04-15 06:27:23,748 INFO L885 garLoopResultBuilder]: At program point L352-3(lines 352 355) the Hoare annotation is: true [2022-04-15 06:27:23,748 INFO L885 garLoopResultBuilder]: At program point L352-4(lines 332 399) the Hoare annotation is: true [2022-04-15 06:27:23,748 INFO L885 garLoopResultBuilder]: At program point L365(line 365) the Hoare annotation is: true [2022-04-15 06:27:23,748 INFO L885 garLoopResultBuilder]: At program point L365-1(lines 365 368) the Hoare annotation is: true [2022-04-15 06:27:23,748 INFO L885 garLoopResultBuilder]: At program point L361(line 361) the Hoare annotation is: true [2022-04-15 06:27:23,748 INFO L885 garLoopResultBuilder]: At program point L361-1(lines 361 364) the Hoare annotation is: true [2022-04-15 06:27:23,748 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_95ENTRY(lines 280 299) the Hoare annotation is: true [2022-04-15 06:27:23,748 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_95EXIT(lines 280 299) the Hoare annotation is: true [2022-04-15 06:27:23,749 INFO L878 garLoopResultBuilder]: At program point L298(line 298) the Hoare annotation is: |Id_MCDC_95_#t~short24| [2022-04-15 06:27:23,749 INFO L885 garLoopResultBuilder]: At program point L296(line 296) the Hoare annotation is: true [2022-04-15 06:27:23,749 INFO L878 garLoopResultBuilder]: At program point L298-2(line 298) the Hoare annotation is: |Id_MCDC_95_#t~short24| [2022-04-15 06:27:23,749 INFO L885 garLoopResultBuilder]: At program point L296-1(line 296) the Hoare annotation is: true [2022-04-15 06:27:23,749 INFO L878 garLoopResultBuilder]: At program point L298-3(line 298) the Hoare annotation is: |Id_MCDC_95_#t~short24| [2022-04-15 06:27:23,749 INFO L885 garLoopResultBuilder]: At program point L290(line 290) the Hoare annotation is: true [2022-04-15 06:27:23,749 INFO L885 garLoopResultBuilder]: At program point L290-1(line 290) the Hoare annotation is: true [2022-04-15 06:27:23,749 INFO L885 garLoopResultBuilder]: At program point L288(lines 288 295) the Hoare annotation is: true [2022-04-15 06:27:23,749 INFO L885 garLoopResultBuilder]: At program point L288-2(lines 288 295) the Hoare annotation is: true [2022-04-15 06:27:23,749 INFO L885 garLoopResultBuilder]: At program point L284(lines 284 287) the Hoare annotation is: true [2022-04-15 06:27:23,749 INFO L885 garLoopResultBuilder]: At program point L297(line 297) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point L297-1(line 297) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_95FINAL(lines 280 299) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point L318(lines 318 323) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point L318-1(lines 316 328) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point L316(line 316) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point L316-2(line 316) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point L316-3(line 316) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point L316-5(lines 316 328) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point L308-1(lines 308 315) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point L308-3(lines 308 315) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point L304(lines 304 307) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point L308-4(lines 308 315) the Hoare annotation is: true [2022-04-15 06:27:23,750 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_96FINAL(lines 300 330) the Hoare annotation is: true [2022-04-15 06:27:23,751 INFO L885 garLoopResultBuilder]: At program point L311(lines 311 314) the Hoare annotation is: true [2022-04-15 06:27:23,751 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_96ENTRY(lines 300 330) the Hoare annotation is: true [2022-04-15 06:27:23,751 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_96EXIT(lines 300 330) the Hoare annotation is: true [2022-04-15 06:27:23,751 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:27:23,751 INFO L878 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-15 06:27:23,751 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:27:23,751 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:27:23,751 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 06:27:23,751 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 06:27:23,751 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:27:23,751 INFO L885 garLoopResultBuilder]: At program point avoid_zeroEXIT(lines 9 15) the Hoare annotation is: true [2022-04-15 06:27:23,752 INFO L885 garLoopResultBuilder]: At program point L11(lines 11 14) the Hoare annotation is: true [2022-04-15 06:27:23,752 INFO L885 garLoopResultBuilder]: At program point L11-2(lines 9 15) the Hoare annotation is: true [2022-04-15 06:27:23,752 INFO L885 garLoopResultBuilder]: At program point avoid_zeroENTRY(lines 9 15) the Hoare annotation is: true [2022-04-15 06:27:23,752 INFO L878 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (= |__VERIFIER_assert_#in~Id_MCDC_103| 0) [2022-04-15 06:27:23,752 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 459 466) the Hoare annotation is: true [2022-04-15 06:27:23,752 INFO L878 garLoopResultBuilder]: At program point L461(lines 461 464) the Hoare annotation is: (or (not (= __VERIFIER_assert_~Id_MCDC_103 0)) (= |__VERIFIER_assert_#in~Id_MCDC_103| 0)) [2022-04-15 06:27:23,752 INFO L878 garLoopResultBuilder]: At program point L461-2(lines 459 466) the Hoare annotation is: (or (not (= __VERIFIER_assert_~Id_MCDC_103 0)) (= |__VERIFIER_assert_#in~Id_MCDC_103| 0)) [2022-04-15 06:27:23,752 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 459 466) the Hoare annotation is: (or (not (= __VERIFIER_assert_~Id_MCDC_103 0)) (= |__VERIFIER_assert_#in~Id_MCDC_103| 0)) [2022-04-15 06:27:23,752 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 463) the Hoare annotation is: (= |__VERIFIER_assert_#in~Id_MCDC_103| 0) [2022-04-15 06:27:23,755 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-15 06:27:23,761 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 06:27:23,764 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:27:23,765 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 06:27:23,767 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 06:27:23,768 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 06:27:23,768 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 06:27:23,770 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 06:27:23,774 INFO L163 areAnnotationChecker]: CFG has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 06:27:23,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:27:23 BoogieIcfgContainer [2022-04-15 06:27:23,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 06:27:23,783 INFO L158 Benchmark]: Toolchain (without parser) took 6748.65ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 145.9MB in the beginning and 124.5MB in the end (delta: 21.5MB). Peak memory consumption was 169.2MB. Max. memory is 8.0GB. [2022-04-15 06:27:23,783 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:27:23,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.47ms. Allocated memory was 199.2MB in the beginning and 278.9MB in the end (delta: 79.7MB). Free memory was 145.7MB in the beginning and 244.2MB in the end (delta: -98.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 06:27:23,783 INFO L158 Benchmark]: Boogie Preprocessor took 86.13ms. Allocated memory is still 278.9MB. Free memory was 244.2MB in the beginning and 239.3MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-04-15 06:27:23,784 INFO L158 Benchmark]: RCFGBuilder took 722.63ms. Allocated memory is still 278.9MB. Free memory was 239.3MB in the beginning and 201.9MB in the end (delta: 37.4MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-04-15 06:27:23,784 INFO L158 Benchmark]: TraceAbstraction took 5559.90ms. Allocated memory was 278.9MB in the beginning and 346.0MB in the end (delta: 67.1MB). Free memory was 201.3MB in the beginning and 124.5MB in the end (delta: 76.8MB). Peak memory consumption was 145.3MB. Max. memory is 8.0GB. [2022-04-15 06:27:23,785 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.10ms. Allocated memory is still 199.2MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 375.47ms. Allocated memory was 199.2MB in the beginning and 278.9MB in the end (delta: 79.7MB). Free memory was 145.7MB in the beginning and 244.2MB in the end (delta: -98.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 86.13ms. Allocated memory is still 278.9MB. Free memory was 244.2MB in the beginning and 239.3MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 722.63ms. Allocated memory is still 278.9MB. Free memory was 239.3MB in the beginning and 201.9MB in the end (delta: 37.4MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5559.90ms. Allocated memory was 278.9MB in the beginning and 346.0MB in the end (delta: 67.1MB). Free memory was 201.3MB in the beginning and 124.5MB in the end (delta: 76.8MB). Peak memory consumption was 145.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 488 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 263 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 667 IncrementalHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 252 mSDtfsCounter, 667 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 129 LocationsWithAnnotation, 455 PreInvPairs, 572 NumberOfFragments, 353 HoareAnnotationTreeSize, 455 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 129 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.2s 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: !(Id_MCDC_103 == 0) || \old(Id_MCDC_103) == 0 RESULT: Ultimate proved your program to be correct! [2022-04-15 06:27:23,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...