/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:36:53,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:36:53,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:36:53,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:36:53,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:36:53,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:36:53,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:36:53,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:36:53,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:36:53,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:36:53,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:36:53,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:36:53,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:36:53,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:36:53,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:36:53,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:36:53,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:36:53,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:36:53,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:36:53,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:36:53,439 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:36:53,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:36:53,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:36:53,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:36:53,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:36:53,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:36:53,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:36:53,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:36:53,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:36:53,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:36:53,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:36:53,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:36:53,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:36:53,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:36:53,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:36:53,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:36:53,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:36:53,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:36:53,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:36:53,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:36:53,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:36:53,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:36:53,458 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:36:53,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:36:53,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:36:53,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:36:53,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:36:53,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:36:53,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:36:53,487 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:36:53,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:36:53,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:36:53,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:36:53,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:36:53,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:36:53,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:36:53,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:36:53,488 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:36:53,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:36:53,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:36:53,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:36:53,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:36:53,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:36:53,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:36:53,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:36:53,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:36:53,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:36:53,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:36:53,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:36:53,490 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:36:53,490 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:36:53,491 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:36:53,491 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-27 22:36:53,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:36:53,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:36:53,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:36:53,744 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:36:53,744 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:36:53,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-04-27 22:36:53,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c04dd4e/654bea2fd11642548475992646b49f45/FLAGa818f078e [2022-04-27 22:36:54,154 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:36:54,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-04-27 22:36:54,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c04dd4e/654bea2fd11642548475992646b49f45/FLAGa818f078e [2022-04-27 22:36:54,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c04dd4e/654bea2fd11642548475992646b49f45 [2022-04-27 22:36:54,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:36:54,171 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:36:54,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:36:54,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:36:54,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:36:54,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:36:54" (1/1) ... [2022-04-27 22:36:54,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7012199a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:54, skipping insertion in model container [2022-04-27 22:36:54,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:36:54" (1/1) ... [2022-04-27 22:36:54,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:36:54,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:36:54,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2022-04-27 22:36:54,347 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-27 22:36:54,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:36:54,369 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:36:54,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2022-04-27 22:36:54,386 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-27 22:36:54,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:36:54,408 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:36:54,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:54 WrapperNode [2022-04-27 22:36:54,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:36:54,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:36:54,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:36:54,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:36:54,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:54" (1/1) ... [2022-04-27 22:36:54,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:54" (1/1) ... [2022-04-27 22:36:54,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:54" (1/1) ... [2022-04-27 22:36:54,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:54" (1/1) ... [2022-04-27 22:36:54,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:54" (1/1) ... [2022-04-27 22:36:54,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:54" (1/1) ... [2022-04-27 22:36:54,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:54" (1/1) ... [2022-04-27 22:36:54,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:36:54,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:36:54,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:36:54,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:36:54,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:54" (1/1) ... [2022-04-27 22:36:54,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:36:54,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:36:54,509 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-27 22:36:54,511 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-27 22:36:54,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:36:54,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:36:54,534 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-04-27 22:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-04-27 22:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-04-27 22:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-04-27 22:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-04-27 22:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-04-27 22:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:36:54,536 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 22:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 22:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 22:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-27 22:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 22:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 22:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:36:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:36:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:36:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:36:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:36:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-04-27 22:36:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 22:36:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:36:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-27 22:36:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-04-27 22:36:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-27 22:36:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-04-27 22:36:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:36:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:36:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-04-27 22:36:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-04-27 22:36:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-04-27 22:36:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 22:36:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 22:36:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:36:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:36:54,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:36:54,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:36:54,638 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:36:54,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:36:54,962 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:36:54,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:36:54,970 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 22:36:54,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:36:54 BoogieIcfgContainer [2022-04-27 22:36:54,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:36:54,972 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:36:54,972 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:36:54,973 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:36:54,975 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:36:54" (1/1) ... [2022-04-27 22:36:54,977 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:36:55,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:36:55 BasicIcfg [2022-04-27 22:36:55,034 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:36:55,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:36:55,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:36:55,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:36:55,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:36:54" (1/4) ... [2022-04-27 22:36:55,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628d9292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:36:55, skipping insertion in model container [2022-04-27 22:36:55,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:54" (2/4) ... [2022-04-27 22:36:55,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628d9292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:36:55, skipping insertion in model container [2022-04-27 22:36:55,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:36:54" (3/4) ... [2022-04-27 22:36:55,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628d9292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:36:55, skipping insertion in model container [2022-04-27 22:36:55,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:36:55" (4/4) ... [2022-04-27 22:36:55,046 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.cqvasr [2022-04-27 22:36:55,056 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:36:55,056 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:36:55,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:36:55,101 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@84cef3d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b49cc91 [2022-04-27 22:36:55,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:36:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 22:36:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 22:36:55,117 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:36:55,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:36:55,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:36:55,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:36:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1775030715, now seen corresponding path program 1 times [2022-04-27 22:36:55,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:36:55,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522264563] [2022-04-27 22:36:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:36:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:36:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:36:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:55,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {99#true} is VALID [2022-04-27 22:36:55,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99#true} {99#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-27 22:36:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:55,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {127#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {99#true} is VALID [2022-04-27 22:36:55,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99#true} {99#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 22:36:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:55,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {99#true} is VALID [2022-04-27 22:36:55,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {99#true} is VALID [2022-04-27 22:36:55,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {99#true} is VALID [2022-04-27 22:36:55,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 22:36:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:55,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {99#true} is VALID [2022-04-27 22:36:55,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {99#true} is VALID [2022-04-27 22:36:55,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {99#true} is VALID [2022-04-27 22:36:55,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 22:36:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:55,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {99#true} is VALID [2022-04-27 22:36:55,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} [226] L10-->L10-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {100#false} is VALID [2022-04-27 22:36:55,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#false} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#false} is VALID [2022-04-27 22:36:55,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#false} {99#true} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {100#false} is VALID [2022-04-27 22:36:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 22:36:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:55,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(= |#memory_int| |old(#memory_int)|)} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {99#true} is VALID [2022-04-27 22:36:55,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99#true} {100#false} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {100#false} is VALID [2022-04-27 22:36:55,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-27 22:36:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:55,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {99#true} is VALID [2022-04-27 22:36:55,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {99#true} is VALID [2022-04-27 22:36:55,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {100#false} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {100#false} is VALID [2022-04-27 22:36:55,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {99#true} [188] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:36:55,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {99#true} is VALID [2022-04-27 22:36:55,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {99#true} [189] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,536 INFO L272 TraceCheckUtils]: 5: Hoare triple {99#true} [192] mainENTRY-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {127#(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-27 22:36:55,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {99#true} is VALID [2022-04-27 22:36:55,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {99#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,538 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {99#true} {99#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,540 INFO L272 TraceCheckUtils]: 9: Hoare triple {99#true} [194] L105-->taskENTRY: Formula: (and (= |v_main_#t~ret44.base_5| |v_task_#in~t.baseInParam_1|) (= |v_main_#t~ret44.offset_5| |v_task_#in~t.offsetInParam_1|)) InVars {main_#t~ret44.offset=|v_main_#t~ret44.offset_5|, main_#t~ret44.base=|v_main_#t~ret44.base_5|} OutVars{task_#in~t.base=|v_task_#in~t.baseInParam_1|, task_#in~t.offset=|v_task_#in~t.offsetInParam_1|} AuxVars[] AssignedVars[task_#in~t.offset, main_#t~ret44.offset, task_#in~t.base, main_#t~ret44.base] {99#true} is VALID [2022-04-27 22:36:55,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {99#true} [198] taskENTRY-->L83: Formula: (and (= |v_task_#in~t.offset_1| v_task_~t.offset_6) (= v_task_~t.base_6 |v_task_#in~t.base_1|)) InVars {task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|} OutVars{task_~t.offset=v_task_~t.offset_6, task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|, task_~t.base=v_task_~t.base_6} AuxVars[] AssignedVars[task_~t.offset, task_~t.base] {99#true} is VALID [2022-04-27 22:36:55,544 INFO L272 TraceCheckUtils]: 11: Hoare triple {99#true} [202] L83-->minENTRY: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {99#true} is VALID [2022-04-27 22:36:55,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {99#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {99#true} is VALID [2022-04-27 22:36:55,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {99#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {99#true} is VALID [2022-04-27 22:36:55,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {99#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,544 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99#true} {99#true} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {99#true} is VALID [2022-04-27 22:36:55,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {99#true} [204] L83-1-->L86: Formula: (and (<= 0 (+ |v_task_#t~ret31_3| 2147483648)) (= (select |v_#valid_17| |v_task_~#b~1.base_1|) 0) (= |v_task_~#b~1.offset_1| 0) (not (= |v_task_~#b~1.base_1| 0)) (<= |v_task_#t~ret31_3| 2147483647) (< |v_#StackHeapBarrier_3| |v_task_~#b~1.base_1|) (= |v_task_#t~ret31_3| v_task_~a~1_1) (= (store |v_#length_13| |v_task_~#b~1.base_1| 4) |v_#length_12|) (= (store |v_#valid_17| |v_task_~#b~1.base_1| 1) |v_#valid_16|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, task_#t~ret31=|v_task_#t~ret31_3|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, task_~#b~1.offset=|v_task_~#b~1.offset_1|, #valid=|v_#valid_16|, task_~#b~1.base=|v_task_~#b~1.base_1|, #length=|v_#length_12|, task_~a~1=v_task_~a~1_1} AuxVars[] AssignedVars[task_#t~ret31, task_~#b~1.offset, #valid, task_~#b~1.base, #length, task_~a~1] {99#true} is VALID [2022-04-27 22:36:55,545 INFO L272 TraceCheckUtils]: 17: Hoare triple {99#true} [208] L86-->sizeENTRY: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {99#true} is VALID [2022-04-27 22:36:55,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {99#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {99#true} is VALID [2022-04-27 22:36:55,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {99#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {99#true} is VALID [2022-04-27 22:36:55,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {99#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,546 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {99#true} {99#true} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {99#true} is VALID [2022-04-27 22:36:55,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {99#true} [211] L86-1-->L87: Formula: (and (= |v_task_#t~ret32_3| v_task_~n~1_1) (<= |v_task_#t~ret32_3| 2147483647) (<= 0 (+ |v_task_#t~ret32_3| 2147483648))) InVars {task_#t~ret32=|v_task_#t~ret32_3|} OutVars{task_~n~1=v_task_~n~1_1} AuxVars[] AssignedVars[task_#t~ret32, task_~n~1] {99#true} is VALID [2022-04-27 22:36:55,546 INFO L272 TraceCheckUtils]: 23: Hoare triple {99#true} [215] L87-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {99#true} is VALID [2022-04-27 22:36:55,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {99#true} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {99#true} is VALID [2022-04-27 22:36:55,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {99#true} [226] L10-->L10-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {100#false} is VALID [2022-04-27 22:36:55,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {100#false} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#false} is VALID [2022-04-27 22:36:55,551 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {100#false} {99#true} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {100#false} is VALID [2022-04-27 22:36:55,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {100#false} [219] L87-1-->L88: Formula: (and (not (= |v_task_#t~malloc33.base_1| 0)) (< |v_task_#t~malloc33.base_1| |v_#StackHeapBarrier_4|) (= |v_task_#t~malloc33.offset_1| 0) (= (store |v_#valid_19| |v_task_#t~malloc33.base_1| 1) |v_#valid_18|) (= (select |v_#valid_19| |v_task_#t~malloc33.base_1|) 0) (= (store |v_#length_15| |v_task_#t~malloc33.base_1| (* 4 v_task_~n~1_3)) |v_#length_14|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, task_~n~1=v_task_~n~1_3, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, task_~n~1=v_task_~n~1_3, task_#t~malloc33.base=|v_task_#t~malloc33.base_1|, #valid=|v_#valid_18|, #length=|v_#length_14|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_1|} AuxVars[] AssignedVars[task_#t~malloc33.base, #valid, #length, task_#t~malloc33.offset] {100#false} is VALID [2022-04-27 22:36:55,552 INFO L272 TraceCheckUtils]: 29: Hoare triple {100#false} [225] L88-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {128#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 22:36:55,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {128#(= |#memory_int| |old(#memory_int)|)} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {99#true} is VALID [2022-04-27 22:36:55,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {99#true} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,553 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {99#true} {100#false} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {100#false} is VALID [2022-04-27 22:36:55,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {100#false} [231] L88-1-->L89: Formula: (and (= |v_task_#t~malloc33.offset_3| v_task_~x~0.offset_1) (= v_task_~x~0.base_1 |v_task_#t~malloc33.base_3|)) InVars {task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} OutVars{task_~x~0.base=v_task_~x~0.base_1, task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_~x~0.offset=v_task_~x~0.offset_1, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} AuxVars[] AssignedVars[task_~x~0.base, task_~x~0.offset] {100#false} is VALID [2022-04-27 22:36:55,553 INFO L272 TraceCheckUtils]: 34: Hoare triple {100#false} [237] L89-->tree_inorderENTRY: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-27 22:36:55,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {99#true} is VALID [2022-04-27 22:36:55,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {99#true} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {99#true} is VALID [2022-04-27 22:36:55,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {99#true} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-04-27 22:36:55,554 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {99#true} {100#false} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {100#false} is VALID [2022-04-27 22:36:55,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {100#false} [240] L89-1-->L90: Formula: (and (= |v_task_#t~mem35_1| (select (select |v_#memory_int_27| v_task_~x~0.base_3) v_task_~x~0.offset_3)) (<= 0 (+ |v_task_#t~ret34_3| 2147483648)) (<= |v_task_#t~ret34_3| 2147483647)) InVars {#memory_int=|v_#memory_int_27|, task_~x~0.base=v_task_~x~0.base_3, task_#t~ret34=|v_task_#t~ret34_3|, task_~x~0.offset=v_task_~x~0.offset_3} OutVars{#memory_int=|v_#memory_int_27|, task_#t~mem35=|v_task_#t~mem35_1|, task_~x~0.base=v_task_~x~0.base_3, task_~x~0.offset=v_task_~x~0.offset_3} AuxVars[] AssignedVars[task_#t~ret34, task_#t~mem35] {100#false} is VALID [2022-04-27 22:36:55,555 INFO L272 TraceCheckUtils]: 40: Hoare triple {100#false} [243] L90-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_task_#t~mem35_4| v_task_~a~1_4) 1 0)) InVars {task_#t~mem35=|v_task_#t~mem35_4|, task_~a~1=v_task_~a~1_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, task_#t~mem35, task_~a~1] {100#false} is VALID [2022-04-27 22:36:55,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {100#false} [248] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {100#false} is VALID [2022-04-27 22:36:55,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {100#false} [253] L16-->L16-1: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {100#false} is VALID [2022-04-27 22:36:55,555 INFO L290 TraceCheckUtils]: 43: Hoare triple {100#false} [259] L16-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#false} is VALID [2022-04-27 22:36:55,556 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-27 22:36:55,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:36:55,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522264563] [2022-04-27 22:36:55,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522264563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:36:55,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:36:55,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 22:36:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130902816] [2022-04-27 22:36:55,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:36:55,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-27 22:36:55,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:36:55,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 22:36:55,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:36:55,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:36:55,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:36:55,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:36:55,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:36:55,644 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 22:36:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:56,558 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2022-04-27 22:36:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:36:56,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-27 22:36:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:36:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 22:36:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2022-04-27 22:36:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 22:36:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2022-04-27 22:36:56,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 221 transitions. [2022-04-27 22:36:56,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:36:56,873 INFO L225 Difference]: With dead ends: 168 [2022-04-27 22:36:56,874 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 22:36:56,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-27 22:36:56,883 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 22:36:56,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 80 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 22:36:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 22:36:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2022-04-27 22:36:56,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:36:56,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 22:36:56,928 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 22:36:56,929 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 22:36:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:56,937 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2022-04-27 22:36:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-04-27 22:36:56,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:36:56,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:36:56,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 95 states. [2022-04-27 22:36:56,940 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 95 states. [2022-04-27 22:36:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:56,947 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2022-04-27 22:36:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-04-27 22:36:56,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:36:56,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:36:56,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:36:56,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:36:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 22:36:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-04-27 22:36:56,961 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 44 [2022-04-27 22:36:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:36:56,961 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-04-27 22:36:56,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 22:36:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-27 22:36:56,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 22:36:56,964 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:36:56,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:36:56,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:36:56,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:36:56,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:36:56,965 INFO L85 PathProgramCache]: Analyzing trace with hash 930558844, now seen corresponding path program 1 times [2022-04-27 22:36:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:36:56,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321831199] [2022-04-27 22:36:56,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:36:56,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:36:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:57,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:36:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:57,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {709#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {680#true} is VALID [2022-04-27 22:36:57,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {680#true} {680#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-27 22:36:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:57,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {710#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {680#true} is VALID [2022-04-27 22:36:57,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {680#true} {680#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 22:36:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:57,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {680#true} is VALID [2022-04-27 22:36:57,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {680#true} is VALID [2022-04-27 22:36:57,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {680#true} {680#true} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {680#true} is VALID [2022-04-27 22:36:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 22:36:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:57,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {680#true} is VALID [2022-04-27 22:36:57,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {711#(= |size_#res| 0)} is VALID [2022-04-27 22:36:57,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {711#(= |size_#res| 0)} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#(= |size_#res| 0)} is VALID [2022-04-27 22:36:57,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {711#(= |size_#res| 0)} {680#true} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {696#(= |task_#t~ret32| 0)} is VALID [2022-04-27 22:36:57,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 22:36:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:57,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#true} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {712#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 22:36:57,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [227] L10-->L10-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {713#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:36:57,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {713#(not (= |assume_abort_if_not_#in~cond| 0))} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:36:57,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {713#(not (= |assume_abort_if_not_#in~cond| 0))} {697#(= task_~n~1 0)} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {681#false} is VALID [2022-04-27 22:36:57,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 22:36:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:57,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {714#(= |#memory_int| |old(#memory_int)|)} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {680#true} is VALID [2022-04-27 22:36:57,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {680#true} {681#false} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {681#false} is VALID [2022-04-27 22:36:57,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-27 22:36:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:57,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {680#true} is VALID [2022-04-27 22:36:57,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {680#true} is VALID [2022-04-27 22:36:57,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#true} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {680#true} {681#false} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {681#false} is VALID [2022-04-27 22:36:57,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {680#true} [188] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {709#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:36:57,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {709#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {680#true} is VALID [2022-04-27 22:36:57,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {680#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {680#true} {680#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {680#true} [189] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,191 INFO L272 TraceCheckUtils]: 5: Hoare triple {680#true} [192] mainENTRY-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {710#(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-27 22:36:57,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {710#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {680#true} is VALID [2022-04-27 22:36:57,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {680#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,192 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {680#true} {680#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,192 INFO L272 TraceCheckUtils]: 9: Hoare triple {680#true} [194] L105-->taskENTRY: Formula: (and (= |v_main_#t~ret44.base_5| |v_task_#in~t.baseInParam_1|) (= |v_main_#t~ret44.offset_5| |v_task_#in~t.offsetInParam_1|)) InVars {main_#t~ret44.offset=|v_main_#t~ret44.offset_5|, main_#t~ret44.base=|v_main_#t~ret44.base_5|} OutVars{task_#in~t.base=|v_task_#in~t.baseInParam_1|, task_#in~t.offset=|v_task_#in~t.offsetInParam_1|} AuxVars[] AssignedVars[task_#in~t.offset, main_#t~ret44.offset, task_#in~t.base, main_#t~ret44.base] {680#true} is VALID [2022-04-27 22:36:57,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {680#true} [198] taskENTRY-->L83: Formula: (and (= |v_task_#in~t.offset_1| v_task_~t.offset_6) (= v_task_~t.base_6 |v_task_#in~t.base_1|)) InVars {task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|} OutVars{task_~t.offset=v_task_~t.offset_6, task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|, task_~t.base=v_task_~t.base_6} AuxVars[] AssignedVars[task_~t.offset, task_~t.base] {680#true} is VALID [2022-04-27 22:36:57,192 INFO L272 TraceCheckUtils]: 11: Hoare triple {680#true} [202] L83-->minENTRY: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {680#true} is VALID [2022-04-27 22:36:57,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {680#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {680#true} is VALID [2022-04-27 22:36:57,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {680#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {680#true} is VALID [2022-04-27 22:36:57,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,193 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {680#true} {680#true} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {680#true} is VALID [2022-04-27 22:36:57,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#true} [204] L83-1-->L86: Formula: (and (<= 0 (+ |v_task_#t~ret31_3| 2147483648)) (= (select |v_#valid_17| |v_task_~#b~1.base_1|) 0) (= |v_task_~#b~1.offset_1| 0) (not (= |v_task_~#b~1.base_1| 0)) (<= |v_task_#t~ret31_3| 2147483647) (< |v_#StackHeapBarrier_3| |v_task_~#b~1.base_1|) (= |v_task_#t~ret31_3| v_task_~a~1_1) (= (store |v_#length_13| |v_task_~#b~1.base_1| 4) |v_#length_12|) (= (store |v_#valid_17| |v_task_~#b~1.base_1| 1) |v_#valid_16|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, task_#t~ret31=|v_task_#t~ret31_3|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, task_~#b~1.offset=|v_task_~#b~1.offset_1|, #valid=|v_#valid_16|, task_~#b~1.base=|v_task_~#b~1.base_1|, #length=|v_#length_12|, task_~a~1=v_task_~a~1_1} AuxVars[] AssignedVars[task_#t~ret31, task_~#b~1.offset, #valid, task_~#b~1.base, #length, task_~a~1] {680#true} is VALID [2022-04-27 22:36:57,193 INFO L272 TraceCheckUtils]: 17: Hoare triple {680#true} [208] L86-->sizeENTRY: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {680#true} is VALID [2022-04-27 22:36:57,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {680#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {680#true} is VALID [2022-04-27 22:36:57,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {680#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {711#(= |size_#res| 0)} is VALID [2022-04-27 22:36:57,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {711#(= |size_#res| 0)} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#(= |size_#res| 0)} is VALID [2022-04-27 22:36:57,195 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {711#(= |size_#res| 0)} {680#true} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {696#(= |task_#t~ret32| 0)} is VALID [2022-04-27 22:36:57,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {696#(= |task_#t~ret32| 0)} [211] L86-1-->L87: Formula: (and (= |v_task_#t~ret32_3| v_task_~n~1_1) (<= |v_task_#t~ret32_3| 2147483647) (<= 0 (+ |v_task_#t~ret32_3| 2147483648))) InVars {task_#t~ret32=|v_task_#t~ret32_3|} OutVars{task_~n~1=v_task_~n~1_1} AuxVars[] AssignedVars[task_#t~ret32, task_~n~1] {697#(= task_~n~1 0)} is VALID [2022-04-27 22:36:57,196 INFO L272 TraceCheckUtils]: 23: Hoare triple {697#(= task_~n~1 0)} [215] L87-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {680#true} is VALID [2022-04-27 22:36:57,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {680#true} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {712#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 22:36:57,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {712#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [227] L10-->L10-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {713#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:36:57,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {713#(not (= |assume_abort_if_not_#in~cond| 0))} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:36:57,198 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {713#(not (= |assume_abort_if_not_#in~cond| 0))} {697#(= task_~n~1 0)} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {681#false} is VALID [2022-04-27 22:36:57,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {681#false} [219] L87-1-->L88: Formula: (and (not (= |v_task_#t~malloc33.base_1| 0)) (< |v_task_#t~malloc33.base_1| |v_#StackHeapBarrier_4|) (= |v_task_#t~malloc33.offset_1| 0) (= (store |v_#valid_19| |v_task_#t~malloc33.base_1| 1) |v_#valid_18|) (= (select |v_#valid_19| |v_task_#t~malloc33.base_1|) 0) (= (store |v_#length_15| |v_task_#t~malloc33.base_1| (* 4 v_task_~n~1_3)) |v_#length_14|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, task_~n~1=v_task_~n~1_3, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, task_~n~1=v_task_~n~1_3, task_#t~malloc33.base=|v_task_#t~malloc33.base_1|, #valid=|v_#valid_18|, #length=|v_#length_14|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_1|} AuxVars[] AssignedVars[task_#t~malloc33.base, #valid, #length, task_#t~malloc33.offset] {681#false} is VALID [2022-04-27 22:36:57,198 INFO L272 TraceCheckUtils]: 29: Hoare triple {681#false} [225] L88-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {714#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 22:36:57,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {714#(= |#memory_int| |old(#memory_int)|)} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {680#true} is VALID [2022-04-27 22:36:57,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {680#true} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,199 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {680#true} {681#false} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {681#false} is VALID [2022-04-27 22:36:57,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {681#false} [231] L88-1-->L89: Formula: (and (= |v_task_#t~malloc33.offset_3| v_task_~x~0.offset_1) (= v_task_~x~0.base_1 |v_task_#t~malloc33.base_3|)) InVars {task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} OutVars{task_~x~0.base=v_task_~x~0.base_1, task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_~x~0.offset=v_task_~x~0.offset_1, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} AuxVars[] AssignedVars[task_~x~0.base, task_~x~0.offset] {681#false} is VALID [2022-04-27 22:36:57,199 INFO L272 TraceCheckUtils]: 34: Hoare triple {681#false} [237] L89-->tree_inorderENTRY: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {715#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-27 22:36:57,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {715#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {680#true} is VALID [2022-04-27 22:36:57,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {680#true} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {680#true} is VALID [2022-04-27 22:36:57,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {680#true} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#true} is VALID [2022-04-27 22:36:57,200 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {680#true} {681#false} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {681#false} is VALID [2022-04-27 22:36:57,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {681#false} [240] L89-1-->L90: Formula: (and (= |v_task_#t~mem35_1| (select (select |v_#memory_int_27| v_task_~x~0.base_3) v_task_~x~0.offset_3)) (<= 0 (+ |v_task_#t~ret34_3| 2147483648)) (<= |v_task_#t~ret34_3| 2147483647)) InVars {#memory_int=|v_#memory_int_27|, task_~x~0.base=v_task_~x~0.base_3, task_#t~ret34=|v_task_#t~ret34_3|, task_~x~0.offset=v_task_~x~0.offset_3} OutVars{#memory_int=|v_#memory_int_27|, task_#t~mem35=|v_task_#t~mem35_1|, task_~x~0.base=v_task_~x~0.base_3, task_~x~0.offset=v_task_~x~0.offset_3} AuxVars[] AssignedVars[task_#t~ret34, task_#t~mem35] {681#false} is VALID [2022-04-27 22:36:57,200 INFO L272 TraceCheckUtils]: 40: Hoare triple {681#false} [243] L90-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_task_#t~mem35_4| v_task_~a~1_4) 1 0)) InVars {task_#t~mem35=|v_task_#t~mem35_4|, task_~a~1=v_task_~a~1_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, task_#t~mem35, task_~a~1] {681#false} is VALID [2022-04-27 22:36:57,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {681#false} [248] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {681#false} is VALID [2022-04-27 22:36:57,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {681#false} [253] L16-->L16-1: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {681#false} is VALID [2022-04-27 22:36:57,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {681#false} [259] L16-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {681#false} is VALID [2022-04-27 22:36:57,201 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-27 22:36:57,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:36:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321831199] [2022-04-27 22:36:57,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321831199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:36:57,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:36:57,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-27 22:36:57,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940081317] [2022-04-27 22:36:57,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:36:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-27 22:36:57,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:36:57,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:36:57,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:36:57,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 22:36:57,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:36:57,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 22:36:57,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-27 22:36:57,236 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:36:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:59,225 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2022-04-27 22:36:59,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 22:36:59,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-27 22:36:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:36:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:36:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2022-04-27 22:36:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:36:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2022-04-27 22:36:59,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 197 transitions. [2022-04-27 22:36:59,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:36:59,429 INFO L225 Difference]: With dead ends: 154 [2022-04-27 22:36:59,429 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 22:36:59,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-27 22:36:59,431 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 131 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 22:36:59,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 79 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 22:36:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 22:36:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-04-27 22:36:59,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:36:59,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 22:36:59,442 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 22:36:59,443 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 22:36:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:59,448 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-27 22:36:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-27 22:36:59,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:36:59,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:36:59,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) Second operand 97 states. [2022-04-27 22:36:59,451 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) Second operand 97 states. [2022-04-27 22:36:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:59,455 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-27 22:36:59,456 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-27 22:36:59,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:36:59,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:36:59,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:36:59,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:36:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 22:36:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-04-27 22:36:59,461 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 44 [2022-04-27 22:36:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:36:59,461 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-04-27 22:36:59,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:36:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-04-27 22:36:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 22:36:59,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:36:59,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2022-04-27 22:36:59,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:36:59,463 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:36:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:36:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1268495097, now seen corresponding path program 1 times [2022-04-27 22:36:59,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:36:59,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258291432] [2022-04-27 22:36:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:36:59,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:36:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:36:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {1311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1269#true} is VALID [2022-04-27 22:36:59,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1269#true} {1269#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-27 22:36:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {1312#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-27 22:36:59,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-27 22:36:59,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {1269#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1277#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} is VALID [2022-04-27 22:36:59,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 22:36:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {1269#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {1269#true} is VALID [2022-04-27 22:36:59,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {1269#true} is VALID [2022-04-27 22:36:59,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {1269#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1269#true} {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-27 22:36:59,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 22:36:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 22:36:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1269#true} is VALID [2022-04-27 22:36:59,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {1269#true} is VALID [2022-04-27 22:36:59,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {1269#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1269#true} {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} [294] sizeEXIT-->L79-1: AOR: Formula: (= |v_size_#t~ret28_5| |v_size_#resOutParam_3|) InVars {size_#res=|v_size_#resOutParam_3|} OutVars{size_#t~ret28=|v_size_#t~ret28_5|} AuxVars[] AssignedVars[size_#t~ret28, size_#res] LVA: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} is VALID [2022-04-27 22:36:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 22:36:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1269#true} is VALID [2022-04-27 22:36:59,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {1269#true} is VALID [2022-04-27 22:36:59,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {1269#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1269#true} {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [295] sizeEXIT-->L79-3: AOR: Formula: (= |v_size_#t~ret30_4| |v_size_#resOutParam_4|) InVars {size_#res=|v_size_#resOutParam_4|} OutVars{size_#t~ret30=|v_size_#t~ret30_4|} AuxVars[] AssignedVars[size_#t~ret30, size_#res] LVA: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:36:59,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1314#(and (or (= size_~t.offset 0) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID [2022-04-27 22:36:59,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {1314#(and (or (= size_~t.offset 0) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} [217] L78-->L79: Formula: (let ((.cse0 (+ v_size_~t.offset_3 4))) (and (or (not (= v_size_~t.base_3 0)) (not (= v_size_~t.offset_3 0))) (= |v_size_#t~mem27.offset_2| (select (select |v_#memory_$Pointer$.offset_31| v_size_~t.base_3) .cse0)) (= (select (select |v_#memory_$Pointer$.base_31| v_size_~t.base_3) .cse0) |v_size_#t~mem27.base_2|))) InVars {size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_#t~mem27.offset=|v_size_#t~mem27.offset_2|, size_#t~mem27.base=|v_size_#t~mem27.base_2|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} AuxVars[] AssignedVars[size_#t~mem27.offset, size_#t~mem27.base] {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} is VALID [2022-04-27 22:36:59,665 INFO L272 TraceCheckUtils]: 2: Hoare triple {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} [222] L79-->sizeENTRY: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {1269#true} is VALID [2022-04-27 22:36:59,665 INFO L290 TraceCheckUtils]: 3: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1269#true} is VALID [2022-04-27 22:36:59,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {1269#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {1269#true} is VALID [2022-04-27 22:36:59,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {1269#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,666 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1269#true} {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} [294] sizeEXIT-->L79-1: AOR: Formula: (= |v_size_#t~ret28_5| |v_size_#resOutParam_3|) InVars {size_#res=|v_size_#resOutParam_3|} OutVars{size_#t~ret28=|v_size_#t~ret28_5|} AuxVars[] AssignedVars[size_#t~ret28, size_#res] LVA: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} is VALID [2022-04-27 22:36:59,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} [228] L79-1-->L79-2: Formula: (let ((.cse0 (+ v_size_~t.offset_4 12))) (and (= |v_size_#t~mem29.offset_3| (select (select |v_#memory_$Pointer$.offset_32| v_size_~t.base_4) .cse0)) (= |v_size_#t~mem29.base_3| (select (select |v_#memory_$Pointer$.base_32| v_size_~t.base_4) .cse0)) (<= |v_size_#t~ret28_4| 2147483647) (<= 0 (+ |v_size_#t~ret28_4| 2147483648)))) InVars {size_~t.base=v_size_~t.base_4, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} OutVars{size_~t.base=v_size_~t.base_4, size_#t~mem29.offset=|v_size_#t~mem29.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_#t~mem29.base=|v_size_#t~mem29.base_3|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~mem29.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:36:59,667 INFO L272 TraceCheckUtils]: 8: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [236] L79-2-->sizeENTRY: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {1269#true} is VALID [2022-04-27 22:36:59,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1269#true} is VALID [2022-04-27 22:36:59,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {1269#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {1269#true} is VALID [2022-04-27 22:36:59,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {1269#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,668 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1269#true} {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [295] sizeEXIT-->L79-3: AOR: Formula: (= |v_size_#t~ret30_4| |v_size_#resOutParam_4|) InVars {size_#res=|v_size_#resOutParam_4|} OutVars{size_#t~ret30=|v_size_#t~ret30_4|} AuxVars[] AssignedVars[size_#t~ret30, size_#res] LVA: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:36:59,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [235] L79-3-->sizeFINAL: Formula: (and (= (+ |v_size_#t~ret30_3| |v_size_#t~ret28_2| 1) |v_size_#res_1|) (<= 0 (+ |v_size_#t~ret30_3| 2147483648)) (<= |v_size_#t~ret30_3| 2147483647)) InVars {size_#t~ret28=|v_size_#t~ret28_2|, size_#t~ret30=|v_size_#t~ret30_3|} OutVars{size_#t~mem29.offset=|v_size_#t~mem29.offset_2|, size_#t~mem29.base=|v_size_#t~mem29.base_2|, size_#t~mem27.offset=|v_size_#t~mem27.offset_1|, size_#res=|v_size_#res_1|, size_#t~mem27.base=|v_size_#t~mem27.base_1|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~ret28, size_#t~mem29.base, size_#t~mem27.offset, size_#t~mem27.base, size_#res, size_#t~ret30] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:36:59,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:36:59,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {1270#false} is VALID [2022-04-27 22:36:59,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-27 22:36:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {1269#true} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1269#true} is VALID [2022-04-27 22:36:59,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} [227] L10-->L10-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {1269#true} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1269#true} {1270#false} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {1270#false} is VALID [2022-04-27 22:36:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-27 22:36:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {1325#(= |#memory_int| |old(#memory_int)|)} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {1269#true} is VALID [2022-04-27 22:36:59,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1269#true} {1270#false} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {1270#false} is VALID [2022-04-27 22:36:59,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 22:36:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {1326#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {1269#true} is VALID [2022-04-27 22:36:59,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {1269#true} is VALID [2022-04-27 22:36:59,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {1269#true} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1269#true} {1270#false} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {1270#false} is VALID [2022-04-27 22:36:59,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {1269#true} [188] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:36:59,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {1311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1269#true} is VALID [2022-04-27 22:36:59,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {1269#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1269#true} {1269#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {1269#true} [189] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,702 INFO L272 TraceCheckUtils]: 5: Hoare triple {1269#true} [192] mainENTRY-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(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-27 22:36:59,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {1312#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-27 22:36:59,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-27 22:36:59,703 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {1269#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1277#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} is VALID [2022-04-27 22:36:59,704 INFO L272 TraceCheckUtils]: 9: Hoare triple {1277#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} [194] L105-->taskENTRY: Formula: (and (= |v_main_#t~ret44.base_5| |v_task_#in~t.baseInParam_1|) (= |v_main_#t~ret44.offset_5| |v_task_#in~t.offsetInParam_1|)) InVars {main_#t~ret44.offset=|v_main_#t~ret44.offset_5|, main_#t~ret44.base=|v_main_#t~ret44.base_5|} OutVars{task_#in~t.base=|v_task_#in~t.baseInParam_1|, task_#in~t.offset=|v_task_#in~t.offsetInParam_1|} AuxVars[] AssignedVars[task_#in~t.offset, main_#t~ret44.offset, task_#in~t.base, main_#t~ret44.base] {1278#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} is VALID [2022-04-27 22:36:59,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {1278#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} [198] taskENTRY-->L83: Formula: (and (= |v_task_#in~t.offset_1| v_task_~t.offset_6) (= v_task_~t.base_6 |v_task_#in~t.base_1|)) InVars {task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|} OutVars{task_~t.offset=v_task_~t.offset_6, task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|, task_~t.base=v_task_~t.base_6} AuxVars[] AssignedVars[task_~t.offset, task_~t.base] {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-27 22:36:59,705 INFO L272 TraceCheckUtils]: 11: Hoare triple {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [202] L83-->minENTRY: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {1269#true} is VALID [2022-04-27 22:36:59,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {1269#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {1269#true} is VALID [2022-04-27 22:36:59,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {1269#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {1269#true} is VALID [2022-04-27 22:36:59,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {1269#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,706 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1269#true} {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-27 22:36:59,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [204] L83-1-->L86: Formula: (and (<= 0 (+ |v_task_#t~ret31_3| 2147483648)) (= (select |v_#valid_17| |v_task_~#b~1.base_1|) 0) (= |v_task_~#b~1.offset_1| 0) (not (= |v_task_~#b~1.base_1| 0)) (<= |v_task_#t~ret31_3| 2147483647) (< |v_#StackHeapBarrier_3| |v_task_~#b~1.base_1|) (= |v_task_#t~ret31_3| v_task_~a~1_1) (= (store |v_#length_13| |v_task_~#b~1.base_1| 4) |v_#length_12|) (= (store |v_#valid_17| |v_task_~#b~1.base_1| 1) |v_#valid_16|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, task_#t~ret31=|v_task_#t~ret31_3|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, task_~#b~1.offset=|v_task_~#b~1.offset_1|, #valid=|v_#valid_16|, task_~#b~1.base=|v_task_~#b~1.base_1|, #length=|v_#length_12|, task_~a~1=v_task_~a~1_1} AuxVars[] AssignedVars[task_#t~ret31, task_~#b~1.offset, #valid, task_~#b~1.base, #length, task_~a~1] {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-27 22:36:59,706 INFO L272 TraceCheckUtils]: 17: Hoare triple {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [208] L86-->sizeENTRY: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {1269#true} is VALID [2022-04-27 22:36:59,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1314#(and (or (= size_~t.offset 0) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID [2022-04-27 22:36:59,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {1314#(and (or (= size_~t.offset 0) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} [217] L78-->L79: Formula: (let ((.cse0 (+ v_size_~t.offset_3 4))) (and (or (not (= v_size_~t.base_3 0)) (not (= v_size_~t.offset_3 0))) (= |v_size_#t~mem27.offset_2| (select (select |v_#memory_$Pointer$.offset_31| v_size_~t.base_3) .cse0)) (= (select (select |v_#memory_$Pointer$.base_31| v_size_~t.base_3) .cse0) |v_size_#t~mem27.base_2|))) InVars {size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_#t~mem27.offset=|v_size_#t~mem27.offset_2|, size_#t~mem27.base=|v_size_#t~mem27.base_2|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} AuxVars[] AssignedVars[size_#t~mem27.offset, size_#t~mem27.base] {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} is VALID [2022-04-27 22:36:59,708 INFO L272 TraceCheckUtils]: 20: Hoare triple {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} [222] L79-->sizeENTRY: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {1269#true} is VALID [2022-04-27 22:36:59,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1269#true} is VALID [2022-04-27 22:36:59,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {1269#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {1269#true} is VALID [2022-04-27 22:36:59,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {1269#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,709 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1269#true} {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} [294] sizeEXIT-->L79-1: AOR: Formula: (= |v_size_#t~ret28_5| |v_size_#resOutParam_3|) InVars {size_#res=|v_size_#resOutParam_3|} OutVars{size_#t~ret28=|v_size_#t~ret28_5|} AuxVars[] AssignedVars[size_#t~ret28, size_#res] LVA: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} is VALID [2022-04-27 22:36:59,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {1315#(or (not (= |size_#in~t.base| 0)) (and (not (= size_~t.offset 0)) (= |size_#in~t.offset| size_~t.offset)))} [228] L79-1-->L79-2: Formula: (let ((.cse0 (+ v_size_~t.offset_4 12))) (and (= |v_size_#t~mem29.offset_3| (select (select |v_#memory_$Pointer$.offset_32| v_size_~t.base_4) .cse0)) (= |v_size_#t~mem29.base_3| (select (select |v_#memory_$Pointer$.base_32| v_size_~t.base_4) .cse0)) (<= |v_size_#t~ret28_4| 2147483647) (<= 0 (+ |v_size_#t~ret28_4| 2147483648)))) InVars {size_~t.base=v_size_~t.base_4, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} OutVars{size_~t.base=v_size_~t.base_4, size_#t~mem29.offset=|v_size_#t~mem29.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_#t~mem29.base=|v_size_#t~mem29.base_3|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~mem29.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:36:59,710 INFO L272 TraceCheckUtils]: 26: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [236] L79-2-->sizeENTRY: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {1269#true} is VALID [2022-04-27 22:36:59,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1269#true} is VALID [2022-04-27 22:36:59,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {1269#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {1269#true} is VALID [2022-04-27 22:36:59,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {1269#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,711 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1269#true} {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [295] sizeEXIT-->L79-3: AOR: Formula: (= |v_size_#t~ret30_4| |v_size_#resOutParam_4|) InVars {size_#res=|v_size_#resOutParam_4|} OutVars{size_#t~ret30=|v_size_#t~ret30_4|} AuxVars[] AssignedVars[size_#t~ret30, size_#res] LVA: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:36:59,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [235] L79-3-->sizeFINAL: Formula: (and (= (+ |v_size_#t~ret30_3| |v_size_#t~ret28_2| 1) |v_size_#res_1|) (<= 0 (+ |v_size_#t~ret30_3| 2147483648)) (<= |v_size_#t~ret30_3| 2147483647)) InVars {size_#t~ret28=|v_size_#t~ret28_2|, size_#t~ret30=|v_size_#t~ret30_3|} OutVars{size_#t~mem29.offset=|v_size_#t~mem29.offset_2|, size_#t~mem29.base=|v_size_#t~mem29.base_2|, size_#t~mem27.offset=|v_size_#t~mem27.offset_1|, size_#res=|v_size_#res_1|, size_#t~mem27.base=|v_size_#t~mem27.base_1|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~ret28, size_#t~mem29.base, size_#t~mem27.offset, size_#t~mem27.base, size_#res, size_#t~ret30] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:36:59,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:36:59,712 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {1270#false} is VALID [2022-04-27 22:36:59,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {1270#false} [211] L86-1-->L87: Formula: (and (= |v_task_#t~ret32_3| v_task_~n~1_1) (<= |v_task_#t~ret32_3| 2147483647) (<= 0 (+ |v_task_#t~ret32_3| 2147483648))) InVars {task_#t~ret32=|v_task_#t~ret32_3|} OutVars{task_~n~1=v_task_~n~1_1} AuxVars[] AssignedVars[task_#t~ret32, task_~n~1] {1270#false} is VALID [2022-04-27 22:36:59,712 INFO L272 TraceCheckUtils]: 35: Hoare triple {1270#false} [215] L87-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {1269#true} is VALID [2022-04-27 22:36:59,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {1269#true} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1269#true} is VALID [2022-04-27 22:36:59,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {1269#true} [227] L10-->L10-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {1269#true} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,713 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1269#true} {1270#false} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {1270#false} is VALID [2022-04-27 22:36:59,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {1270#false} [219] L87-1-->L88: Formula: (and (not (= |v_task_#t~malloc33.base_1| 0)) (< |v_task_#t~malloc33.base_1| |v_#StackHeapBarrier_4|) (= |v_task_#t~malloc33.offset_1| 0) (= (store |v_#valid_19| |v_task_#t~malloc33.base_1| 1) |v_#valid_18|) (= (select |v_#valid_19| |v_task_#t~malloc33.base_1|) 0) (= (store |v_#length_15| |v_task_#t~malloc33.base_1| (* 4 v_task_~n~1_3)) |v_#length_14|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, task_~n~1=v_task_~n~1_3, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, task_~n~1=v_task_~n~1_3, task_#t~malloc33.base=|v_task_#t~malloc33.base_1|, #valid=|v_#valid_18|, #length=|v_#length_14|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_1|} AuxVars[] AssignedVars[task_#t~malloc33.base, #valid, #length, task_#t~malloc33.offset] {1270#false} is VALID [2022-04-27 22:36:59,713 INFO L272 TraceCheckUtils]: 41: Hoare triple {1270#false} [225] L88-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {1325#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 22:36:59,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {1325#(= |#memory_int| |old(#memory_int)|)} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {1269#true} is VALID [2022-04-27 22:36:59,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {1269#true} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,714 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1269#true} {1270#false} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {1270#false} is VALID [2022-04-27 22:36:59,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {1270#false} [231] L88-1-->L89: Formula: (and (= |v_task_#t~malloc33.offset_3| v_task_~x~0.offset_1) (= v_task_~x~0.base_1 |v_task_#t~malloc33.base_3|)) InVars {task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} OutVars{task_~x~0.base=v_task_~x~0.base_1, task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_~x~0.offset=v_task_~x~0.offset_1, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} AuxVars[] AssignedVars[task_~x~0.base, task_~x~0.offset] {1270#false} is VALID [2022-04-27 22:36:59,714 INFO L272 TraceCheckUtils]: 46: Hoare triple {1270#false} [237] L89-->tree_inorderENTRY: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {1326#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-27 22:36:59,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {1326#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {1269#true} is VALID [2022-04-27 22:36:59,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {1269#true} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {1269#true} is VALID [2022-04-27 22:36:59,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {1269#true} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:36:59,714 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1269#true} {1270#false} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {1270#false} is VALID [2022-04-27 22:36:59,715 INFO L290 TraceCheckUtils]: 51: Hoare triple {1270#false} [240] L89-1-->L90: Formula: (and (= |v_task_#t~mem35_1| (select (select |v_#memory_int_27| v_task_~x~0.base_3) v_task_~x~0.offset_3)) (<= 0 (+ |v_task_#t~ret34_3| 2147483648)) (<= |v_task_#t~ret34_3| 2147483647)) InVars {#memory_int=|v_#memory_int_27|, task_~x~0.base=v_task_~x~0.base_3, task_#t~ret34=|v_task_#t~ret34_3|, task_~x~0.offset=v_task_~x~0.offset_3} OutVars{#memory_int=|v_#memory_int_27|, task_#t~mem35=|v_task_#t~mem35_1|, task_~x~0.base=v_task_~x~0.base_3, task_~x~0.offset=v_task_~x~0.offset_3} AuxVars[] AssignedVars[task_#t~ret34, task_#t~mem35] {1270#false} is VALID [2022-04-27 22:36:59,715 INFO L272 TraceCheckUtils]: 52: Hoare triple {1270#false} [243] L90-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_task_#t~mem35_4| v_task_~a~1_4) 1 0)) InVars {task_#t~mem35=|v_task_#t~mem35_4|, task_~a~1=v_task_~a~1_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, task_#t~mem35, task_~a~1] {1270#false} is VALID [2022-04-27 22:36:59,715 INFO L290 TraceCheckUtils]: 53: Hoare triple {1270#false} [248] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1270#false} is VALID [2022-04-27 22:36:59,715 INFO L290 TraceCheckUtils]: 54: Hoare triple {1270#false} [253] L16-->L16-1: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1270#false} is VALID [2022-04-27 22:36:59,715 INFO L290 TraceCheckUtils]: 55: Hoare triple {1270#false} [259] L16-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1270#false} is VALID [2022-04-27 22:36:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 22:36:59,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:36:59,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258291432] [2022-04-27 22:36:59,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258291432] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:36:59,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709903358] [2022-04-27 22:36:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:36:59,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:36:59,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:36:59,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:36:59,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 22:36:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 22:36:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:59,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:37:00,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {1269#true} [188] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1269#true} is VALID [2022-04-27 22:37:00,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {1269#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1269#true} {1269#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {1269#true} [189] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,228 INFO L272 TraceCheckUtils]: 5: Hoare triple {1269#true} [192] mainENTRY-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {1269#true} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-27 22:37:00,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-27 22:37:00,233 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {1269#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1277#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} is VALID [2022-04-27 22:37:00,233 INFO L272 TraceCheckUtils]: 9: Hoare triple {1277#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} [194] L105-->taskENTRY: Formula: (and (= |v_main_#t~ret44.base_5| |v_task_#in~t.baseInParam_1|) (= |v_main_#t~ret44.offset_5| |v_task_#in~t.offsetInParam_1|)) InVars {main_#t~ret44.offset=|v_main_#t~ret44.offset_5|, main_#t~ret44.base=|v_main_#t~ret44.base_5|} OutVars{task_#in~t.base=|v_task_#in~t.baseInParam_1|, task_#in~t.offset=|v_task_#in~t.offsetInParam_1|} AuxVars[] AssignedVars[task_#in~t.offset, main_#t~ret44.offset, task_#in~t.base, main_#t~ret44.base] {1278#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} is VALID [2022-04-27 22:37:00,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {1278#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} [198] taskENTRY-->L83: Formula: (and (= |v_task_#in~t.offset_1| v_task_~t.offset_6) (= v_task_~t.base_6 |v_task_#in~t.base_1|)) InVars {task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|} OutVars{task_~t.offset=v_task_~t.offset_6, task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|, task_~t.base=v_task_~t.base_6} AuxVars[] AssignedVars[task_~t.offset, task_~t.base] {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-27 22:37:00,234 INFO L272 TraceCheckUtils]: 11: Hoare triple {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [202] L83-->minENTRY: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {1269#true} is VALID [2022-04-27 22:37:00,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {1269#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {1269#true} is VALID [2022-04-27 22:37:00,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {1269#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {1269#true} is VALID [2022-04-27 22:37:00,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {1269#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,235 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1269#true} {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-27 22:37:00,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [204] L83-1-->L86: Formula: (and (<= 0 (+ |v_task_#t~ret31_3| 2147483648)) (= (select |v_#valid_17| |v_task_~#b~1.base_1|) 0) (= |v_task_~#b~1.offset_1| 0) (not (= |v_task_~#b~1.base_1| 0)) (<= |v_task_#t~ret31_3| 2147483647) (< |v_#StackHeapBarrier_3| |v_task_~#b~1.base_1|) (= |v_task_#t~ret31_3| v_task_~a~1_1) (= (store |v_#length_13| |v_task_~#b~1.base_1| 4) |v_#length_12|) (= (store |v_#valid_17| |v_task_~#b~1.base_1| 1) |v_#valid_16|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, task_#t~ret31=|v_task_#t~ret31_3|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, task_~#b~1.offset=|v_task_~#b~1.offset_1|, #valid=|v_#valid_16|, task_~#b~1.base=|v_task_~#b~1.base_1|, #length=|v_#length_12|, task_~a~1=v_task_~a~1_1} AuxVars[] AssignedVars[task_#t~ret31, task_~#b~1.offset, #valid, task_~#b~1.base, #length, task_~a~1] {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-27 22:37:00,236 INFO L272 TraceCheckUtils]: 17: Hoare triple {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [208] L86-->sizeENTRY: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {1269#true} is VALID [2022-04-27 22:37:00,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1384#(and (= |size_#in~t.offset| size_~t.offset) (= |size_#in~t.base| size_~t.base))} is VALID [2022-04-27 22:37:00,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {1384#(and (= |size_#in~t.offset| size_~t.offset) (= |size_#in~t.base| size_~t.base))} [217] L78-->L79: Formula: (let ((.cse0 (+ v_size_~t.offset_3 4))) (and (or (not (= v_size_~t.base_3 0)) (not (= v_size_~t.offset_3 0))) (= |v_size_#t~mem27.offset_2| (select (select |v_#memory_$Pointer$.offset_31| v_size_~t.base_3) .cse0)) (= (select (select |v_#memory_$Pointer$.base_31| v_size_~t.base_3) .cse0) |v_size_#t~mem27.base_2|))) InVars {size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_#t~mem27.offset=|v_size_#t~mem27.offset_2|, size_#t~mem27.base=|v_size_#t~mem27.base_2|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} AuxVars[] AssignedVars[size_#t~mem27.offset, size_#t~mem27.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,237 INFO L272 TraceCheckUtils]: 20: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [222] L79-->sizeENTRY: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {1269#true} is VALID [2022-04-27 22:37:00,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1269#true} is VALID [2022-04-27 22:37:00,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {1269#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {1269#true} is VALID [2022-04-27 22:37:00,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {1269#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,238 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1269#true} {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [294] sizeEXIT-->L79-1: AOR: Formula: (= |v_size_#t~ret28_5| |v_size_#resOutParam_3|) InVars {size_#res=|v_size_#resOutParam_3|} OutVars{size_#t~ret28=|v_size_#t~ret28_5|} AuxVars[] AssignedVars[size_#t~ret28, size_#res] LVA: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [228] L79-1-->L79-2: Formula: (let ((.cse0 (+ v_size_~t.offset_4 12))) (and (= |v_size_#t~mem29.offset_3| (select (select |v_#memory_$Pointer$.offset_32| v_size_~t.base_4) .cse0)) (= |v_size_#t~mem29.base_3| (select (select |v_#memory_$Pointer$.base_32| v_size_~t.base_4) .cse0)) (<= |v_size_#t~ret28_4| 2147483647) (<= 0 (+ |v_size_#t~ret28_4| 2147483648)))) InVars {size_~t.base=v_size_~t.base_4, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} OutVars{size_~t.base=v_size_~t.base_4, size_#t~mem29.offset=|v_size_#t~mem29.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_#t~mem29.base=|v_size_#t~mem29.base_3|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~mem29.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,239 INFO L272 TraceCheckUtils]: 26: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [236] L79-2-->sizeENTRY: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {1269#true} is VALID [2022-04-27 22:37:00,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1269#true} is VALID [2022-04-27 22:37:00,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {1269#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {1269#true} is VALID [2022-04-27 22:37:00,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {1269#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,240 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1269#true} {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [295] sizeEXIT-->L79-3: AOR: Formula: (= |v_size_#t~ret30_4| |v_size_#resOutParam_4|) InVars {size_#res=|v_size_#resOutParam_4|} OutVars{size_#t~ret30=|v_size_#t~ret30_4|} AuxVars[] AssignedVars[size_#t~ret30, size_#res] LVA: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [235] L79-3-->sizeFINAL: Formula: (and (= (+ |v_size_#t~ret30_3| |v_size_#t~ret28_2| 1) |v_size_#res_1|) (<= 0 (+ |v_size_#t~ret30_3| 2147483648)) (<= |v_size_#t~ret30_3| 2147483647)) InVars {size_#t~ret28=|v_size_#t~ret28_2|, size_#t~ret30=|v_size_#t~ret30_3|} OutVars{size_#t~mem29.offset=|v_size_#t~mem29.offset_2|, size_#t~mem29.base=|v_size_#t~mem29.base_2|, size_#t~mem27.offset=|v_size_#t~mem27.offset_1|, size_#res=|v_size_#res_1|, size_#t~mem27.base=|v_size_#t~mem27.base_1|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~ret28, size_#t~mem29.base, size_#t~mem27.offset, size_#t~mem27.base, size_#res, size_#t~ret30] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,241 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {1270#false} is VALID [2022-04-27 22:37:00,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {1270#false} [211] L86-1-->L87: Formula: (and (= |v_task_#t~ret32_3| v_task_~n~1_1) (<= |v_task_#t~ret32_3| 2147483647) (<= 0 (+ |v_task_#t~ret32_3| 2147483648))) InVars {task_#t~ret32=|v_task_#t~ret32_3|} OutVars{task_~n~1=v_task_~n~1_1} AuxVars[] AssignedVars[task_#t~ret32, task_~n~1] {1270#false} is VALID [2022-04-27 22:37:00,242 INFO L272 TraceCheckUtils]: 35: Hoare triple {1270#false} [215] L87-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {1270#false} is VALID [2022-04-27 22:37:00,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {1270#false} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1270#false} is VALID [2022-04-27 22:37:00,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {1270#false} [227] L10-->L10-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1270#false} is VALID [2022-04-27 22:37:00,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {1270#false} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1270#false} is VALID [2022-04-27 22:37:00,242 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1270#false} {1270#false} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {1270#false} is VALID [2022-04-27 22:37:00,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {1270#false} [219] L87-1-->L88: Formula: (and (not (= |v_task_#t~malloc33.base_1| 0)) (< |v_task_#t~malloc33.base_1| |v_#StackHeapBarrier_4|) (= |v_task_#t~malloc33.offset_1| 0) (= (store |v_#valid_19| |v_task_#t~malloc33.base_1| 1) |v_#valid_18|) (= (select |v_#valid_19| |v_task_#t~malloc33.base_1|) 0) (= (store |v_#length_15| |v_task_#t~malloc33.base_1| (* 4 v_task_~n~1_3)) |v_#length_14|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, task_~n~1=v_task_~n~1_3, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, task_~n~1=v_task_~n~1_3, task_#t~malloc33.base=|v_task_#t~malloc33.base_1|, #valid=|v_#valid_18|, #length=|v_#length_14|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_1|} AuxVars[] AssignedVars[task_#t~malloc33.base, #valid, #length, task_#t~malloc33.offset] {1270#false} is VALID [2022-04-27 22:37:00,242 INFO L272 TraceCheckUtils]: 41: Hoare triple {1270#false} [225] L88-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {1270#false} is VALID [2022-04-27 22:37:00,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {1270#false} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {1270#false} is VALID [2022-04-27 22:37:00,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {1270#false} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1270#false} is VALID [2022-04-27 22:37:00,243 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1270#false} {1270#false} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {1270#false} is VALID [2022-04-27 22:37:00,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {1270#false} [231] L88-1-->L89: Formula: (and (= |v_task_#t~malloc33.offset_3| v_task_~x~0.offset_1) (= v_task_~x~0.base_1 |v_task_#t~malloc33.base_3|)) InVars {task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} OutVars{task_~x~0.base=v_task_~x~0.base_1, task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_~x~0.offset=v_task_~x~0.offset_1, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} AuxVars[] AssignedVars[task_~x~0.base, task_~x~0.offset] {1270#false} is VALID [2022-04-27 22:37:00,243 INFO L272 TraceCheckUtils]: 46: Hoare triple {1270#false} [237] L89-->tree_inorderENTRY: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {1270#false} is VALID [2022-04-27 22:37:00,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {1270#false} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {1270#false} is VALID [2022-04-27 22:37:00,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {1270#false} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {1270#false} is VALID [2022-04-27 22:37:00,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {1270#false} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1270#false} is VALID [2022-04-27 22:37:00,244 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1270#false} {1270#false} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {1270#false} is VALID [2022-04-27 22:37:00,244 INFO L290 TraceCheckUtils]: 51: Hoare triple {1270#false} [240] L89-1-->L90: Formula: (and (= |v_task_#t~mem35_1| (select (select |v_#memory_int_27| v_task_~x~0.base_3) v_task_~x~0.offset_3)) (<= 0 (+ |v_task_#t~ret34_3| 2147483648)) (<= |v_task_#t~ret34_3| 2147483647)) InVars {#memory_int=|v_#memory_int_27|, task_~x~0.base=v_task_~x~0.base_3, task_#t~ret34=|v_task_#t~ret34_3|, task_~x~0.offset=v_task_~x~0.offset_3} OutVars{#memory_int=|v_#memory_int_27|, task_#t~mem35=|v_task_#t~mem35_1|, task_~x~0.base=v_task_~x~0.base_3, task_~x~0.offset=v_task_~x~0.offset_3} AuxVars[] AssignedVars[task_#t~ret34, task_#t~mem35] {1270#false} is VALID [2022-04-27 22:37:00,244 INFO L272 TraceCheckUtils]: 52: Hoare triple {1270#false} [243] L90-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_task_#t~mem35_4| v_task_~a~1_4) 1 0)) InVars {task_#t~mem35=|v_task_#t~mem35_4|, task_~a~1=v_task_~a~1_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, task_#t~mem35, task_~a~1] {1270#false} is VALID [2022-04-27 22:37:00,244 INFO L290 TraceCheckUtils]: 53: Hoare triple {1270#false} [248] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1270#false} is VALID [2022-04-27 22:37:00,244 INFO L290 TraceCheckUtils]: 54: Hoare triple {1270#false} [253] L16-->L16-1: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1270#false} is VALID [2022-04-27 22:37:00,244 INFO L290 TraceCheckUtils]: 55: Hoare triple {1270#false} [259] L16-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1270#false} is VALID [2022-04-27 22:37:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 22:37:00,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:37:00,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {1270#false} [259] L16-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1270#false} is VALID [2022-04-27 22:37:00,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {1270#false} [253] L16-->L16-1: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1270#false} is VALID [2022-04-27 22:37:00,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {1270#false} [248] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1270#false} is VALID [2022-04-27 22:37:00,621 INFO L272 TraceCheckUtils]: 52: Hoare triple {1270#false} [243] L90-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_task_#t~mem35_4| v_task_~a~1_4) 1 0)) InVars {task_#t~mem35=|v_task_#t~mem35_4|, task_~a~1=v_task_~a~1_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, task_#t~mem35, task_~a~1] {1270#false} is VALID [2022-04-27 22:37:00,621 INFO L290 TraceCheckUtils]: 51: Hoare triple {1270#false} [240] L89-1-->L90: Formula: (and (= |v_task_#t~mem35_1| (select (select |v_#memory_int_27| v_task_~x~0.base_3) v_task_~x~0.offset_3)) (<= 0 (+ |v_task_#t~ret34_3| 2147483648)) (<= |v_task_#t~ret34_3| 2147483647)) InVars {#memory_int=|v_#memory_int_27|, task_~x~0.base=v_task_~x~0.base_3, task_#t~ret34=|v_task_#t~ret34_3|, task_~x~0.offset=v_task_~x~0.offset_3} OutVars{#memory_int=|v_#memory_int_27|, task_#t~mem35=|v_task_#t~mem35_1|, task_~x~0.base=v_task_~x~0.base_3, task_~x~0.offset=v_task_~x~0.offset_3} AuxVars[] AssignedVars[task_#t~ret34, task_#t~mem35] {1270#false} is VALID [2022-04-27 22:37:00,621 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1269#true} {1270#false} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {1270#false} is VALID [2022-04-27 22:37:00,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {1269#true} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {1269#true} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {1269#true} is VALID [2022-04-27 22:37:00,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {1269#true} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {1269#true} is VALID [2022-04-27 22:37:00,621 INFO L272 TraceCheckUtils]: 46: Hoare triple {1270#false} [237] L89-->tree_inorderENTRY: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {1269#true} is VALID [2022-04-27 22:37:00,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {1270#false} [231] L88-1-->L89: Formula: (and (= |v_task_#t~malloc33.offset_3| v_task_~x~0.offset_1) (= v_task_~x~0.base_1 |v_task_#t~malloc33.base_3|)) InVars {task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} OutVars{task_~x~0.base=v_task_~x~0.base_1, task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_~x~0.offset=v_task_~x~0.offset_1, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} AuxVars[] AssignedVars[task_~x~0.base, task_~x~0.offset] {1270#false} is VALID [2022-04-27 22:37:00,622 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1269#true} {1270#false} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {1270#false} is VALID [2022-04-27 22:37:00,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {1269#true} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {1269#true} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {1269#true} is VALID [2022-04-27 22:37:00,622 INFO L272 TraceCheckUtils]: 41: Hoare triple {1270#false} [225] L88-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {1269#true} is VALID [2022-04-27 22:37:00,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {1270#false} [219] L87-1-->L88: Formula: (and (not (= |v_task_#t~malloc33.base_1| 0)) (< |v_task_#t~malloc33.base_1| |v_#StackHeapBarrier_4|) (= |v_task_#t~malloc33.offset_1| 0) (= (store |v_#valid_19| |v_task_#t~malloc33.base_1| 1) |v_#valid_18|) (= (select |v_#valid_19| |v_task_#t~malloc33.base_1|) 0) (= (store |v_#length_15| |v_task_#t~malloc33.base_1| (* 4 v_task_~n~1_3)) |v_#length_14|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, task_~n~1=v_task_~n~1_3, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, task_~n~1=v_task_~n~1_3, task_#t~malloc33.base=|v_task_#t~malloc33.base_1|, #valid=|v_#valid_18|, #length=|v_#length_14|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_1|} AuxVars[] AssignedVars[task_#t~malloc33.base, #valid, #length, task_#t~malloc33.offset] {1270#false} is VALID [2022-04-27 22:37:00,622 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1269#true} {1270#false} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {1270#false} is VALID [2022-04-27 22:37:00,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {1269#true} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {1269#true} [227] L10-->L10-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {1269#true} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1269#true} is VALID [2022-04-27 22:37:00,623 INFO L272 TraceCheckUtils]: 35: Hoare triple {1270#false} [215] L87-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {1269#true} is VALID [2022-04-27 22:37:00,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {1270#false} [211] L86-1-->L87: Formula: (and (= |v_task_#t~ret32_3| v_task_~n~1_1) (<= |v_task_#t~ret32_3| 2147483647) (<= 0 (+ |v_task_#t~ret32_3| 2147483648))) InVars {task_#t~ret32=|v_task_#t~ret32_3|} OutVars{task_~n~1=v_task_~n~1_1} AuxVars[] AssignedVars[task_#t~ret32, task_~n~1] {1270#false} is VALID [2022-04-27 22:37:00,624 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {1270#false} is VALID [2022-04-27 22:37:00,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [235] L79-3-->sizeFINAL: Formula: (and (= (+ |v_size_#t~ret30_3| |v_size_#t~ret28_2| 1) |v_size_#res_1|) (<= 0 (+ |v_size_#t~ret30_3| 2147483648)) (<= |v_size_#t~ret30_3| 2147483647)) InVars {size_#t~ret28=|v_size_#t~ret28_2|, size_#t~ret30=|v_size_#t~ret30_3|} OutVars{size_#t~mem29.offset=|v_size_#t~mem29.offset_2|, size_#t~mem29.base=|v_size_#t~mem29.base_2|, size_#t~mem27.offset=|v_size_#t~mem27.offset_1|, size_#res=|v_size_#res_1|, size_#t~mem27.base=|v_size_#t~mem27.base_1|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~ret28, size_#t~mem29.base, size_#t~mem27.offset, size_#t~mem27.base, size_#res, size_#t~ret30] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,625 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1269#true} {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [295] sizeEXIT-->L79-3: AOR: Formula: (= |v_size_#t~ret30_4| |v_size_#resOutParam_4|) InVars {size_#res=|v_size_#resOutParam_4|} OutVars{size_#t~ret30=|v_size_#t~ret30_4|} AuxVars[] AssignedVars[size_#t~ret30, size_#res] LVA: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {1269#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {1269#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {1269#true} is VALID [2022-04-27 22:37:00,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1269#true} is VALID [2022-04-27 22:37:00,626 INFO L272 TraceCheckUtils]: 26: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [236] L79-2-->sizeENTRY: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {1269#true} is VALID [2022-04-27 22:37:00,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [228] L79-1-->L79-2: Formula: (let ((.cse0 (+ v_size_~t.offset_4 12))) (and (= |v_size_#t~mem29.offset_3| (select (select |v_#memory_$Pointer$.offset_32| v_size_~t.base_4) .cse0)) (= |v_size_#t~mem29.base_3| (select (select |v_#memory_$Pointer$.base_32| v_size_~t.base_4) .cse0)) (<= |v_size_#t~ret28_4| 2147483647) (<= 0 (+ |v_size_#t~ret28_4| 2147483648)))) InVars {size_~t.base=v_size_~t.base_4, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} OutVars{size_~t.base=v_size_~t.base_4, size_#t~mem29.offset=|v_size_#t~mem29.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_#t~mem29.base=|v_size_#t~mem29.base_3|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~mem29.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,627 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1269#true} {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [294] sizeEXIT-->L79-1: AOR: Formula: (= |v_size_#t~ret28_5| |v_size_#resOutParam_3|) InVars {size_#res=|v_size_#resOutParam_3|} OutVars{size_#t~ret28=|v_size_#t~ret28_5|} AuxVars[] AssignedVars[size_#t~ret28, size_#res] LVA: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {1269#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {1269#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {1269#true} is VALID [2022-04-27 22:37:00,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1269#true} is VALID [2022-04-27 22:37:00,628 INFO L272 TraceCheckUtils]: 20: Hoare triple {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} [222] L79-->sizeENTRY: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {1269#true} is VALID [2022-04-27 22:37:00,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {1607#(or (not (= |size_#in~t.offset| 0)) (and (= size_~t.offset 0) (= size_~t.base 0)) (not (= |size_#in~t.base| 0)))} [217] L78-->L79: Formula: (let ((.cse0 (+ v_size_~t.offset_3 4))) (and (or (not (= v_size_~t.base_3 0)) (not (= v_size_~t.offset_3 0))) (= |v_size_#t~mem27.offset_2| (select (select |v_#memory_$Pointer$.offset_31| v_size_~t.base_3) .cse0)) (= (select (select |v_#memory_$Pointer$.base_31| v_size_~t.base_3) .cse0) |v_size_#t~mem27.base_2|))) InVars {size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_#t~mem27.offset=|v_size_#t~mem27.offset_2|, size_#t~mem27.base=|v_size_#t~mem27.base_2|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} AuxVars[] AssignedVars[size_#t~mem27.offset, size_#t~mem27.base] {1320#(or (not (= |size_#in~t.offset| 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {1269#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {1607#(or (not (= |size_#in~t.offset| 0)) (and (= size_~t.offset 0) (= size_~t.base 0)) (not (= |size_#in~t.base| 0)))} is VALID [2022-04-27 22:37:00,630 INFO L272 TraceCheckUtils]: 17: Hoare triple {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [208] L86-->sizeENTRY: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {1269#true} is VALID [2022-04-27 22:37:00,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [204] L83-1-->L86: Formula: (and (<= 0 (+ |v_task_#t~ret31_3| 2147483648)) (= (select |v_#valid_17| |v_task_~#b~1.base_1|) 0) (= |v_task_~#b~1.offset_1| 0) (not (= |v_task_~#b~1.base_1| 0)) (<= |v_task_#t~ret31_3| 2147483647) (< |v_#StackHeapBarrier_3| |v_task_~#b~1.base_1|) (= |v_task_#t~ret31_3| v_task_~a~1_1) (= (store |v_#length_13| |v_task_~#b~1.base_1| 4) |v_#length_12|) (= (store |v_#valid_17| |v_task_~#b~1.base_1| 1) |v_#valid_16|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, task_#t~ret31=|v_task_#t~ret31_3|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, task_~#b~1.offset=|v_task_~#b~1.offset_1|, #valid=|v_#valid_16|, task_~#b~1.base=|v_task_~#b~1.base_1|, #length=|v_#length_12|, task_~a~1=v_task_~a~1_1} AuxVars[] AssignedVars[task_#t~ret31, task_~#b~1.offset, #valid, task_~#b~1.base, #length, task_~a~1] {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-27 22:37:00,631 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1269#true} {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-27 22:37:00,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {1269#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {1269#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {1269#true} is VALID [2022-04-27 22:37:00,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {1269#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {1269#true} is VALID [2022-04-27 22:37:00,631 INFO L272 TraceCheckUtils]: 11: Hoare triple {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} [202] L83-->minENTRY: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {1269#true} is VALID [2022-04-27 22:37:00,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {1278#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} [198] taskENTRY-->L83: Formula: (and (= |v_task_#in~t.offset_1| v_task_~t.offset_6) (= v_task_~t.base_6 |v_task_#in~t.base_1|)) InVars {task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|} OutVars{task_~t.offset=v_task_~t.offset_6, task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|, task_~t.base=v_task_~t.base_6} AuxVars[] AssignedVars[task_~t.offset, task_~t.base] {1279#(and (= task_~t.offset 0) (= task_~t.base 0))} is VALID [2022-04-27 22:37:00,632 INFO L272 TraceCheckUtils]: 9: Hoare triple {1277#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} [194] L105-->taskENTRY: Formula: (and (= |v_main_#t~ret44.base_5| |v_task_#in~t.baseInParam_1|) (= |v_main_#t~ret44.offset_5| |v_task_#in~t.offsetInParam_1|)) InVars {main_#t~ret44.offset=|v_main_#t~ret44.offset_5|, main_#t~ret44.base=|v_main_#t~ret44.base_5|} OutVars{task_#in~t.base=|v_task_#in~t.baseInParam_1|, task_#in~t.offset=|v_task_#in~t.offsetInParam_1|} AuxVars[] AssignedVars[task_#in~t.offset, main_#t~ret44.offset, task_#in~t.base, main_#t~ret44.base] {1278#(and (= |task_#in~t.base| 0) (= |task_#in~t.offset| 0))} is VALID [2022-04-27 22:37:00,633 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {1269#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1277#(and (= |main_#t~ret44.offset| 0) (= |main_#t~ret44.base| 0))} is VALID [2022-04-27 22:37:00,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-27 22:37:00,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {1269#true} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {1313#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-04-27 22:37:00,635 INFO L272 TraceCheckUtils]: 5: Hoare triple {1269#true} [192] mainENTRY-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {1269#true} [189] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1269#true} {1269#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {1269#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1269#true} is VALID [2022-04-27 22:37:00,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {1269#true} [188] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1269#true} is VALID [2022-04-27 22:37:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 22:37:00,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709903358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:37:00,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 22:37:00,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 15 [2022-04-27 22:37:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21706773] [2022-04-27 22:37:00,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 22:37:00,637 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 56 [2022-04-27 22:37:00,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:37:00,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 22:37:00,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:37:00,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 22:37:00,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:37:00,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 22:37:00,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-27 22:37:00,705 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 22:37:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:37:02,916 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2022-04-27 22:37:02,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 22:37:02,917 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 56 [2022-04-27 22:37:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:37:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 22:37:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2022-04-27 22:37:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 22:37:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2022-04-27 22:37:02,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 205 transitions. [2022-04-27 22:37:03,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:37:03,151 INFO L225 Difference]: With dead ends: 164 [2022-04-27 22:37:03,151 INFO L226 Difference]: Without dead ends: 96 [2022-04-27 22:37:03,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-04-27 22:37:03,153 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 103 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:37:03,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 82 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 22:37:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-27 22:37:03,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-04-27 22:37:03,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:37:03,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-04-27 22:37:03,163 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-04-27 22:37:03,164 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-04-27 22:37:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:37:03,168 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2022-04-27 22:37:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-27 22:37:03,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:37:03,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:37:03,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) Second operand 96 states. [2022-04-27 22:37:03,169 INFO L87 Difference]: Start difference. First operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) Second operand 96 states. [2022-04-27 22:37:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:37:03,173 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2022-04-27 22:37:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-27 22:37:03,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:37:03,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:37:03,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:37:03,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:37:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-04-27 22:37:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2022-04-27 22:37:03,178 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 56 [2022-04-27 22:37:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:37:03,178 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2022-04-27 22:37:03,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 22:37:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2022-04-27 22:37:03,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 22:37:03,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:37:03,179 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:37:03,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 22:37:03,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:37:03,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:37:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:37:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash 929625533, now seen corresponding path program 1 times [2022-04-27 22:37:03,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:37:03,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806523694] [2022-04-27 22:37:03,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:37:03,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:37:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:37:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {2285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2233#true} is VALID [2022-04-27 22:37:03,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2233#true} {2233#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-27 22:37:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 22:37:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {2286#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2233#true} is VALID [2022-04-27 22:37:03,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2233#true} {2287#(not (= nondet_tree_~n~0.base 0))} [286] nondet_treeEXIT-->L30-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_2| |v_nondet_tree_#t~ret8.offset_4|) (= |v_nondet_tree_#res.baseOutParam_2| |v_nondet_tree_#t~ret8.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_2|} OutVars{nondet_tree_#t~ret8.base=|v_nondet_tree_#t~ret8.base_4|, nondet_tree_#t~ret8.offset=|v_nondet_tree_#t~ret8.offset_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret8.offset, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret8.base] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2287#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:03,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 22:37:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {2286#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2233#true} is VALID [2022-04-27 22:37:03,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2233#true} {2287#(not (= nondet_tree_~n~0.base 0))} [287] nondet_treeEXIT-->L31-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_3| |v_nondet_tree_#t~ret9.offset_4|) (= |v_nondet_tree_#res.baseOutParam_3| |v_nondet_tree_#t~ret9.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_3|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_3|} OutVars{nondet_tree_#t~ret9.offset=|v_nondet_tree_#t~ret9.offset_4|, nondet_tree_#t~ret9.base=|v_nondet_tree_#t~ret9.base_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret9.base, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret9.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2287#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:03,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {2286#(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|))} [196] nondet_treeENTRY-->L30: Formula: (and (= (store |v_#length_10| v_nondet_tree_~n~0.base_3 20) |v_#length_9|) (= |v_#valid_13| (store |v_#valid_14| v_nondet_tree_~n~0.base_3 1)) (< v_nondet_tree_~n~0.base_3 |v_#StackHeapBarrier_1|) (= (store |v_#memory_$Pointer$.offset_24| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_$Pointer$.offset_24| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 (select (select |v_#memory_$Pointer$.offset_23| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3))) |v_#memory_$Pointer$.offset_23|) (= (store |v_#memory_$Pointer$.base_24| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_$Pointer$.base_24| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 (select (select |v_#memory_$Pointer$.base_23| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3))) |v_#memory_$Pointer$.base_23|) (= (mod |v_nondet_tree_#t~nondet5_4| 256) 0) (= (store |v_#memory_int_21| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_int_21| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 |v_nondet_tree_#t~nondet7_2|)) |v_#memory_int_20|) (= v_nondet_tree_~n~0.offset_3 0) (<= |v_nondet_tree_#t~nondet7_2| 2147483647) (not (= v_nondet_tree_~n~0.base_3 0)) (<= 0 (+ |v_nondet_tree_#t~nondet7_2| 2147483648)) (= (select |v_#valid_14| v_nondet_tree_~n~0.base_3) 0)) InVars {nondet_tree_#t~nondet7=|v_nondet_tree_#t~nondet7_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_4|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_21|, #length=|v_#length_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|} OutVars{nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, nondet_tree_#t~malloc6.base=|v_nondet_tree_#t~malloc6.base_1|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_20|, #length=|v_#length_9|, nondet_tree_#t~malloc6.offset=|v_nondet_tree_#t~malloc6.offset_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|} AuxVars[] AssignedVars[nondet_tree_#t~nondet7, nondet_tree_~n~0.base, #memory_$Pointer$.base, nondet_tree_#t~malloc6.base, nondet_tree_#t~nondet5, nondet_tree_~n~0.offset, #valid, #memory_int, #length, nondet_tree_#t~malloc6.offset, #memory_$Pointer$.offset] {2287#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:03,521 INFO L272 TraceCheckUtils]: 1: Hoare triple {2287#(not (= nondet_tree_~n~0.base 0))} [200] L30-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#(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-27 22:37:03,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {2286#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2233#true} is VALID [2022-04-27 22:37:03,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {2233#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,522 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2233#true} {2287#(not (= nondet_tree_~n~0.base 0))} [286] nondet_treeEXIT-->L30-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_2| |v_nondet_tree_#t~ret8.offset_4|) (= |v_nondet_tree_#res.baseOutParam_2| |v_nondet_tree_#t~ret8.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_2|} OutVars{nondet_tree_#t~ret8.base=|v_nondet_tree_#t~ret8.base_4|, nondet_tree_#t~ret8.offset=|v_nondet_tree_#t~ret8.offset_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret8.offset, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret8.base] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2287#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:03,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {2287#(not (= nondet_tree_~n~0.base 0))} [203] L30-1-->L31: Formula: (let ((.cse0 (+ 4 v_nondet_tree_~n~0.offset_1))) (and (= (store |v_#memory_$Pointer$.base_18| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_$Pointer$.base_18| v_nondet_tree_~n~0.base_1) .cse0 |v_nondet_tree_#t~ret8.base_3|)) |v_#memory_$Pointer$.base_17|) (= |v_#memory_int_14| (store |v_#memory_int_15| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_int_15| v_nondet_tree_~n~0.base_1) .cse0 (select (select |v_#memory_int_14| v_nondet_tree_~n~0.base_1) .cse0)))) (= (store |v_#memory_$Pointer$.offset_18| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_$Pointer$.offset_18| v_nondet_tree_~n~0.base_1) .cse0 |v_nondet_tree_#t~ret8.offset_3|)) |v_#memory_$Pointer$.offset_17|))) InVars {nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_1, #memory_int=|v_#memory_int_15|, nondet_tree_#t~ret8.offset=|v_nondet_tree_#t~ret8.offset_3|, nondet_tree_#t~ret8.base=|v_nondet_tree_#t~ret8.base_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_14|, nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_1} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, nondet_tree_#t~ret8.offset, nondet_tree_#t~ret8.base, #memory_$Pointer$.offset] {2287#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:03,523 INFO L272 TraceCheckUtils]: 6: Hoare triple {2287#(not (= nondet_tree_~n~0.base 0))} [207] L31-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#(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-27 22:37:03,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {2286#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2233#true} is VALID [2022-04-27 22:37:03,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {2233#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,524 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2233#true} {2287#(not (= nondet_tree_~n~0.base 0))} [287] nondet_treeEXIT-->L31-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_3| |v_nondet_tree_#t~ret9.offset_4|) (= |v_nondet_tree_#res.baseOutParam_3| |v_nondet_tree_#t~ret9.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_3|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_3|} OutVars{nondet_tree_#t~ret9.offset=|v_nondet_tree_#t~ret9.offset_4|, nondet_tree_#t~ret9.base=|v_nondet_tree_#t~ret9.base_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret9.base, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret9.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2287#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:03,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {2287#(not (= nondet_tree_~n~0.base 0))} [206] L31-1-->nondet_treeFINAL: Formula: (let ((.cse0 (+ 12 v_nondet_tree_~n~0.offset_2))) (and (= v_nondet_tree_~n~0.base_2 |v_nondet_tree_#res.base_1|) (= |v_nondet_tree_#res.offset_1| v_nondet_tree_~n~0.offset_2) (= (store |v_#memory_$Pointer$.offset_22| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_$Pointer$.offset_22| v_nondet_tree_~n~0.base_2) .cse0 |v_nondet_tree_#t~ret9.offset_3|)) |v_#memory_$Pointer$.offset_21|) (= |v_#memory_$Pointer$.base_21| (store |v_#memory_$Pointer$.base_22| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_$Pointer$.base_22| v_nondet_tree_~n~0.base_2) .cse0 |v_nondet_tree_#t~ret9.base_3|))) (= |v_#memory_int_18| (store |v_#memory_int_19| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_int_19| v_nondet_tree_~n~0.base_2) .cse0 (select (select |v_#memory_int_18| v_nondet_tree_~n~0.base_2) .cse0)))))) InVars {nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_22|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_2, #memory_int=|v_#memory_int_19|, nondet_tree_#t~ret9.base=|v_nondet_tree_#t~ret9.base_3|, nondet_tree_#t~ret9.offset=|v_nondet_tree_#t~ret9.offset_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_22|} OutVars{nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_21|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_2, #memory_int=|v_#memory_int_18|, nondet_tree_#res.base=|v_nondet_tree_#res.base_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_21|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, nondet_tree_#res.base, nondet_tree_#t~ret9.base, nondet_tree_#res.offset, nondet_tree_#t~ret9.offset, #memory_$Pointer$.offset] {2294#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-27 22:37:03,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {2294#(not (= |nondet_tree_#res.base| 0))} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2294#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-27 22:37:03,525 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2294#(not (= |nondet_tree_#res.base| 0))} {2233#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2251#(not (= |main_#t~ret44.base| 0))} is VALID [2022-04-27 22:37:03,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 22:37:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {2233#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {2295#(= min_~n.base |min_#in~n.base|)} is VALID [2022-04-27 22:37:03,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {2295#(= min_~n.base |min_#in~n.base|)} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {2296#(= |min_#in~n.base| 0)} is VALID [2022-04-27 22:37:03,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {2296#(= |min_#in~n.base| 0)} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2296#(= |min_#in~n.base| 0)} is VALID [2022-04-27 22:37:03,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2296#(= |min_#in~n.base| 0)} {2253#(not (= task_~t.base 0))} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {2234#false} is VALID [2022-04-27 22:37:03,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 22:37:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 22:37:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {2233#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2233#true} is VALID [2022-04-27 22:37:03,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2233#true} is VALID [2022-04-27 22:37:03,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} [294] sizeEXIT-->L79-1: AOR: Formula: (= |v_size_#t~ret28_5| |v_size_#resOutParam_3|) InVars {size_#res=|v_size_#resOutParam_3|} OutVars{size_#t~ret28=|v_size_#t~ret28_5|} AuxVars[] AssignedVars[size_#t~ret28, size_#res] LVA: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {2233#true} is VALID [2022-04-27 22:37:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 22:37:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {2233#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2233#true} is VALID [2022-04-27 22:37:03,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2233#true} is VALID [2022-04-27 22:37:03,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} [295] sizeEXIT-->L79-3: AOR: Formula: (= |v_size_#t~ret30_4| |v_size_#resOutParam_4|) InVars {size_#res=|v_size_#resOutParam_4|} OutVars{size_#t~ret30=|v_size_#t~ret30_4|} AuxVars[] AssignedVars[size_#t~ret30, size_#res] LVA: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {2233#true} is VALID [2022-04-27 22:37:03,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {2233#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2233#true} is VALID [2022-04-27 22:37:03,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} [217] L78-->L79: Formula: (let ((.cse0 (+ v_size_~t.offset_3 4))) (and (or (not (= v_size_~t.base_3 0)) (not (= v_size_~t.offset_3 0))) (= |v_size_#t~mem27.offset_2| (select (select |v_#memory_$Pointer$.offset_31| v_size_~t.base_3) .cse0)) (= (select (select |v_#memory_$Pointer$.base_31| v_size_~t.base_3) .cse0) |v_size_#t~mem27.base_2|))) InVars {size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_#t~mem27.offset=|v_size_#t~mem27.offset_2|, size_#t~mem27.base=|v_size_#t~mem27.base_2|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} AuxVars[] AssignedVars[size_#t~mem27.offset, size_#t~mem27.base] {2233#true} is VALID [2022-04-27 22:37:03,560 INFO L272 TraceCheckUtils]: 2: Hoare triple {2233#true} [222] L79-->sizeENTRY: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {2233#true} is VALID [2022-04-27 22:37:03,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {2233#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2233#true} is VALID [2022-04-27 22:37:03,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {2233#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2233#true} is VALID [2022-04-27 22:37:03,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {2233#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,560 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2233#true} {2233#true} [294] sizeEXIT-->L79-1: AOR: Formula: (= |v_size_#t~ret28_5| |v_size_#resOutParam_3|) InVars {size_#res=|v_size_#resOutParam_3|} OutVars{size_#t~ret28=|v_size_#t~ret28_5|} AuxVars[] AssignedVars[size_#t~ret28, size_#res] LVA: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {2233#true} is VALID [2022-04-27 22:37:03,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {2233#true} [228] L79-1-->L79-2: Formula: (let ((.cse0 (+ v_size_~t.offset_4 12))) (and (= |v_size_#t~mem29.offset_3| (select (select |v_#memory_$Pointer$.offset_32| v_size_~t.base_4) .cse0)) (= |v_size_#t~mem29.base_3| (select (select |v_#memory_$Pointer$.base_32| v_size_~t.base_4) .cse0)) (<= |v_size_#t~ret28_4| 2147483647) (<= 0 (+ |v_size_#t~ret28_4| 2147483648)))) InVars {size_~t.base=v_size_~t.base_4, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} OutVars{size_~t.base=v_size_~t.base_4, size_#t~mem29.offset=|v_size_#t~mem29.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_#t~mem29.base=|v_size_#t~mem29.base_3|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~mem29.base] {2233#true} is VALID [2022-04-27 22:37:03,561 INFO L272 TraceCheckUtils]: 8: Hoare triple {2233#true} [236] L79-2-->sizeENTRY: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {2233#true} is VALID [2022-04-27 22:37:03,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {2233#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2233#true} is VALID [2022-04-27 22:37:03,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {2233#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2233#true} is VALID [2022-04-27 22:37:03,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {2233#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,561 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2233#true} {2233#true} [295] sizeEXIT-->L79-3: AOR: Formula: (= |v_size_#t~ret30_4| |v_size_#resOutParam_4|) InVars {size_#res=|v_size_#resOutParam_4|} OutVars{size_#t~ret30=|v_size_#t~ret30_4|} AuxVars[] AssignedVars[size_#t~ret30, size_#res] LVA: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {2233#true} is VALID [2022-04-27 22:37:03,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {2233#true} [235] L79-3-->sizeFINAL: Formula: (and (= (+ |v_size_#t~ret30_3| |v_size_#t~ret28_2| 1) |v_size_#res_1|) (<= 0 (+ |v_size_#t~ret30_3| 2147483648)) (<= |v_size_#t~ret30_3| 2147483647)) InVars {size_#t~ret28=|v_size_#t~ret28_2|, size_#t~ret30=|v_size_#t~ret30_3|} OutVars{size_#t~mem29.offset=|v_size_#t~mem29.offset_2|, size_#t~mem29.base=|v_size_#t~mem29.base_2|, size_#t~mem27.offset=|v_size_#t~mem27.offset_1|, size_#res=|v_size_#res_1|, size_#t~mem27.base=|v_size_#t~mem27.base_1|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~ret28, size_#t~mem29.base, size_#t~mem27.offset, size_#t~mem27.base, size_#res, size_#t~ret30] {2233#true} is VALID [2022-04-27 22:37:03,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {2233#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,561 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2233#true} {2234#false} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {2234#false} is VALID [2022-04-27 22:37:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-27 22:37:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {2233#true} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2233#true} is VALID [2022-04-27 22:37:03,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} [227] L10-->L10-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2234#false} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {2234#false} is VALID [2022-04-27 22:37:03,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-27 22:37:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {2305#(= |#memory_int| |old(#memory_int)|)} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {2233#true} is VALID [2022-04-27 22:37:03,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2233#true} {2234#false} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {2234#false} is VALID [2022-04-27 22:37:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-27 22:37:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:03,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {2306#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {2233#true} is VALID [2022-04-27 22:37:03,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2233#true} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {2233#true} is VALID [2022-04-27 22:37:03,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2234#false} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {2234#false} is VALID [2022-04-27 22:37:03,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {2233#true} [188] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:37:03,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2233#true} is VALID [2022-04-27 22:37:03,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {2233#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2233#true} {2233#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {2233#true} [189] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,597 INFO L272 TraceCheckUtils]: 5: Hoare triple {2233#true} [192] mainENTRY-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#(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-27 22:37:03,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {2286#(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|))} [196] nondet_treeENTRY-->L30: Formula: (and (= (store |v_#length_10| v_nondet_tree_~n~0.base_3 20) |v_#length_9|) (= |v_#valid_13| (store |v_#valid_14| v_nondet_tree_~n~0.base_3 1)) (< v_nondet_tree_~n~0.base_3 |v_#StackHeapBarrier_1|) (= (store |v_#memory_$Pointer$.offset_24| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_$Pointer$.offset_24| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 (select (select |v_#memory_$Pointer$.offset_23| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3))) |v_#memory_$Pointer$.offset_23|) (= (store |v_#memory_$Pointer$.base_24| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_$Pointer$.base_24| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 (select (select |v_#memory_$Pointer$.base_23| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3))) |v_#memory_$Pointer$.base_23|) (= (mod |v_nondet_tree_#t~nondet5_4| 256) 0) (= (store |v_#memory_int_21| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_int_21| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 |v_nondet_tree_#t~nondet7_2|)) |v_#memory_int_20|) (= v_nondet_tree_~n~0.offset_3 0) (<= |v_nondet_tree_#t~nondet7_2| 2147483647) (not (= v_nondet_tree_~n~0.base_3 0)) (<= 0 (+ |v_nondet_tree_#t~nondet7_2| 2147483648)) (= (select |v_#valid_14| v_nondet_tree_~n~0.base_3) 0)) InVars {nondet_tree_#t~nondet7=|v_nondet_tree_#t~nondet7_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_4|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_21|, #length=|v_#length_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|} OutVars{nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, nondet_tree_#t~malloc6.base=|v_nondet_tree_#t~malloc6.base_1|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_20|, #length=|v_#length_9|, nondet_tree_#t~malloc6.offset=|v_nondet_tree_#t~malloc6.offset_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|} AuxVars[] AssignedVars[nondet_tree_#t~nondet7, nondet_tree_~n~0.base, #memory_$Pointer$.base, nondet_tree_#t~malloc6.base, nondet_tree_#t~nondet5, nondet_tree_~n~0.offset, #valid, #memory_int, #length, nondet_tree_#t~malloc6.offset, #memory_$Pointer$.offset] {2287#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:03,598 INFO L272 TraceCheckUtils]: 7: Hoare triple {2287#(not (= nondet_tree_~n~0.base 0))} [200] L30-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#(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-27 22:37:03,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {2286#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2233#true} is VALID [2022-04-27 22:37:03,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {2233#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2233#true} {2287#(not (= nondet_tree_~n~0.base 0))} [286] nondet_treeEXIT-->L30-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_2| |v_nondet_tree_#t~ret8.offset_4|) (= |v_nondet_tree_#res.baseOutParam_2| |v_nondet_tree_#t~ret8.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_2|} OutVars{nondet_tree_#t~ret8.base=|v_nondet_tree_#t~ret8.base_4|, nondet_tree_#t~ret8.offset=|v_nondet_tree_#t~ret8.offset_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret8.offset, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret8.base] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2287#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:03,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {2287#(not (= nondet_tree_~n~0.base 0))} [203] L30-1-->L31: Formula: (let ((.cse0 (+ 4 v_nondet_tree_~n~0.offset_1))) (and (= (store |v_#memory_$Pointer$.base_18| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_$Pointer$.base_18| v_nondet_tree_~n~0.base_1) .cse0 |v_nondet_tree_#t~ret8.base_3|)) |v_#memory_$Pointer$.base_17|) (= |v_#memory_int_14| (store |v_#memory_int_15| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_int_15| v_nondet_tree_~n~0.base_1) .cse0 (select (select |v_#memory_int_14| v_nondet_tree_~n~0.base_1) .cse0)))) (= (store |v_#memory_$Pointer$.offset_18| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_$Pointer$.offset_18| v_nondet_tree_~n~0.base_1) .cse0 |v_nondet_tree_#t~ret8.offset_3|)) |v_#memory_$Pointer$.offset_17|))) InVars {nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_1, #memory_int=|v_#memory_int_15|, nondet_tree_#t~ret8.offset=|v_nondet_tree_#t~ret8.offset_3|, nondet_tree_#t~ret8.base=|v_nondet_tree_#t~ret8.base_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_14|, nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_1} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, nondet_tree_#t~ret8.offset, nondet_tree_#t~ret8.base, #memory_$Pointer$.offset] {2287#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:03,600 INFO L272 TraceCheckUtils]: 12: Hoare triple {2287#(not (= nondet_tree_~n~0.base 0))} [207] L31-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#(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-27 22:37:03,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {2286#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2233#true} is VALID [2022-04-27 22:37:03,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {2233#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,601 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2233#true} {2287#(not (= nondet_tree_~n~0.base 0))} [287] nondet_treeEXIT-->L31-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_3| |v_nondet_tree_#t~ret9.offset_4|) (= |v_nondet_tree_#res.baseOutParam_3| |v_nondet_tree_#t~ret9.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_3|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_3|} OutVars{nondet_tree_#t~ret9.offset=|v_nondet_tree_#t~ret9.offset_4|, nondet_tree_#t~ret9.base=|v_nondet_tree_#t~ret9.base_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret9.base, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret9.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2287#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:03,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {2287#(not (= nondet_tree_~n~0.base 0))} [206] L31-1-->nondet_treeFINAL: Formula: (let ((.cse0 (+ 12 v_nondet_tree_~n~0.offset_2))) (and (= v_nondet_tree_~n~0.base_2 |v_nondet_tree_#res.base_1|) (= |v_nondet_tree_#res.offset_1| v_nondet_tree_~n~0.offset_2) (= (store |v_#memory_$Pointer$.offset_22| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_$Pointer$.offset_22| v_nondet_tree_~n~0.base_2) .cse0 |v_nondet_tree_#t~ret9.offset_3|)) |v_#memory_$Pointer$.offset_21|) (= |v_#memory_$Pointer$.base_21| (store |v_#memory_$Pointer$.base_22| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_$Pointer$.base_22| v_nondet_tree_~n~0.base_2) .cse0 |v_nondet_tree_#t~ret9.base_3|))) (= |v_#memory_int_18| (store |v_#memory_int_19| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_int_19| v_nondet_tree_~n~0.base_2) .cse0 (select (select |v_#memory_int_18| v_nondet_tree_~n~0.base_2) .cse0)))))) InVars {nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_22|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_2, #memory_int=|v_#memory_int_19|, nondet_tree_#t~ret9.base=|v_nondet_tree_#t~ret9.base_3|, nondet_tree_#t~ret9.offset=|v_nondet_tree_#t~ret9.offset_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_22|} OutVars{nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_21|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_2, #memory_int=|v_#memory_int_18|, nondet_tree_#res.base=|v_nondet_tree_#res.base_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_21|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, nondet_tree_#res.base, nondet_tree_#t~ret9.base, nondet_tree_#res.offset, nondet_tree_#t~ret9.offset, #memory_$Pointer$.offset] {2294#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-27 22:37:03,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {2294#(not (= |nondet_tree_#res.base| 0))} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2294#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-27 22:37:03,602 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2294#(not (= |nondet_tree_#res.base| 0))} {2233#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2251#(not (= |main_#t~ret44.base| 0))} is VALID [2022-04-27 22:37:03,603 INFO L272 TraceCheckUtils]: 19: Hoare triple {2251#(not (= |main_#t~ret44.base| 0))} [194] L105-->taskENTRY: Formula: (and (= |v_main_#t~ret44.base_5| |v_task_#in~t.baseInParam_1|) (= |v_main_#t~ret44.offset_5| |v_task_#in~t.offsetInParam_1|)) InVars {main_#t~ret44.offset=|v_main_#t~ret44.offset_5|, main_#t~ret44.base=|v_main_#t~ret44.base_5|} OutVars{task_#in~t.base=|v_task_#in~t.baseInParam_1|, task_#in~t.offset=|v_task_#in~t.offsetInParam_1|} AuxVars[] AssignedVars[task_#in~t.offset, main_#t~ret44.offset, task_#in~t.base, main_#t~ret44.base] {2252#(not (= |task_#in~t.base| 0))} is VALID [2022-04-27 22:37:03,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {2252#(not (= |task_#in~t.base| 0))} [198] taskENTRY-->L83: Formula: (and (= |v_task_#in~t.offset_1| v_task_~t.offset_6) (= v_task_~t.base_6 |v_task_#in~t.base_1|)) InVars {task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|} OutVars{task_~t.offset=v_task_~t.offset_6, task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|, task_~t.base=v_task_~t.base_6} AuxVars[] AssignedVars[task_~t.offset, task_~t.base] {2253#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:03,603 INFO L272 TraceCheckUtils]: 21: Hoare triple {2253#(not (= task_~t.base 0))} [202] L83-->minENTRY: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {2233#true} is VALID [2022-04-27 22:37:03,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {2233#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {2295#(= min_~n.base |min_#in~n.base|)} is VALID [2022-04-27 22:37:03,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {2295#(= min_~n.base |min_#in~n.base|)} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {2296#(= |min_#in~n.base| 0)} is VALID [2022-04-27 22:37:03,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {2296#(= |min_#in~n.base| 0)} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2296#(= |min_#in~n.base| 0)} is VALID [2022-04-27 22:37:03,605 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2296#(= |min_#in~n.base| 0)} {2253#(not (= task_~t.base 0))} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {2234#false} is VALID [2022-04-27 22:37:03,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#false} [204] L83-1-->L86: Formula: (and (<= 0 (+ |v_task_#t~ret31_3| 2147483648)) (= (select |v_#valid_17| |v_task_~#b~1.base_1|) 0) (= |v_task_~#b~1.offset_1| 0) (not (= |v_task_~#b~1.base_1| 0)) (<= |v_task_#t~ret31_3| 2147483647) (< |v_#StackHeapBarrier_3| |v_task_~#b~1.base_1|) (= |v_task_#t~ret31_3| v_task_~a~1_1) (= (store |v_#length_13| |v_task_~#b~1.base_1| 4) |v_#length_12|) (= (store |v_#valid_17| |v_task_~#b~1.base_1| 1) |v_#valid_16|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, task_#t~ret31=|v_task_#t~ret31_3|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, task_~#b~1.offset=|v_task_~#b~1.offset_1|, #valid=|v_#valid_16|, task_~#b~1.base=|v_task_~#b~1.base_1|, #length=|v_#length_12|, task_~a~1=v_task_~a~1_1} AuxVars[] AssignedVars[task_#t~ret31, task_~#b~1.offset, #valid, task_~#b~1.base, #length, task_~a~1] {2234#false} is VALID [2022-04-27 22:37:03,605 INFO L272 TraceCheckUtils]: 27: Hoare triple {2234#false} [208] L86-->sizeENTRY: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {2233#true} is VALID [2022-04-27 22:37:03,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {2233#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2233#true} is VALID [2022-04-27 22:37:03,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {2233#true} [217] L78-->L79: Formula: (let ((.cse0 (+ v_size_~t.offset_3 4))) (and (or (not (= v_size_~t.base_3 0)) (not (= v_size_~t.offset_3 0))) (= |v_size_#t~mem27.offset_2| (select (select |v_#memory_$Pointer$.offset_31| v_size_~t.base_3) .cse0)) (= (select (select |v_#memory_$Pointer$.base_31| v_size_~t.base_3) .cse0) |v_size_#t~mem27.base_2|))) InVars {size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_#t~mem27.offset=|v_size_#t~mem27.offset_2|, size_#t~mem27.base=|v_size_#t~mem27.base_2|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} AuxVars[] AssignedVars[size_#t~mem27.offset, size_#t~mem27.base] {2233#true} is VALID [2022-04-27 22:37:03,606 INFO L272 TraceCheckUtils]: 30: Hoare triple {2233#true} [222] L79-->sizeENTRY: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {2233#true} is VALID [2022-04-27 22:37:03,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {2233#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2233#true} is VALID [2022-04-27 22:37:03,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {2233#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2233#true} is VALID [2022-04-27 22:37:03,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {2233#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,606 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2233#true} {2233#true} [294] sizeEXIT-->L79-1: AOR: Formula: (= |v_size_#t~ret28_5| |v_size_#resOutParam_3|) InVars {size_#res=|v_size_#resOutParam_3|} OutVars{size_#t~ret28=|v_size_#t~ret28_5|} AuxVars[] AssignedVars[size_#t~ret28, size_#res] LVA: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {2233#true} is VALID [2022-04-27 22:37:03,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {2233#true} [228] L79-1-->L79-2: Formula: (let ((.cse0 (+ v_size_~t.offset_4 12))) (and (= |v_size_#t~mem29.offset_3| (select (select |v_#memory_$Pointer$.offset_32| v_size_~t.base_4) .cse0)) (= |v_size_#t~mem29.base_3| (select (select |v_#memory_$Pointer$.base_32| v_size_~t.base_4) .cse0)) (<= |v_size_#t~ret28_4| 2147483647) (<= 0 (+ |v_size_#t~ret28_4| 2147483648)))) InVars {size_~t.base=v_size_~t.base_4, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} OutVars{size_~t.base=v_size_~t.base_4, size_#t~mem29.offset=|v_size_#t~mem29.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_#t~mem29.base=|v_size_#t~mem29.base_3|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~mem29.base] {2233#true} is VALID [2022-04-27 22:37:03,606 INFO L272 TraceCheckUtils]: 36: Hoare triple {2233#true} [236] L79-2-->sizeENTRY: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {2233#true} is VALID [2022-04-27 22:37:03,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {2233#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2233#true} is VALID [2022-04-27 22:37:03,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {2233#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2233#true} is VALID [2022-04-27 22:37:03,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {2233#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,607 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2233#true} {2233#true} [295] sizeEXIT-->L79-3: AOR: Formula: (= |v_size_#t~ret30_4| |v_size_#resOutParam_4|) InVars {size_#res=|v_size_#resOutParam_4|} OutVars{size_#t~ret30=|v_size_#t~ret30_4|} AuxVars[] AssignedVars[size_#t~ret30, size_#res] LVA: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {2233#true} is VALID [2022-04-27 22:37:03,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {2233#true} [235] L79-3-->sizeFINAL: Formula: (and (= (+ |v_size_#t~ret30_3| |v_size_#t~ret28_2| 1) |v_size_#res_1|) (<= 0 (+ |v_size_#t~ret30_3| 2147483648)) (<= |v_size_#t~ret30_3| 2147483647)) InVars {size_#t~ret28=|v_size_#t~ret28_2|, size_#t~ret30=|v_size_#t~ret30_3|} OutVars{size_#t~mem29.offset=|v_size_#t~mem29.offset_2|, size_#t~mem29.base=|v_size_#t~mem29.base_2|, size_#t~mem27.offset=|v_size_#t~mem27.offset_1|, size_#res=|v_size_#res_1|, size_#t~mem27.base=|v_size_#t~mem27.base_1|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~ret28, size_#t~mem29.base, size_#t~mem27.offset, size_#t~mem27.base, size_#res, size_#t~ret30] {2233#true} is VALID [2022-04-27 22:37:03,607 INFO L290 TraceCheckUtils]: 42: Hoare triple {2233#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,607 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2233#true} {2234#false} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {2234#false} is VALID [2022-04-27 22:37:03,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {2234#false} [211] L86-1-->L87: Formula: (and (= |v_task_#t~ret32_3| v_task_~n~1_1) (<= |v_task_#t~ret32_3| 2147483647) (<= 0 (+ |v_task_#t~ret32_3| 2147483648))) InVars {task_#t~ret32=|v_task_#t~ret32_3|} OutVars{task_~n~1=v_task_~n~1_1} AuxVars[] AssignedVars[task_#t~ret32, task_~n~1] {2234#false} is VALID [2022-04-27 22:37:03,607 INFO L272 TraceCheckUtils]: 45: Hoare triple {2234#false} [215] L87-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {2233#true} is VALID [2022-04-27 22:37:03,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {2233#true} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2233#true} is VALID [2022-04-27 22:37:03,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {2233#true} [227] L10-->L10-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {2233#true} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,608 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2233#true} {2234#false} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {2234#false} is VALID [2022-04-27 22:37:03,608 INFO L290 TraceCheckUtils]: 50: Hoare triple {2234#false} [219] L87-1-->L88: Formula: (and (not (= |v_task_#t~malloc33.base_1| 0)) (< |v_task_#t~malloc33.base_1| |v_#StackHeapBarrier_4|) (= |v_task_#t~malloc33.offset_1| 0) (= (store |v_#valid_19| |v_task_#t~malloc33.base_1| 1) |v_#valid_18|) (= (select |v_#valid_19| |v_task_#t~malloc33.base_1|) 0) (= (store |v_#length_15| |v_task_#t~malloc33.base_1| (* 4 v_task_~n~1_3)) |v_#length_14|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, task_~n~1=v_task_~n~1_3, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, task_~n~1=v_task_~n~1_3, task_#t~malloc33.base=|v_task_#t~malloc33.base_1|, #valid=|v_#valid_18|, #length=|v_#length_14|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_1|} AuxVars[] AssignedVars[task_#t~malloc33.base, #valid, #length, task_#t~malloc33.offset] {2234#false} is VALID [2022-04-27 22:37:03,608 INFO L272 TraceCheckUtils]: 51: Hoare triple {2234#false} [225] L88-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {2305#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 22:37:03,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {2305#(= |#memory_int| |old(#memory_int)|)} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {2233#true} is VALID [2022-04-27 22:37:03,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {2233#true} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,609 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2233#true} {2234#false} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {2234#false} is VALID [2022-04-27 22:37:03,609 INFO L290 TraceCheckUtils]: 55: Hoare triple {2234#false} [231] L88-1-->L89: Formula: (and (= |v_task_#t~malloc33.offset_3| v_task_~x~0.offset_1) (= v_task_~x~0.base_1 |v_task_#t~malloc33.base_3|)) InVars {task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} OutVars{task_~x~0.base=v_task_~x~0.base_1, task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_~x~0.offset=v_task_~x~0.offset_1, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} AuxVars[] AssignedVars[task_~x~0.base, task_~x~0.offset] {2234#false} is VALID [2022-04-27 22:37:03,609 INFO L272 TraceCheckUtils]: 56: Hoare triple {2234#false} [237] L89-->tree_inorderENTRY: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {2306#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-27 22:37:03,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {2306#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {2233#true} is VALID [2022-04-27 22:37:03,609 INFO L290 TraceCheckUtils]: 58: Hoare triple {2233#true} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {2233#true} is VALID [2022-04-27 22:37:03,609 INFO L290 TraceCheckUtils]: 59: Hoare triple {2233#true} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2233#true} is VALID [2022-04-27 22:37:03,609 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2233#true} {2234#false} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {2234#false} is VALID [2022-04-27 22:37:03,609 INFO L290 TraceCheckUtils]: 61: Hoare triple {2234#false} [240] L89-1-->L90: Formula: (and (= |v_task_#t~mem35_1| (select (select |v_#memory_int_27| v_task_~x~0.base_3) v_task_~x~0.offset_3)) (<= 0 (+ |v_task_#t~ret34_3| 2147483648)) (<= |v_task_#t~ret34_3| 2147483647)) InVars {#memory_int=|v_#memory_int_27|, task_~x~0.base=v_task_~x~0.base_3, task_#t~ret34=|v_task_#t~ret34_3|, task_~x~0.offset=v_task_~x~0.offset_3} OutVars{#memory_int=|v_#memory_int_27|, task_#t~mem35=|v_task_#t~mem35_1|, task_~x~0.base=v_task_~x~0.base_3, task_~x~0.offset=v_task_~x~0.offset_3} AuxVars[] AssignedVars[task_#t~ret34, task_#t~mem35] {2234#false} is VALID [2022-04-27 22:37:03,610 INFO L272 TraceCheckUtils]: 62: Hoare triple {2234#false} [243] L90-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_task_#t~mem35_4| v_task_~a~1_4) 1 0)) InVars {task_#t~mem35=|v_task_#t~mem35_4|, task_~a~1=v_task_~a~1_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, task_#t~mem35, task_~a~1] {2234#false} is VALID [2022-04-27 22:37:03,610 INFO L290 TraceCheckUtils]: 63: Hoare triple {2234#false} [248] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2234#false} is VALID [2022-04-27 22:37:03,610 INFO L290 TraceCheckUtils]: 64: Hoare triple {2234#false} [253] L16-->L16-1: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2234#false} is VALID [2022-04-27 22:37:03,610 INFO L290 TraceCheckUtils]: 65: Hoare triple {2234#false} [259] L16-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#false} is VALID [2022-04-27 22:37:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-27 22:37:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:37:03,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806523694] [2022-04-27 22:37:03,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806523694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:37:03,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:37:03,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-27 22:37:03,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941351218] [2022-04-27 22:37:03,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:37:03,614 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2022-04-27 22:37:03,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:37:03,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-27 22:37:03,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:37:03,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 22:37:03,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:37:03,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 22:37:03,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-27 22:37:03,659 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-27 22:37:05,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:37:05,750 INFO L93 Difference]: Finished difference Result 163 states and 208 transitions. [2022-04-27 22:37:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 22:37:05,750 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2022-04-27 22:37:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:37:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-27 22:37:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 200 transitions. [2022-04-27 22:37:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-27 22:37:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 200 transitions. [2022-04-27 22:37:05,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 200 transitions. [2022-04-27 22:37:05,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:37:05,958 INFO L225 Difference]: With dead ends: 163 [2022-04-27 22:37:05,958 INFO L226 Difference]: Without dead ends: 98 [2022-04-27 22:37:05,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-27 22:37:05,964 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 168 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:37:05,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 82 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 22:37:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-27 22:37:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2022-04-27 22:37:05,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:37:05,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-04-27 22:37:05,982 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-04-27 22:37:05,983 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-04-27 22:37:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:37:05,986 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2022-04-27 22:37:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2022-04-27 22:37:05,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:37:05,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:37:05,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) Second operand 98 states. [2022-04-27 22:37:05,993 INFO L87 Difference]: Start difference. First operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) Second operand 98 states. [2022-04-27 22:37:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:37:05,998 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2022-04-27 22:37:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2022-04-27 22:37:05,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:37:05,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:37:05,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:37:05,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:37:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-04-27 22:37:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2022-04-27 22:37:06,003 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 66 [2022-04-27 22:37:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:37:06,003 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2022-04-27 22:37:06,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-27 22:37:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2022-04-27 22:37:06,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 22:37:06,005 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:37:06,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:37:06,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 22:37:06,005 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:37:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:37:06,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1535547247, now seen corresponding path program 1 times [2022-04-27 22:37:06,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:37:06,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468390338] [2022-04-27 22:37:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:37:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:37:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:37:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {2949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2884#true} is VALID [2022-04-27 22:37:06,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2884#true} {2884#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-27 22:37:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 22:37:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {2950#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2884#true} is VALID [2022-04-27 22:37:06,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2884#true} {2951#(not (= nondet_tree_~n~0.base 0))} [286] nondet_treeEXIT-->L30-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_2| |v_nondet_tree_#t~ret8.offset_4|) (= |v_nondet_tree_#res.baseOutParam_2| |v_nondet_tree_#t~ret8.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_2|} OutVars{nondet_tree_#t~ret8.base=|v_nondet_tree_#t~ret8.base_4|, nondet_tree_#t~ret8.offset=|v_nondet_tree_#t~ret8.offset_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret8.offset, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret8.base] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2951#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:06,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 22:37:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {2950#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2884#true} is VALID [2022-04-27 22:37:06,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2884#true} {2951#(not (= nondet_tree_~n~0.base 0))} [287] nondet_treeEXIT-->L31-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_3| |v_nondet_tree_#t~ret9.offset_4|) (= |v_nondet_tree_#res.baseOutParam_3| |v_nondet_tree_#t~ret9.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_3|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_3|} OutVars{nondet_tree_#t~ret9.offset=|v_nondet_tree_#t~ret9.offset_4|, nondet_tree_#t~ret9.base=|v_nondet_tree_#t~ret9.base_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret9.base, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret9.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2951#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:06,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {2950#(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|))} [196] nondet_treeENTRY-->L30: Formula: (and (= (store |v_#length_10| v_nondet_tree_~n~0.base_3 20) |v_#length_9|) (= |v_#valid_13| (store |v_#valid_14| v_nondet_tree_~n~0.base_3 1)) (< v_nondet_tree_~n~0.base_3 |v_#StackHeapBarrier_1|) (= (store |v_#memory_$Pointer$.offset_24| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_$Pointer$.offset_24| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 (select (select |v_#memory_$Pointer$.offset_23| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3))) |v_#memory_$Pointer$.offset_23|) (= (store |v_#memory_$Pointer$.base_24| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_$Pointer$.base_24| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 (select (select |v_#memory_$Pointer$.base_23| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3))) |v_#memory_$Pointer$.base_23|) (= (mod |v_nondet_tree_#t~nondet5_4| 256) 0) (= (store |v_#memory_int_21| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_int_21| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 |v_nondet_tree_#t~nondet7_2|)) |v_#memory_int_20|) (= v_nondet_tree_~n~0.offset_3 0) (<= |v_nondet_tree_#t~nondet7_2| 2147483647) (not (= v_nondet_tree_~n~0.base_3 0)) (<= 0 (+ |v_nondet_tree_#t~nondet7_2| 2147483648)) (= (select |v_#valid_14| v_nondet_tree_~n~0.base_3) 0)) InVars {nondet_tree_#t~nondet7=|v_nondet_tree_#t~nondet7_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_4|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_21|, #length=|v_#length_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|} OutVars{nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, nondet_tree_#t~malloc6.base=|v_nondet_tree_#t~malloc6.base_1|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_20|, #length=|v_#length_9|, nondet_tree_#t~malloc6.offset=|v_nondet_tree_#t~malloc6.offset_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|} AuxVars[] AssignedVars[nondet_tree_#t~nondet7, nondet_tree_~n~0.base, #memory_$Pointer$.base, nondet_tree_#t~malloc6.base, nondet_tree_#t~nondet5, nondet_tree_~n~0.offset, #valid, #memory_int, #length, nondet_tree_#t~malloc6.offset, #memory_$Pointer$.offset] {2951#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:06,173 INFO L272 TraceCheckUtils]: 1: Hoare triple {2951#(not (= nondet_tree_~n~0.base 0))} [200] L30-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2950#(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-27 22:37:06,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {2950#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2884#true} is VALID [2022-04-27 22:37:06,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {2884#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,173 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2884#true} {2951#(not (= nondet_tree_~n~0.base 0))} [286] nondet_treeEXIT-->L30-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_2| |v_nondet_tree_#t~ret8.offset_4|) (= |v_nondet_tree_#res.baseOutParam_2| |v_nondet_tree_#t~ret8.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_2|} OutVars{nondet_tree_#t~ret8.base=|v_nondet_tree_#t~ret8.base_4|, nondet_tree_#t~ret8.offset=|v_nondet_tree_#t~ret8.offset_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret8.offset, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret8.base] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2951#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:06,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {2951#(not (= nondet_tree_~n~0.base 0))} [203] L30-1-->L31: Formula: (let ((.cse0 (+ 4 v_nondet_tree_~n~0.offset_1))) (and (= (store |v_#memory_$Pointer$.base_18| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_$Pointer$.base_18| v_nondet_tree_~n~0.base_1) .cse0 |v_nondet_tree_#t~ret8.base_3|)) |v_#memory_$Pointer$.base_17|) (= |v_#memory_int_14| (store |v_#memory_int_15| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_int_15| v_nondet_tree_~n~0.base_1) .cse0 (select (select |v_#memory_int_14| v_nondet_tree_~n~0.base_1) .cse0)))) (= (store |v_#memory_$Pointer$.offset_18| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_$Pointer$.offset_18| v_nondet_tree_~n~0.base_1) .cse0 |v_nondet_tree_#t~ret8.offset_3|)) |v_#memory_$Pointer$.offset_17|))) InVars {nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_1, #memory_int=|v_#memory_int_15|, nondet_tree_#t~ret8.offset=|v_nondet_tree_#t~ret8.offset_3|, nondet_tree_#t~ret8.base=|v_nondet_tree_#t~ret8.base_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_14|, nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_1} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, nondet_tree_#t~ret8.offset, nondet_tree_#t~ret8.base, #memory_$Pointer$.offset] {2951#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:06,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {2951#(not (= nondet_tree_~n~0.base 0))} [207] L31-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2950#(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-27 22:37:06,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2884#true} is VALID [2022-04-27 22:37:06,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {2884#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,175 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2884#true} {2951#(not (= nondet_tree_~n~0.base 0))} [287] nondet_treeEXIT-->L31-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_3| |v_nondet_tree_#t~ret9.offset_4|) (= |v_nondet_tree_#res.baseOutParam_3| |v_nondet_tree_#t~ret9.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_3|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_3|} OutVars{nondet_tree_#t~ret9.offset=|v_nondet_tree_#t~ret9.offset_4|, nondet_tree_#t~ret9.base=|v_nondet_tree_#t~ret9.base_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret9.base, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret9.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2951#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:06,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {2951#(not (= nondet_tree_~n~0.base 0))} [206] L31-1-->nondet_treeFINAL: Formula: (let ((.cse0 (+ 12 v_nondet_tree_~n~0.offset_2))) (and (= v_nondet_tree_~n~0.base_2 |v_nondet_tree_#res.base_1|) (= |v_nondet_tree_#res.offset_1| v_nondet_tree_~n~0.offset_2) (= (store |v_#memory_$Pointer$.offset_22| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_$Pointer$.offset_22| v_nondet_tree_~n~0.base_2) .cse0 |v_nondet_tree_#t~ret9.offset_3|)) |v_#memory_$Pointer$.offset_21|) (= |v_#memory_$Pointer$.base_21| (store |v_#memory_$Pointer$.base_22| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_$Pointer$.base_22| v_nondet_tree_~n~0.base_2) .cse0 |v_nondet_tree_#t~ret9.base_3|))) (= |v_#memory_int_18| (store |v_#memory_int_19| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_int_19| v_nondet_tree_~n~0.base_2) .cse0 (select (select |v_#memory_int_18| v_nondet_tree_~n~0.base_2) .cse0)))))) InVars {nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_22|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_2, #memory_int=|v_#memory_int_19|, nondet_tree_#t~ret9.base=|v_nondet_tree_#t~ret9.base_3|, nondet_tree_#t~ret9.offset=|v_nondet_tree_#t~ret9.offset_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_22|} OutVars{nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_21|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_2, #memory_int=|v_#memory_int_18|, nondet_tree_#res.base=|v_nondet_tree_#res.base_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_21|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, nondet_tree_#res.base, nondet_tree_#t~ret9.base, nondet_tree_#res.offset, nondet_tree_#t~ret9.offset, #memory_$Pointer$.offset] {2958#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-27 22:37:06,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(not (= |nondet_tree_#res.base| 0))} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2958#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-27 22:37:06,177 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2958#(not (= |nondet_tree_#res.base| 0))} {2884#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2902#(not (= |main_#t~ret44.base| 0))} is VALID [2022-04-27 22:37:06,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 22:37:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 22:37:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {2884#true} is VALID [2022-04-27 22:37:06,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {2884#true} is VALID [2022-04-27 22:37:06,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {2884#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2884#true} {2884#true} [289] minEXIT-->L40-1: AOR: Formula: (= |v_min_#resOutParam_1| |v_min_#t~ret11_4|) InVars {min_#res=|v_min_#resOutParam_1|} OutVars{min_#t~ret11=|v_min_#t~ret11_4|} AuxVars[] AssignedVars[min_#res, min_#t~ret11] LVA: Formula: (and (= |v_min_#in~n.baseInParam_1| |v_min_#t~mem10.base_4|) (= |v_min_#t~mem10.offset_4| |v_min_#in~n.offsetInParam_1|)) InVars {min_#t~mem10.offset=|v_min_#t~mem10.offset_4|, min_#t~mem10.base=|v_min_#t~mem10.base_4|} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_1|, min_#in~n.offset=|v_min_#in~n.offsetInParam_1|} AuxVars[] AssignedVars[min_#in~n.offset, min_#t~mem10.offset, min_#in~n.base, min_#t~mem10.base] {2884#true} is VALID [2022-04-27 22:37:06,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 22:37:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {2884#true} is VALID [2022-04-27 22:37:06,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {2884#true} is VALID [2022-04-27 22:37:06,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {2884#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2884#true} {2884#true} [290] minEXIT-->L41-1: AOR: Formula: (= |v_min_#resOutParam_2| |v_min_#t~ret13_4|) InVars {min_#res=|v_min_#resOutParam_2|} OutVars{min_#t~ret13=|v_min_#t~ret13_4|} AuxVars[] AssignedVars[min_#res, min_#t~ret13] LVA: Formula: (and (= |v_min_#in~n.baseInParam_2| |v_min_#t~mem12.base_4|) (= |v_min_#in~n.offsetInParam_2| |v_min_#t~mem12.offset_4|)) InVars {min_#t~mem12.offset=|v_min_#t~mem12.offset_4|, min_#t~mem12.base=|v_min_#t~mem12.base_4|} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_2|, min_#in~n.offset=|v_min_#in~n.offsetInParam_2|} AuxVars[] AssignedVars[min_#t~mem12.offset, min_#in~n.offset, min_#in~n.base, min_#t~mem12.base] {2884#true} is VALID [2022-04-27 22:37:06,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {2884#true} is VALID [2022-04-27 22:37:06,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} [210] L37-->L40: Formula: (let ((.cse0 (+ v_min_~n.offset_1 4))) (and (= (select (select |v_#memory_$Pointer$.offset_13| v_min_~n.base_1) .cse0) |v_min_#t~mem10.offset_1|) (= (select (select |v_#memory_$Pointer$.base_13| v_min_~n.base_1) .cse0) |v_min_#t~mem10.base_1|) (or (not (= v_min_~n.base_1 0)) (not (= v_min_~n.offset_1 0))))) InVars {min_~n.offset=v_min_~n.offset_1, min_~n.base=v_min_~n.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_13|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_13|} OutVars{min_~n.offset=v_min_~n.offset_1, min_~n.base=v_min_~n.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_13|, min_#t~mem10.offset=|v_min_#t~mem10.offset_1|, min_#t~mem10.base=|v_min_#t~mem10.base_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_13|} AuxVars[] AssignedVars[min_#t~mem10.offset, min_#t~mem10.base] {2884#true} is VALID [2022-04-27 22:37:06,197 INFO L272 TraceCheckUtils]: 2: Hoare triple {2884#true} [214] L40-->minENTRY: Formula: (and (= |v_min_#in~n.baseInParam_1| |v_min_#t~mem10.base_4|) (= |v_min_#t~mem10.offset_4| |v_min_#in~n.offsetInParam_1|)) InVars {min_#t~mem10.offset=|v_min_#t~mem10.offset_4|, min_#t~mem10.base=|v_min_#t~mem10.base_4|} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_1|, min_#in~n.offset=|v_min_#in~n.offsetInParam_1|} AuxVars[] AssignedVars[min_#in~n.offset, min_#t~mem10.offset, min_#in~n.base, min_#t~mem10.base] {2884#true} is VALID [2022-04-27 22:37:06,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {2884#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {2884#true} is VALID [2022-04-27 22:37:06,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {2884#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {2884#true} is VALID [2022-04-27 22:37:06,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {2884#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,197 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2884#true} {2884#true} [289] minEXIT-->L40-1: AOR: Formula: (= |v_min_#resOutParam_1| |v_min_#t~ret11_4|) InVars {min_#res=|v_min_#resOutParam_1|} OutVars{min_#t~ret11=|v_min_#t~ret11_4|} AuxVars[] AssignedVars[min_#res, min_#t~ret11] LVA: Formula: (and (= |v_min_#in~n.baseInParam_1| |v_min_#t~mem10.base_4|) (= |v_min_#t~mem10.offset_4| |v_min_#in~n.offsetInParam_1|)) InVars {min_#t~mem10.offset=|v_min_#t~mem10.offset_4|, min_#t~mem10.base=|v_min_#t~mem10.base_4|} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_1|, min_#in~n.offset=|v_min_#in~n.offsetInParam_1|} AuxVars[] AssignedVars[min_#in~n.offset, min_#t~mem10.offset, min_#in~n.base, min_#t~mem10.base] {2884#true} is VALID [2022-04-27 22:37:06,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {2884#true} [218] L40-1-->L41: Formula: (let ((.cse0 (+ v_min_~n.offset_2 12))) (and (= v_min_~a~0_1 |v_min_#t~ret11_3|) (<= |v_min_#t~ret11_3| 2147483647) (= (select (select |v_#memory_$Pointer$.offset_14| v_min_~n.base_2) .cse0) |v_min_#t~mem12.offset_1|) (= (select (select |v_#memory_$Pointer$.base_14| v_min_~n.base_2) .cse0) |v_min_#t~mem12.base_1|) (<= 0 (+ |v_min_#t~ret11_3| 2147483648)))) InVars {min_~n.offset=v_min_~n.offset_2, min_~n.base=v_min_~n.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, min_#t~ret11=|v_min_#t~ret11_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|} OutVars{min_~n.offset=v_min_~n.offset_2, min_~n.base=v_min_~n.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, min_#t~mem12.offset=|v_min_#t~mem12.offset_1|, min_~a~0=v_min_~a~0_1, min_#t~mem10.offset=|v_min_#t~mem10.offset_3|, min_#t~mem10.base=|v_min_#t~mem10.base_3|, min_#t~mem12.base=|v_min_#t~mem12.base_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|} AuxVars[] AssignedVars[min_#t~mem12.offset, min_~a~0, min_#t~mem10.offset, min_#t~mem10.base, min_#t~ret11, min_#t~mem12.base] {2884#true} is VALID [2022-04-27 22:37:06,198 INFO L272 TraceCheckUtils]: 8: Hoare triple {2884#true} [224] L41-->minENTRY: Formula: (and (= |v_min_#in~n.baseInParam_2| |v_min_#t~mem12.base_4|) (= |v_min_#in~n.offsetInParam_2| |v_min_#t~mem12.offset_4|)) InVars {min_#t~mem12.offset=|v_min_#t~mem12.offset_4|, min_#t~mem12.base=|v_min_#t~mem12.base_4|} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_2|, min_#in~n.offset=|v_min_#in~n.offsetInParam_2|} AuxVars[] AssignedVars[min_#t~mem12.offset, min_#in~n.offset, min_#in~n.base, min_#t~mem12.base] {2884#true} is VALID [2022-04-27 22:37:06,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {2884#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {2884#true} is VALID [2022-04-27 22:37:06,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {2884#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {2884#true} is VALID [2022-04-27 22:37:06,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {2884#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,198 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2884#true} {2884#true} [290] minEXIT-->L41-1: AOR: Formula: (= |v_min_#resOutParam_2| |v_min_#t~ret13_4|) InVars {min_#res=|v_min_#resOutParam_2|} OutVars{min_#t~ret13=|v_min_#t~ret13_4|} AuxVars[] AssignedVars[min_#res, min_#t~ret13] LVA: Formula: (and (= |v_min_#in~n.baseInParam_2| |v_min_#t~mem12.base_4|) (= |v_min_#in~n.offsetInParam_2| |v_min_#t~mem12.offset_4|)) InVars {min_#t~mem12.offset=|v_min_#t~mem12.offset_4|, min_#t~mem12.base=|v_min_#t~mem12.base_4|} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_2|, min_#in~n.offset=|v_min_#in~n.offsetInParam_2|} AuxVars[] AssignedVars[min_#t~mem12.offset, min_#in~n.offset, min_#in~n.base, min_#t~mem12.base] {2884#true} is VALID [2022-04-27 22:37:06,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {2884#true} [223] L41-1-->L42: Formula: (and (<= |v_min_#t~ret13_3| 2147483647) (<= 0 (+ |v_min_#t~ret13_3| 2147483648)) (= v_min_~b~0_1 |v_min_#t~ret13_3|)) InVars {min_#t~ret13=|v_min_#t~ret13_3|} OutVars{min_#t~mem12.offset=|v_min_#t~mem12.offset_3|, min_~b~0=v_min_~b~0_1, min_#t~mem12.base=|v_min_#t~mem12.base_3|} AuxVars[] AssignedVars[min_#t~mem12.offset, min_~b~0, min_#t~mem12.base, min_#t~ret13] {2884#true} is VALID [2022-04-27 22:37:06,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {2884#true} [229] L42-->minFINAL: Formula: (and (<= v_min_~a~0_2 v_min_~b~0_2) (= v_min_~a~0_2 |v_min_#res_1|)) InVars {min_~b~0=v_min_~b~0_2, min_~a~0=v_min_~a~0_2} OutVars{min_#res=|v_min_#res_1|, min_~b~0=v_min_~b~0_2, min_~a~0=v_min_~a~0_2} AuxVars[] AssignedVars[min_#res] {2884#true} is VALID [2022-04-27 22:37:06,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {2884#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,199 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2884#true} {2904#(not (= task_~t.base 0))} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-27 22:37:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 22:37:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2884#true} is VALID [2022-04-27 22:37:06,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2884#true} is VALID [2022-04-27 22:37:06,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {2884#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2884#true} {2884#true} [294] sizeEXIT-->L79-1: AOR: Formula: (= |v_size_#t~ret28_5| |v_size_#resOutParam_3|) InVars {size_#res=|v_size_#resOutParam_3|} OutVars{size_#t~ret28=|v_size_#t~ret28_5|} AuxVars[] AssignedVars[size_#t~ret28, size_#res] LVA: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {2884#true} is VALID [2022-04-27 22:37:06,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 22:37:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2884#true} is VALID [2022-04-27 22:37:06,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2884#true} is VALID [2022-04-27 22:37:06,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {2884#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2884#true} {2884#true} [295] sizeEXIT-->L79-3: AOR: Formula: (= |v_size_#t~ret30_4| |v_size_#resOutParam_4|) InVars {size_#res=|v_size_#resOutParam_4|} OutVars{size_#t~ret30=|v_size_#t~ret30_4|} AuxVars[] AssignedVars[size_#t~ret30, size_#res] LVA: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {2884#true} is VALID [2022-04-27 22:37:06,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2884#true} is VALID [2022-04-27 22:37:06,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} [217] L78-->L79: Formula: (let ((.cse0 (+ v_size_~t.offset_3 4))) (and (or (not (= v_size_~t.base_3 0)) (not (= v_size_~t.offset_3 0))) (= |v_size_#t~mem27.offset_2| (select (select |v_#memory_$Pointer$.offset_31| v_size_~t.base_3) .cse0)) (= (select (select |v_#memory_$Pointer$.base_31| v_size_~t.base_3) .cse0) |v_size_#t~mem27.base_2|))) InVars {size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_#t~mem27.offset=|v_size_#t~mem27.offset_2|, size_#t~mem27.base=|v_size_#t~mem27.base_2|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} AuxVars[] AssignedVars[size_#t~mem27.offset, size_#t~mem27.base] {2884#true} is VALID [2022-04-27 22:37:06,213 INFO L272 TraceCheckUtils]: 2: Hoare triple {2884#true} [222] L79-->sizeENTRY: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {2884#true} is VALID [2022-04-27 22:37:06,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {2884#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2884#true} is VALID [2022-04-27 22:37:06,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {2884#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2884#true} is VALID [2022-04-27 22:37:06,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {2884#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,214 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2884#true} {2884#true} [294] sizeEXIT-->L79-1: AOR: Formula: (= |v_size_#t~ret28_5| |v_size_#resOutParam_3|) InVars {size_#res=|v_size_#resOutParam_3|} OutVars{size_#t~ret28=|v_size_#t~ret28_5|} AuxVars[] AssignedVars[size_#t~ret28, size_#res] LVA: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {2884#true} is VALID [2022-04-27 22:37:06,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {2884#true} [228] L79-1-->L79-2: Formula: (let ((.cse0 (+ v_size_~t.offset_4 12))) (and (= |v_size_#t~mem29.offset_3| (select (select |v_#memory_$Pointer$.offset_32| v_size_~t.base_4) .cse0)) (= |v_size_#t~mem29.base_3| (select (select |v_#memory_$Pointer$.base_32| v_size_~t.base_4) .cse0)) (<= |v_size_#t~ret28_4| 2147483647) (<= 0 (+ |v_size_#t~ret28_4| 2147483648)))) InVars {size_~t.base=v_size_~t.base_4, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} OutVars{size_~t.base=v_size_~t.base_4, size_#t~mem29.offset=|v_size_#t~mem29.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_#t~mem29.base=|v_size_#t~mem29.base_3|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~mem29.base] {2884#true} is VALID [2022-04-27 22:37:06,214 INFO L272 TraceCheckUtils]: 8: Hoare triple {2884#true} [236] L79-2-->sizeENTRY: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {2884#true} is VALID [2022-04-27 22:37:06,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {2884#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2884#true} is VALID [2022-04-27 22:37:06,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {2884#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2884#true} is VALID [2022-04-27 22:37:06,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {2884#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,214 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2884#true} {2884#true} [295] sizeEXIT-->L79-3: AOR: Formula: (= |v_size_#t~ret30_4| |v_size_#resOutParam_4|) InVars {size_#res=|v_size_#resOutParam_4|} OutVars{size_#t~ret30=|v_size_#t~ret30_4|} AuxVars[] AssignedVars[size_#t~ret30, size_#res] LVA: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {2884#true} is VALID [2022-04-27 22:37:06,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {2884#true} [235] L79-3-->sizeFINAL: Formula: (and (= (+ |v_size_#t~ret30_3| |v_size_#t~ret28_2| 1) |v_size_#res_1|) (<= 0 (+ |v_size_#t~ret30_3| 2147483648)) (<= |v_size_#t~ret30_3| 2147483647)) InVars {size_#t~ret28=|v_size_#t~ret28_2|, size_#t~ret30=|v_size_#t~ret30_3|} OutVars{size_#t~mem29.offset=|v_size_#t~mem29.offset_2|, size_#t~mem29.base=|v_size_#t~mem29.base_2|, size_#t~mem27.offset=|v_size_#t~mem27.offset_1|, size_#res=|v_size_#res_1|, size_#t~mem27.base=|v_size_#t~mem27.base_1|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~ret28, size_#t~mem29.base, size_#t~mem27.offset, size_#t~mem27.base, size_#res, size_#t~ret30] {2884#true} is VALID [2022-04-27 22:37:06,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {2884#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,215 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2884#true} {2904#(not (= task_~t.base 0))} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-27 22:37:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#true} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2884#true} is VALID [2022-04-27 22:37:06,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} [227] L10-->L10-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {2884#true} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2884#true} {2904#(not (= task_~t.base 0))} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-27 22:37:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {2975#(= |#memory_int| |old(#memory_int)|)} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {2884#true} is VALID [2022-04-27 22:37:06,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2884#true} {2904#(not (= task_~t.base 0))} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-27 22:37:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:37:06,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {2976#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {2977#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2022-04-27 22:37:06,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {2977#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {2978#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-27 22:37:06,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {2978#(= |tree_inorder_#in~t.base| 0)} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2978#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-27 22:37:06,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2978#(= |tree_inorder_#in~t.base| 0)} {2904#(not (= task_~t.base 0))} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {2885#false} is VALID [2022-04-27 22:37:06,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {2884#true} [188] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:37:06,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {2949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [190] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_22| 1))) (and (= (select .cse0 1) 0) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_15| 1) 1) (= (select |v_#valid_15| 2) 1) (= (select |v_#length_11| 3) 12) (= |v_#NULL.base_1| 0) (= (select |v_#valid_15| 0) 0) (= (select |v_#length_11| 2) 26) (= (select |v_#valid_15| 3) 1) (= 2 (select |v_#length_11| 1)) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_22|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_22|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_11|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2884#true} is VALID [2022-04-27 22:37:06,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {2884#true} [193] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2884#true} {2884#true} [284] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {2884#true} [189] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,267 INFO L272 TraceCheckUtils]: 5: Hoare triple {2884#true} [192] mainENTRY-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2950#(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-27 22:37:06,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {2950#(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|))} [196] nondet_treeENTRY-->L30: Formula: (and (= (store |v_#length_10| v_nondet_tree_~n~0.base_3 20) |v_#length_9|) (= |v_#valid_13| (store |v_#valid_14| v_nondet_tree_~n~0.base_3 1)) (< v_nondet_tree_~n~0.base_3 |v_#StackHeapBarrier_1|) (= (store |v_#memory_$Pointer$.offset_24| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_$Pointer$.offset_24| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 (select (select |v_#memory_$Pointer$.offset_23| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3))) |v_#memory_$Pointer$.offset_23|) (= (store |v_#memory_$Pointer$.base_24| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_$Pointer$.base_24| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 (select (select |v_#memory_$Pointer$.base_23| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3))) |v_#memory_$Pointer$.base_23|) (= (mod |v_nondet_tree_#t~nondet5_4| 256) 0) (= (store |v_#memory_int_21| v_nondet_tree_~n~0.base_3 (store (select |v_#memory_int_21| v_nondet_tree_~n~0.base_3) v_nondet_tree_~n~0.offset_3 |v_nondet_tree_#t~nondet7_2|)) |v_#memory_int_20|) (= v_nondet_tree_~n~0.offset_3 0) (<= |v_nondet_tree_#t~nondet7_2| 2147483647) (not (= v_nondet_tree_~n~0.base_3 0)) (<= 0 (+ |v_nondet_tree_#t~nondet7_2| 2147483648)) (= (select |v_#valid_14| v_nondet_tree_~n~0.base_3) 0)) InVars {nondet_tree_#t~nondet7=|v_nondet_tree_#t~nondet7_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_4|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_21|, #length=|v_#length_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|} OutVars{nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, nondet_tree_#t~malloc6.base=|v_nondet_tree_#t~malloc6.base_1|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_20|, #length=|v_#length_9|, nondet_tree_#t~malloc6.offset=|v_nondet_tree_#t~malloc6.offset_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|} AuxVars[] AssignedVars[nondet_tree_#t~nondet7, nondet_tree_~n~0.base, #memory_$Pointer$.base, nondet_tree_#t~malloc6.base, nondet_tree_#t~nondet5, nondet_tree_~n~0.offset, #valid, #memory_int, #length, nondet_tree_#t~malloc6.offset, #memory_$Pointer$.offset] {2951#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:06,268 INFO L272 TraceCheckUtils]: 7: Hoare triple {2951#(not (= nondet_tree_~n~0.base 0))} [200] L30-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2950#(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-27 22:37:06,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2884#true} is VALID [2022-04-27 22:37:06,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {2884#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,269 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2884#true} {2951#(not (= nondet_tree_~n~0.base 0))} [286] nondet_treeEXIT-->L30-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_2| |v_nondet_tree_#t~ret8.offset_4|) (= |v_nondet_tree_#res.baseOutParam_2| |v_nondet_tree_#t~ret8.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_2|} OutVars{nondet_tree_#t~ret8.base=|v_nondet_tree_#t~ret8.base_4|, nondet_tree_#t~ret8.offset=|v_nondet_tree_#t~ret8.offset_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret8.offset, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret8.base] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2951#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:06,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {2951#(not (= nondet_tree_~n~0.base 0))} [203] L30-1-->L31: Formula: (let ((.cse0 (+ 4 v_nondet_tree_~n~0.offset_1))) (and (= (store |v_#memory_$Pointer$.base_18| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_$Pointer$.base_18| v_nondet_tree_~n~0.base_1) .cse0 |v_nondet_tree_#t~ret8.base_3|)) |v_#memory_$Pointer$.base_17|) (= |v_#memory_int_14| (store |v_#memory_int_15| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_int_15| v_nondet_tree_~n~0.base_1) .cse0 (select (select |v_#memory_int_14| v_nondet_tree_~n~0.base_1) .cse0)))) (= (store |v_#memory_$Pointer$.offset_18| v_nondet_tree_~n~0.base_1 (store (select |v_#memory_$Pointer$.offset_18| v_nondet_tree_~n~0.base_1) .cse0 |v_nondet_tree_#t~ret8.offset_3|)) |v_#memory_$Pointer$.offset_17|))) InVars {nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_1, #memory_int=|v_#memory_int_15|, nondet_tree_#t~ret8.offset=|v_nondet_tree_#t~ret8.offset_3|, nondet_tree_#t~ret8.base=|v_nondet_tree_#t~ret8.base_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_14|, nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_1} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, nondet_tree_#t~ret8.offset, nondet_tree_#t~ret8.base, #memory_$Pointer$.offset] {2951#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:06,270 INFO L272 TraceCheckUtils]: 12: Hoare triple {2951#(not (= nondet_tree_~n~0.base 0))} [207] L31-->nondet_treeENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2950#(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-27 22:37:06,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {2950#(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|))} [195] nondet_treeENTRY-->nondet_treeFINAL: Formula: (and (= |v_nondet_tree_#res.offset_2| 0) (not (= (mod |v_nondet_tree_#t~nondet5_2| 256) 0)) (= 0 |v_nondet_tree_#res.base_2|)) InVars {nondet_tree_#t~nondet5=|v_nondet_tree_#t~nondet5_2|} OutVars{nondet_tree_#res.base=|v_nondet_tree_#res.base_2|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_2|} AuxVars[] AssignedVars[nondet_tree_#t~nondet5, nondet_tree_#res.base, nondet_tree_#res.offset] {2884#true} is VALID [2022-04-27 22:37:06,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {2884#true} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,270 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2884#true} {2951#(not (= nondet_tree_~n~0.base 0))} [287] nondet_treeEXIT-->L31-1: AOR: Formula: (and (= |v_nondet_tree_#res.offsetOutParam_3| |v_nondet_tree_#t~ret9.offset_4|) (= |v_nondet_tree_#res.baseOutParam_3| |v_nondet_tree_#t~ret9.base_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_3|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_3|} OutVars{nondet_tree_#t~ret9.offset=|v_nondet_tree_#t~ret9.offset_4|, nondet_tree_#t~ret9.base=|v_nondet_tree_#t~ret9.base_4|} AuxVars[] AssignedVars[nondet_tree_#t~ret9.base, nondet_tree_#res.base, nondet_tree_#res.offset, nondet_tree_#t~ret9.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2951#(not (= nondet_tree_~n~0.base 0))} is VALID [2022-04-27 22:37:06,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {2951#(not (= nondet_tree_~n~0.base 0))} [206] L31-1-->nondet_treeFINAL: Formula: (let ((.cse0 (+ 12 v_nondet_tree_~n~0.offset_2))) (and (= v_nondet_tree_~n~0.base_2 |v_nondet_tree_#res.base_1|) (= |v_nondet_tree_#res.offset_1| v_nondet_tree_~n~0.offset_2) (= (store |v_#memory_$Pointer$.offset_22| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_$Pointer$.offset_22| v_nondet_tree_~n~0.base_2) .cse0 |v_nondet_tree_#t~ret9.offset_3|)) |v_#memory_$Pointer$.offset_21|) (= |v_#memory_$Pointer$.base_21| (store |v_#memory_$Pointer$.base_22| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_$Pointer$.base_22| v_nondet_tree_~n~0.base_2) .cse0 |v_nondet_tree_#t~ret9.base_3|))) (= |v_#memory_int_18| (store |v_#memory_int_19| v_nondet_tree_~n~0.base_2 (store (select |v_#memory_int_19| v_nondet_tree_~n~0.base_2) .cse0 (select (select |v_#memory_int_18| v_nondet_tree_~n~0.base_2) .cse0)))))) InVars {nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_22|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_2, #memory_int=|v_#memory_int_19|, nondet_tree_#t~ret9.base=|v_nondet_tree_#t~ret9.base_3|, nondet_tree_#t~ret9.offset=|v_nondet_tree_#t~ret9.offset_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_22|} OutVars{nondet_tree_~n~0.base=v_nondet_tree_~n~0.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_21|, nondet_tree_~n~0.offset=v_nondet_tree_~n~0.offset_2, #memory_int=|v_#memory_int_18|, nondet_tree_#res.base=|v_nondet_tree_#res.base_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offset_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_21|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, nondet_tree_#res.base, nondet_tree_#t~ret9.base, nondet_tree_#res.offset, nondet_tree_#t~ret9.offset, #memory_$Pointer$.offset] {2958#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-27 22:37:06,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {2958#(not (= |nondet_tree_#res.base| 0))} [199] nondet_treeFINAL-->nondet_treeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2958#(not (= |nondet_tree_#res.base| 0))} is VALID [2022-04-27 22:37:06,272 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2958#(not (= |nondet_tree_#res.base| 0))} {2884#true} [285] nondet_treeEXIT-->L105: AOR: Formula: (and (= |v_main_#t~ret44.base_4| |v_nondet_tree_#res.baseOutParam_1|) (= |v_nondet_tree_#res.offsetOutParam_1| |v_main_#t~ret44.offset_4|)) InVars {nondet_tree_#res.base=|v_nondet_tree_#res.baseOutParam_1|, nondet_tree_#res.offset=|v_nondet_tree_#res.offsetOutParam_1|} OutVars{main_#t~ret44.offset=|v_main_#t~ret44.offset_4|, main_#t~ret44.base=|v_main_#t~ret44.base_4|} AuxVars[] AssignedVars[main_#t~ret44.offset, main_#t~ret44.base, nondet_tree_#res.base, nondet_tree_#res.offset] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2902#(not (= |main_#t~ret44.base| 0))} is VALID [2022-04-27 22:37:06,272 INFO L272 TraceCheckUtils]: 19: Hoare triple {2902#(not (= |main_#t~ret44.base| 0))} [194] L105-->taskENTRY: Formula: (and (= |v_main_#t~ret44.base_5| |v_task_#in~t.baseInParam_1|) (= |v_main_#t~ret44.offset_5| |v_task_#in~t.offsetInParam_1|)) InVars {main_#t~ret44.offset=|v_main_#t~ret44.offset_5|, main_#t~ret44.base=|v_main_#t~ret44.base_5|} OutVars{task_#in~t.base=|v_task_#in~t.baseInParam_1|, task_#in~t.offset=|v_task_#in~t.offsetInParam_1|} AuxVars[] AssignedVars[task_#in~t.offset, main_#t~ret44.offset, task_#in~t.base, main_#t~ret44.base] {2903#(not (= |task_#in~t.base| 0))} is VALID [2022-04-27 22:37:06,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {2903#(not (= |task_#in~t.base| 0))} [198] taskENTRY-->L83: Formula: (and (= |v_task_#in~t.offset_1| v_task_~t.offset_6) (= v_task_~t.base_6 |v_task_#in~t.base_1|)) InVars {task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|} OutVars{task_~t.offset=v_task_~t.offset_6, task_#in~t.base=|v_task_#in~t.base_1|, task_#in~t.offset=|v_task_#in~t.offset_1|, task_~t.base=v_task_~t.base_6} AuxVars[] AssignedVars[task_~t.offset, task_~t.base] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,273 INFO L272 TraceCheckUtils]: 21: Hoare triple {2904#(not (= task_~t.base 0))} [202] L83-->minENTRY: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {2884#true} is VALID [2022-04-27 22:37:06,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {2884#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {2884#true} is VALID [2022-04-27 22:37:06,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {2884#true} [210] L37-->L40: Formula: (let ((.cse0 (+ v_min_~n.offset_1 4))) (and (= (select (select |v_#memory_$Pointer$.offset_13| v_min_~n.base_1) .cse0) |v_min_#t~mem10.offset_1|) (= (select (select |v_#memory_$Pointer$.base_13| v_min_~n.base_1) .cse0) |v_min_#t~mem10.base_1|) (or (not (= v_min_~n.base_1 0)) (not (= v_min_~n.offset_1 0))))) InVars {min_~n.offset=v_min_~n.offset_1, min_~n.base=v_min_~n.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_13|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_13|} OutVars{min_~n.offset=v_min_~n.offset_1, min_~n.base=v_min_~n.base_1, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_13|, min_#t~mem10.offset=|v_min_#t~mem10.offset_1|, min_#t~mem10.base=|v_min_#t~mem10.base_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_13|} AuxVars[] AssignedVars[min_#t~mem10.offset, min_#t~mem10.base] {2884#true} is VALID [2022-04-27 22:37:06,273 INFO L272 TraceCheckUtils]: 24: Hoare triple {2884#true} [214] L40-->minENTRY: Formula: (and (= |v_min_#in~n.baseInParam_1| |v_min_#t~mem10.base_4|) (= |v_min_#t~mem10.offset_4| |v_min_#in~n.offsetInParam_1|)) InVars {min_#t~mem10.offset=|v_min_#t~mem10.offset_4|, min_#t~mem10.base=|v_min_#t~mem10.base_4|} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_1|, min_#in~n.offset=|v_min_#in~n.offsetInParam_1|} AuxVars[] AssignedVars[min_#in~n.offset, min_#t~mem10.offset, min_#in~n.base, min_#t~mem10.base] {2884#true} is VALID [2022-04-27 22:37:06,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {2884#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {2884#true} is VALID [2022-04-27 22:37:06,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {2884#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {2884#true} is VALID [2022-04-27 22:37:06,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {2884#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,273 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2884#true} {2884#true} [289] minEXIT-->L40-1: AOR: Formula: (= |v_min_#resOutParam_1| |v_min_#t~ret11_4|) InVars {min_#res=|v_min_#resOutParam_1|} OutVars{min_#t~ret11=|v_min_#t~ret11_4|} AuxVars[] AssignedVars[min_#res, min_#t~ret11] LVA: Formula: (and (= |v_min_#in~n.baseInParam_1| |v_min_#t~mem10.base_4|) (= |v_min_#t~mem10.offset_4| |v_min_#in~n.offsetInParam_1|)) InVars {min_#t~mem10.offset=|v_min_#t~mem10.offset_4|, min_#t~mem10.base=|v_min_#t~mem10.base_4|} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_1|, min_#in~n.offset=|v_min_#in~n.offsetInParam_1|} AuxVars[] AssignedVars[min_#in~n.offset, min_#t~mem10.offset, min_#in~n.base, min_#t~mem10.base] {2884#true} is VALID [2022-04-27 22:37:06,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {2884#true} [218] L40-1-->L41: Formula: (let ((.cse0 (+ v_min_~n.offset_2 12))) (and (= v_min_~a~0_1 |v_min_#t~ret11_3|) (<= |v_min_#t~ret11_3| 2147483647) (= (select (select |v_#memory_$Pointer$.offset_14| v_min_~n.base_2) .cse0) |v_min_#t~mem12.offset_1|) (= (select (select |v_#memory_$Pointer$.base_14| v_min_~n.base_2) .cse0) |v_min_#t~mem12.base_1|) (<= 0 (+ |v_min_#t~ret11_3| 2147483648)))) InVars {min_~n.offset=v_min_~n.offset_2, min_~n.base=v_min_~n.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, min_#t~ret11=|v_min_#t~ret11_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|} OutVars{min_~n.offset=v_min_~n.offset_2, min_~n.base=v_min_~n.base_2, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, min_#t~mem12.offset=|v_min_#t~mem12.offset_1|, min_~a~0=v_min_~a~0_1, min_#t~mem10.offset=|v_min_#t~mem10.offset_3|, min_#t~mem10.base=|v_min_#t~mem10.base_3|, min_#t~mem12.base=|v_min_#t~mem12.base_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|} AuxVars[] AssignedVars[min_#t~mem12.offset, min_~a~0, min_#t~mem10.offset, min_#t~mem10.base, min_#t~ret11, min_#t~mem12.base] {2884#true} is VALID [2022-04-27 22:37:06,274 INFO L272 TraceCheckUtils]: 30: Hoare triple {2884#true} [224] L41-->minENTRY: Formula: (and (= |v_min_#in~n.baseInParam_2| |v_min_#t~mem12.base_4|) (= |v_min_#in~n.offsetInParam_2| |v_min_#t~mem12.offset_4|)) InVars {min_#t~mem12.offset=|v_min_#t~mem12.offset_4|, min_#t~mem12.base=|v_min_#t~mem12.base_4|} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_2|, min_#in~n.offset=|v_min_#in~n.offsetInParam_2|} AuxVars[] AssignedVars[min_#t~mem12.offset, min_#in~n.offset, min_#in~n.base, min_#t~mem12.base] {2884#true} is VALID [2022-04-27 22:37:06,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {2884#true} [205] minENTRY-->L37: Formula: (and (= |v_min_#in~n.base_1| v_min_~n.base_3) (= v_min_~n.offset_3 |v_min_#in~n.offset_1|)) InVars {min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} OutVars{min_~n.offset=v_min_~n.offset_3, min_~n.base=v_min_~n.base_3, min_#in~n.base=|v_min_#in~n.base_1|, min_#in~n.offset=|v_min_#in~n.offset_1|} AuxVars[] AssignedVars[min_~n.offset, min_~n.base] {2884#true} is VALID [2022-04-27 22:37:06,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {2884#true} [209] L37-->minFINAL: Formula: (and (= v_min_~n.base_4 0) (= v_min_~n.offset_4 0) (= 2147483647 |v_min_#res_3|)) InVars {min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4} OutVars{min_~n.offset=v_min_~n.offset_4, min_~n.base=v_min_~n.base_4, min_#res=|v_min_#res_3|} AuxVars[] AssignedVars[min_#res] {2884#true} is VALID [2022-04-27 22:37:06,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {2884#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,274 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2884#true} {2884#true} [290] minEXIT-->L41-1: AOR: Formula: (= |v_min_#resOutParam_2| |v_min_#t~ret13_4|) InVars {min_#res=|v_min_#resOutParam_2|} OutVars{min_#t~ret13=|v_min_#t~ret13_4|} AuxVars[] AssignedVars[min_#res, min_#t~ret13] LVA: Formula: (and (= |v_min_#in~n.baseInParam_2| |v_min_#t~mem12.base_4|) (= |v_min_#in~n.offsetInParam_2| |v_min_#t~mem12.offset_4|)) InVars {min_#t~mem12.offset=|v_min_#t~mem12.offset_4|, min_#t~mem12.base=|v_min_#t~mem12.base_4|} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_2|, min_#in~n.offset=|v_min_#in~n.offsetInParam_2|} AuxVars[] AssignedVars[min_#t~mem12.offset, min_#in~n.offset, min_#in~n.base, min_#t~mem12.base] {2884#true} is VALID [2022-04-27 22:37:06,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {2884#true} [223] L41-1-->L42: Formula: (and (<= |v_min_#t~ret13_3| 2147483647) (<= 0 (+ |v_min_#t~ret13_3| 2147483648)) (= v_min_~b~0_1 |v_min_#t~ret13_3|)) InVars {min_#t~ret13=|v_min_#t~ret13_3|} OutVars{min_#t~mem12.offset=|v_min_#t~mem12.offset_3|, min_~b~0=v_min_~b~0_1, min_#t~mem12.base=|v_min_#t~mem12.base_3|} AuxVars[] AssignedVars[min_#t~mem12.offset, min_~b~0, min_#t~mem12.base, min_#t~ret13] {2884#true} is VALID [2022-04-27 22:37:06,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {2884#true} [229] L42-->minFINAL: Formula: (and (<= v_min_~a~0_2 v_min_~b~0_2) (= v_min_~a~0_2 |v_min_#res_1|)) InVars {min_~b~0=v_min_~b~0_2, min_~a~0=v_min_~a~0_2} OutVars{min_#res=|v_min_#res_1|, min_~b~0=v_min_~b~0_2, min_~a~0=v_min_~a~0_2} AuxVars[] AssignedVars[min_#res] {2884#true} is VALID [2022-04-27 22:37:06,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {2884#true} [213] minFINAL-->minEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,275 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2884#true} {2904#(not (= task_~t.base 0))} [291] minEXIT-->L83-1: AOR: Formula: (= |v_min_#resOutParam_3| |v_task_#t~ret31_4|) InVars {min_#res=|v_min_#resOutParam_3|} OutVars{task_#t~ret31=|v_task_#t~ret31_4|} AuxVars[] AssignedVars[task_#t~ret31, min_#res] LVA: Formula: (and (= v_task_~t.base_7 |v_min_#in~n.baseInParam_3|) (= |v_min_#in~n.offsetInParam_3| v_task_~t.offset_7)) InVars {task_~t.offset=v_task_~t.offset_7, task_~t.base=v_task_~t.base_7} OutVars{min_#in~n.base=|v_min_#in~n.baseInParam_3|, min_#in~n.offset=|v_min_#in~n.offsetInParam_3|} AuxVars[] AssignedVars[task_~t.offset, min_#in~n.offset, task_~t.base, min_#in~n.base] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {2904#(not (= task_~t.base 0))} [204] L83-1-->L86: Formula: (and (<= 0 (+ |v_task_#t~ret31_3| 2147483648)) (= (select |v_#valid_17| |v_task_~#b~1.base_1|) 0) (= |v_task_~#b~1.offset_1| 0) (not (= |v_task_~#b~1.base_1| 0)) (<= |v_task_#t~ret31_3| 2147483647) (< |v_#StackHeapBarrier_3| |v_task_~#b~1.base_1|) (= |v_task_#t~ret31_3| v_task_~a~1_1) (= (store |v_#length_13| |v_task_~#b~1.base_1| 4) |v_#length_12|) (= (store |v_#valid_17| |v_task_~#b~1.base_1| 1) |v_#valid_16|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, task_#t~ret31=|v_task_#t~ret31_3|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, task_~#b~1.offset=|v_task_~#b~1.offset_1|, #valid=|v_#valid_16|, task_~#b~1.base=|v_task_~#b~1.base_1|, #length=|v_#length_12|, task_~a~1=v_task_~a~1_1} AuxVars[] AssignedVars[task_#t~ret31, task_~#b~1.offset, #valid, task_~#b~1.base, #length, task_~a~1] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,275 INFO L272 TraceCheckUtils]: 40: Hoare triple {2904#(not (= task_~t.base 0))} [208] L86-->sizeENTRY: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {2884#true} is VALID [2022-04-27 22:37:06,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {2884#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2884#true} is VALID [2022-04-27 22:37:06,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {2884#true} [217] L78-->L79: Formula: (let ((.cse0 (+ v_size_~t.offset_3 4))) (and (or (not (= v_size_~t.base_3 0)) (not (= v_size_~t.offset_3 0))) (= |v_size_#t~mem27.offset_2| (select (select |v_#memory_$Pointer$.offset_31| v_size_~t.base_3) .cse0)) (= (select (select |v_#memory_$Pointer$.base_31| v_size_~t.base_3) .cse0) |v_size_#t~mem27.base_2|))) InVars {size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{size_~t.base=v_size_~t.base_3, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, size_#t~mem27.offset=|v_size_#t~mem27.offset_2|, size_#t~mem27.base=|v_size_#t~mem27.base_2|, size_~t.offset=v_size_~t.offset_3, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} AuxVars[] AssignedVars[size_#t~mem27.offset, size_#t~mem27.base] {2884#true} is VALID [2022-04-27 22:37:06,276 INFO L272 TraceCheckUtils]: 43: Hoare triple {2884#true} [222] L79-->sizeENTRY: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {2884#true} is VALID [2022-04-27 22:37:06,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {2884#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2884#true} is VALID [2022-04-27 22:37:06,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {2884#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2884#true} is VALID [2022-04-27 22:37:06,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {2884#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,276 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2884#true} {2884#true} [294] sizeEXIT-->L79-1: AOR: Formula: (= |v_size_#t~ret28_5| |v_size_#resOutParam_3|) InVars {size_#res=|v_size_#resOutParam_3|} OutVars{size_#t~ret28=|v_size_#t~ret28_5|} AuxVars[] AssignedVars[size_#t~ret28, size_#res] LVA: Formula: (and (= |v_size_#t~mem27.base_4| |v_size_#in~t.baseInParam_3|) (= |v_size_#in~t.offsetInParam_3| |v_size_#t~mem27.offset_4|)) InVars {size_#t~mem27.offset=|v_size_#t~mem27.offset_4|, size_#t~mem27.base=|v_size_#t~mem27.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_3|, size_#in~t.base=|v_size_#in~t.baseInParam_3|} AuxVars[] AssignedVars[size_#in~t.offset, size_#in~t.base, size_#t~mem27.offset, size_#t~mem27.base] {2884#true} is VALID [2022-04-27 22:37:06,276 INFO L290 TraceCheckUtils]: 48: Hoare triple {2884#true} [228] L79-1-->L79-2: Formula: (let ((.cse0 (+ v_size_~t.offset_4 12))) (and (= |v_size_#t~mem29.offset_3| (select (select |v_#memory_$Pointer$.offset_32| v_size_~t.base_4) .cse0)) (= |v_size_#t~mem29.base_3| (select (select |v_#memory_$Pointer$.base_32| v_size_~t.base_4) .cse0)) (<= |v_size_#t~ret28_4| 2147483647) (<= 0 (+ |v_size_#t~ret28_4| 2147483648)))) InVars {size_~t.base=v_size_~t.base_4, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} OutVars{size_~t.base=v_size_~t.base_4, size_#t~mem29.offset=|v_size_#t~mem29.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, size_#t~ret28=|v_size_#t~ret28_4|, size_#t~mem29.base=|v_size_#t~mem29.base_3|, size_~t.offset=v_size_~t.offset_4, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~mem29.base] {2884#true} is VALID [2022-04-27 22:37:06,276 INFO L272 TraceCheckUtils]: 49: Hoare triple {2884#true} [236] L79-2-->sizeENTRY: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {2884#true} is VALID [2022-04-27 22:37:06,276 INFO L290 TraceCheckUtils]: 50: Hoare triple {2884#true} [212] sizeENTRY-->L78: Formula: (and (= v_size_~t.base_1 |v_size_#in~t.base_1|) (= v_size_~t.offset_1 |v_size_#in~t.offset_1|)) InVars {size_#in~t.offset=|v_size_#in~t.offset_1|, size_#in~t.base=|v_size_#in~t.base_1|} OutVars{size_~t.base=v_size_~t.base_1, size_#in~t.offset=|v_size_#in~t.offset_1|, size_~t.offset=v_size_~t.offset_1, size_#in~t.base=|v_size_#in~t.base_1|} AuxVars[] AssignedVars[size_~t.base, size_~t.offset] {2884#true} is VALID [2022-04-27 22:37:06,277 INFO L290 TraceCheckUtils]: 51: Hoare triple {2884#true} [216] L78-->sizeFINAL: Formula: (and (= v_size_~t.base_2 0) (= |v_size_#res_2| 0) (= v_size_~t.offset_2 0)) InVars {size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2} OutVars{size_~t.base=v_size_~t.base_2, size_~t.offset=v_size_~t.offset_2, size_#res=|v_size_#res_2|} AuxVars[] AssignedVars[size_#res] {2884#true} is VALID [2022-04-27 22:37:06,277 INFO L290 TraceCheckUtils]: 52: Hoare triple {2884#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,277 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2884#true} {2884#true} [295] sizeEXIT-->L79-3: AOR: Formula: (= |v_size_#t~ret30_4| |v_size_#resOutParam_4|) InVars {size_#res=|v_size_#resOutParam_4|} OutVars{size_#t~ret30=|v_size_#t~ret30_4|} AuxVars[] AssignedVars[size_#t~ret30, size_#res] LVA: Formula: (and (= |v_size_#in~t.offsetInParam_4| |v_size_#t~mem29.offset_4|) (= |v_size_#t~mem29.base_4| |v_size_#in~t.baseInParam_4|)) InVars {size_#t~mem29.offset=|v_size_#t~mem29.offset_4|, size_#t~mem29.base=|v_size_#t~mem29.base_4|} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_4|, size_#in~t.base=|v_size_#in~t.baseInParam_4|} AuxVars[] AssignedVars[size_#in~t.offset, size_#t~mem29.offset, size_#in~t.base, size_#t~mem29.base] {2884#true} is VALID [2022-04-27 22:37:06,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {2884#true} [235] L79-3-->sizeFINAL: Formula: (and (= (+ |v_size_#t~ret30_3| |v_size_#t~ret28_2| 1) |v_size_#res_1|) (<= 0 (+ |v_size_#t~ret30_3| 2147483648)) (<= |v_size_#t~ret30_3| 2147483647)) InVars {size_#t~ret28=|v_size_#t~ret28_2|, size_#t~ret30=|v_size_#t~ret30_3|} OutVars{size_#t~mem29.offset=|v_size_#t~mem29.offset_2|, size_#t~mem29.base=|v_size_#t~mem29.base_2|, size_#t~mem27.offset=|v_size_#t~mem27.offset_1|, size_#res=|v_size_#res_1|, size_#t~mem27.base=|v_size_#t~mem27.base_1|} AuxVars[] AssignedVars[size_#t~mem29.offset, size_#t~ret28, size_#t~mem29.base, size_#t~mem27.offset, size_#t~mem27.base, size_#res, size_#t~ret30] {2884#true} is VALID [2022-04-27 22:37:06,277 INFO L290 TraceCheckUtils]: 55: Hoare triple {2884#true} [221] sizeFINAL-->sizeEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,277 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2884#true} {2904#(not (= task_~t.base 0))} [292] sizeEXIT-->L86-1: AOR: Formula: (= |v_task_#t~ret32_4| |v_size_#resOutParam_1|) InVars {size_#res=|v_size_#resOutParam_1|} OutVars{task_#t~ret32=|v_task_#t~ret32_4|} AuxVars[] AssignedVars[task_#t~ret32, size_#res] LVA: Formula: (and (= v_task_~t.base_8 |v_size_#in~t.baseInParam_1|) (= |v_size_#in~t.offsetInParam_1| v_task_~t.offset_8)) InVars {task_~t.offset=v_task_~t.offset_8, task_~t.base=v_task_~t.base_8} OutVars{size_#in~t.offset=|v_size_#in~t.offsetInParam_1|, size_#in~t.base=|v_size_#in~t.baseInParam_1|} AuxVars[] AssignedVars[task_~t.offset, size_#in~t.offset, size_#in~t.base, task_~t.base] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,278 INFO L290 TraceCheckUtils]: 57: Hoare triple {2904#(not (= task_~t.base 0))} [211] L86-1-->L87: Formula: (and (= |v_task_#t~ret32_3| v_task_~n~1_1) (<= |v_task_#t~ret32_3| 2147483647) (<= 0 (+ |v_task_#t~ret32_3| 2147483648))) InVars {task_#t~ret32=|v_task_#t~ret32_3|} OutVars{task_~n~1=v_task_~n~1_1} AuxVars[] AssignedVars[task_#t~ret32, task_~n~1] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,278 INFO L272 TraceCheckUtils]: 58: Hoare triple {2904#(not (= task_~t.base 0))} [215] L87-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {2884#true} is VALID [2022-04-27 22:37:06,278 INFO L290 TraceCheckUtils]: 59: Hoare triple {2884#true} [220] assume_abort_if_notENTRY-->L10: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2884#true} is VALID [2022-04-27 22:37:06,278 INFO L290 TraceCheckUtils]: 60: Hoare triple {2884#true} [227] L10-->L10-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {2884#true} [233] L10-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,279 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2884#true} {2904#(not (= task_~t.base 0))} [296] assume_abort_if_notEXIT-->L87-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (not (= v_task_~n~1_9 0)) 1 0)) InVars {task_~n~1=v_task_~n~1_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[task_~n~1, assume_abort_if_not_#in~cond] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,279 INFO L290 TraceCheckUtils]: 63: Hoare triple {2904#(not (= task_~t.base 0))} [219] L87-1-->L88: Formula: (and (not (= |v_task_#t~malloc33.base_1| 0)) (< |v_task_#t~malloc33.base_1| |v_#StackHeapBarrier_4|) (= |v_task_#t~malloc33.offset_1| 0) (= (store |v_#valid_19| |v_task_#t~malloc33.base_1| 1) |v_#valid_18|) (= (select |v_#valid_19| |v_task_#t~malloc33.base_1|) 0) (= (store |v_#length_15| |v_task_#t~malloc33.base_1| (* 4 v_task_~n~1_3)) |v_#length_14|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, task_~n~1=v_task_~n~1_3, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, task_~n~1=v_task_~n~1_3, task_#t~malloc33.base=|v_task_#t~malloc33.base_1|, #valid=|v_#valid_18|, #length=|v_#length_14|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_1|} AuxVars[] AssignedVars[task_#t~malloc33.base, #valid, #length, task_#t~malloc33.offset] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,280 INFO L272 TraceCheckUtils]: 64: Hoare triple {2904#(not (= task_~t.base 0))} [225] L88-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {2975#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 22:37:06,280 INFO L290 TraceCheckUtils]: 65: Hoare triple {2975#(= |#memory_int| |old(#memory_int)|)} [232] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_11| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_10|) InVars {#memory_int=|v_#memory_int_11|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {2884#true} is VALID [2022-04-27 22:37:06,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {2884#true} [238] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2884#true} is VALID [2022-04-27 22:37:06,283 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {2884#true} {2904#(not (= task_~t.base 0))} [297] #Ultimate.meminitEXIT-->L88-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_task_#t~malloc33.base_4|) (= v_task_~n~1_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_task_#t~malloc33.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= (* v_task_~n~1_10 4) |v_#Ultimate.meminit_#productInParam_1|)) InVars {task_~n~1=v_task_~n~1_10, task_#t~malloc33.base=|v_task_#t~malloc33.base_4|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[task_~n~1, #Ultimate.meminit_#sizeOfFields, task_#t~malloc33.base, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, task_#t~malloc33.offset] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,283 INFO L290 TraceCheckUtils]: 68: Hoare triple {2904#(not (= task_~t.base 0))} [231] L88-1-->L89: Formula: (and (= |v_task_#t~malloc33.offset_3| v_task_~x~0.offset_1) (= v_task_~x~0.base_1 |v_task_#t~malloc33.base_3|)) InVars {task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} OutVars{task_~x~0.base=v_task_~x~0.base_1, task_#t~malloc33.base=|v_task_#t~malloc33.base_3|, task_~x~0.offset=v_task_~x~0.offset_1, task_#t~malloc33.offset=|v_task_#t~malloc33.offset_3|} AuxVars[] AssignedVars[task_~x~0.base, task_~x~0.offset] {2904#(not (= task_~t.base 0))} is VALID [2022-04-27 22:37:06,284 INFO L272 TraceCheckUtils]: 69: Hoare triple {2904#(not (= task_~t.base 0))} [237] L89-->tree_inorderENTRY: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {2976#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-27 22:37:06,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {2976#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} [241] tree_inorderENTRY-->L67: Formula: (and (= v_tree_inorder_~i_1 |v_tree_inorder_#in~i_1|) (= v_tree_inorder_~a.base_1 |v_tree_inorder_#in~a.base_1|) (= |v_tree_inorder_#in~t.offset_1| v_tree_inorder_~t.offset_1) (= |v_tree_inorder_#in~a.offset_1| v_tree_inorder_~a.offset_1) (= v_tree_inorder_~t.base_1 |v_tree_inorder_#in~t.base_1|)) InVars {tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~i_1|, tree_inorder_~a.base=v_tree_inorder_~a.base_1, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offset_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_1, tree_inorder_~a.offset=v_tree_inorder_~a.offset_1, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.base_1|, tree_inorder_~t.base=v_tree_inorder_~t.base_1, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.base_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offset_1|, tree_inorder_~i=v_tree_inorder_~i_1} AuxVars[] AssignedVars[tree_inorder_~a.base, tree_inorder_~t.offset, tree_inorder_~a.offset, tree_inorder_~t.base, tree_inorder_~i] {2977#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2022-04-27 22:37:06,285 INFO L290 TraceCheckUtils]: 71: Hoare triple {2977#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} [244] L67-->tree_inorderFINAL: Formula: (and (= v_tree_inorder_~i_2 |v_tree_inorder_#res_1|) (= v_tree_inorder_~t.base_2 0) (= v_tree_inorder_~t.offset_2 0)) InVars {tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} OutVars{tree_inorder_~t.base=v_tree_inorder_~t.base_2, tree_inorder_#res=|v_tree_inorder_#res_1|, tree_inorder_~t.offset=v_tree_inorder_~t.offset_2, tree_inorder_~i=v_tree_inorder_~i_2} AuxVars[] AssignedVars[tree_inorder_#res] {2978#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-27 22:37:06,285 INFO L290 TraceCheckUtils]: 72: Hoare triple {2978#(= |tree_inorder_#in~t.base| 0)} [249] tree_inorderFINAL-->tree_inorderEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2978#(= |tree_inorder_#in~t.base| 0)} is VALID [2022-04-27 22:37:06,286 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {2978#(= |tree_inorder_#in~t.base| 0)} {2904#(not (= task_~t.base 0))} [299] tree_inorderEXIT-->L89-1: AOR: Formula: (= |v_tree_inorder_#resOutParam_1| |v_task_#t~ret34_4|) InVars {tree_inorder_#res=|v_tree_inorder_#resOutParam_1|} OutVars{task_#t~ret34=|v_task_#t~ret34_4|} AuxVars[] AssignedVars[task_#t~ret34, tree_inorder_#res] LVA: Formula: (and (= |v_tree_inorder_#in~a.baseInParam_1| v_task_~x~0.base_5) (= v_task_~t.base_9 |v_tree_inorder_#in~t.baseInParam_1|) (= |v_tree_inorder_#in~a.offsetInParam_1| v_task_~x~0.offset_5) (= |v_tree_inorder_#in~t.offsetInParam_1| v_task_~t.offset_9) (= v_task_~n~1_11 |v_tree_inorder_#in~iInParam_1|)) InVars {task_~t.offset=v_task_~t.offset_9, task_~x~0.base=v_task_~x~0.base_5, task_~n~1=v_task_~n~1_11, task_~t.base=v_task_~t.base_9, task_~x~0.offset=v_task_~x~0.offset_5} OutVars{tree_inorder_#in~i=|v_tree_inorder_#in~iInParam_1|, tree_inorder_#in~a.offset=|v_tree_inorder_#in~a.offsetInParam_1|, tree_inorder_#in~t.base=|v_tree_inorder_#in~t.baseInParam_1|, tree_inorder_#in~t.offset=|v_tree_inorder_#in~t.offsetInParam_1|, tree_inorder_#in~a.base=|v_tree_inorder_#in~a.baseInParam_1|} AuxVars[] AssignedVars[tree_inorder_#in~i, task_~t.offset, tree_inorder_#in~a.offset, task_~x~0.base, task_~n~1, tree_inorder_#in~a.base, tree_inorder_#in~t.base, tree_inorder_#in~t.offset, task_~t.base, task_~x~0.offset] {2885#false} is VALID [2022-04-27 22:37:06,286 INFO L290 TraceCheckUtils]: 74: Hoare triple {2885#false} [240] L89-1-->L90: Formula: (and (= |v_task_#t~mem35_1| (select (select |v_#memory_int_27| v_task_~x~0.base_3) v_task_~x~0.offset_3)) (<= 0 (+ |v_task_#t~ret34_3| 2147483648)) (<= |v_task_#t~ret34_3| 2147483647)) InVars {#memory_int=|v_#memory_int_27|, task_~x~0.base=v_task_~x~0.base_3, task_#t~ret34=|v_task_#t~ret34_3|, task_~x~0.offset=v_task_~x~0.offset_3} OutVars{#memory_int=|v_#memory_int_27|, task_#t~mem35=|v_task_#t~mem35_1|, task_~x~0.base=v_task_~x~0.base_3, task_~x~0.offset=v_task_~x~0.offset_3} AuxVars[] AssignedVars[task_#t~ret34, task_#t~mem35] {2885#false} is VALID [2022-04-27 22:37:06,286 INFO L272 TraceCheckUtils]: 75: Hoare triple {2885#false} [243] L90-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= |v_task_#t~mem35_4| v_task_~a~1_4) 1 0)) InVars {task_#t~mem35=|v_task_#t~mem35_4|, task_~a~1=v_task_~a~1_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, task_#t~mem35, task_~a~1] {2885#false} is VALID [2022-04-27 22:37:06,286 INFO L290 TraceCheckUtils]: 76: Hoare triple {2885#false} [248] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2885#false} is VALID [2022-04-27 22:37:06,286 INFO L290 TraceCheckUtils]: 77: Hoare triple {2885#false} [253] L16-->L16-1: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2885#false} is VALID [2022-04-27 22:37:06,287 INFO L290 TraceCheckUtils]: 78: Hoare triple {2885#false} [259] L16-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2885#false} is VALID [2022-04-27 22:37:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-27 22:37:06,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:37:06,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468390338] [2022-04-27 22:37:06,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468390338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:37:06,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:37:06,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-27 22:37:06,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180521206] [2022-04-27 22:37:06,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:37:06,288 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2022-04-27 22:37:06,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:37:06,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 22:37:06,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:37:06,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 22:37:06,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:37:06,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 22:37:06,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-27 22:37:06,346 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 22:37:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:37:08,418 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2022-04-27 22:37:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 22:37:08,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2022-04-27 22:37:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:37:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 22:37:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 181 transitions. [2022-04-27 22:37:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 22:37:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 181 transitions. [2022-04-27 22:37:08,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 181 transitions. [2022-04-27 22:37:08,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:37:08,601 INFO L225 Difference]: With dead ends: 151 [2022-04-27 22:37:08,601 INFO L226 Difference]: Without dead ends: 98 [2022-04-27 22:37:08,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-04-27 22:37:08,603 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 22:37:08,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 82 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 22:37:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-27 22:37:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-04-27 22:37:08,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:37:08,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-04-27 22:37:08,611 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-04-27 22:37:08,611 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-04-27 22:37:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:37:08,614 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2022-04-27 22:37:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2022-04-27 22:37:08,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:37:08,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:37:08,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) Second operand 98 states. [2022-04-27 22:37:08,616 INFO L87 Difference]: Start difference. First operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) Second operand 98 states. [2022-04-27 22:37:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:37:08,619 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2022-04-27 22:37:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2022-04-27 22:37:08,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:37:08,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:37:08,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:37:08,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:37:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-04-27 22:37:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2022-04-27 22:37:08,624 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 79 [2022-04-27 22:37:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:37:08,624 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2022-04-27 22:37:08,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 22:37:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-27 22:37:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 22:37:08,625 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:37:08,625 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:37:08,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 22:37:08,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:37:08,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:37:08,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1129846937, now seen corresponding path program 1 times [2022-04-27 22:37:08,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:37:08,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154926003] [2022-04-27 22:37:08,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:37:08,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:37:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 22:37:08,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 22:37:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 22:37:08,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 22:37:08,729 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 22:37:08,730 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:37:08,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 22:37:08,734 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 22:37:08,737 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: taskENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: minENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: sizeENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: tree_inorderENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: tree_delENTRY has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:37:08,791 WARN L170 areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: minFINAL has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 22:37:08,792 WARN L170 areAnnotationChecker]: sizeFINAL has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: tree_inorderFINAL has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2022-04-27 22:37:08,793 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: tree_delFINAL has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-04-27 22:37:08,794 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L79-3 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: tree_delEXIT has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 22:37:08,795 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L100-3 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L100-3 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L100-3 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L100-2 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L100-4 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: taskFINAL has no Hoare annotation [2022-04-27 22:37:08,796 WARN L170 areAnnotationChecker]: taskEXIT has no Hoare annotation [2022-04-27 22:37:08,797 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2022-04-27 22:37:08,797 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:37:08,797 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:37:08,797 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:37:08,797 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:37:08,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:37:08 BasicIcfg [2022-04-27 22:37:08,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:37:08,799 INFO L158 Benchmark]: Toolchain (without parser) took 14628.39ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 173.0MB in the beginning and 72.6MB in the end (delta: 100.5MB). Peak memory consumption was 141.9MB. Max. memory is 8.0GB. [2022-04-27 22:37:08,799 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:37:08,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.79ms. Allocated memory is still 201.3MB. Free memory was 172.8MB in the beginning and 167.9MB in the end (delta: 4.9MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2022-04-27 22:37:08,800 INFO L158 Benchmark]: Boogie Preprocessor took 59.24ms. Allocated memory is still 201.3MB. Free memory was 167.9MB in the beginning and 165.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:37:08,800 INFO L158 Benchmark]: RCFGBuilder took 502.43ms. Allocated memory is still 201.3MB. Free memory was 165.1MB in the beginning and 141.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-04-27 22:37:08,800 INFO L158 Benchmark]: IcfgTransformer took 61.61ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 138.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-04-27 22:37:08,802 INFO L158 Benchmark]: TraceAbstraction took 13757.98ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 138.1MB in the beginning and 72.6MB in the end (delta: 65.5MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. [2022-04-27 22:37:08,803 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.11ms. Allocated memory is still 201.3MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.79ms. Allocated memory is still 201.3MB. Free memory was 172.8MB in the beginning and 167.9MB in the end (delta: 4.9MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.24ms. Allocated memory is still 201.3MB. Free memory was 167.9MB in the beginning and 165.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 502.43ms. Allocated memory is still 201.3MB. Free memory was 165.1MB in the beginning and 141.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * IcfgTransformer took 61.61ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 138.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 13757.98ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 138.1MB in the beginning and 72.6MB in the end (delta: 65.5MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L105] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-2:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-2:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-2:0}, n={-2:0}] [L105] RET, EXPR nondet_tree() VAL [nondet_tree()={-2:0}] [L105] CALL task(nondet_tree()) VAL [t={-2:0}] [L83] CALL, EXPR min(t) VAL [n={-2:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-2:0}, n={-2:0}, n->left={0:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={-2:0}, n={-2:0}, n->left={0:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-2:0}, n={-2:0}] [L83] RET, EXPR min(t) VAL [min(t)=2147483647, t={-2:0}, t={-2:0}] [L83] int a = min(t); [L84] int b; VAL [a=2147483647, b={5:0}, t={-2:0}, t={-2:0}] [L86] CALL, EXPR size(t) VAL [t={-2:0}] [L78] COND FALSE !(!t) [L79] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L79] CALL, EXPR size(t->left) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L79] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] CALL, EXPR size(t->right) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-2:0}, t={-2:0}] [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) VAL [\old(cond)=1] [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume_abort_if_not(n != 0) VAL [a=2147483647, b={5:0}, n=1, t={-2:0}, t={-2:0}] [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}] [L88] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}] [L89] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L67] COND FALSE !(!t) [L70] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}] [L70] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L70] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}] [L72] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L72] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L72] i = tree_inorder(t->right, a, i) [L73] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L89] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, tree_inorder(t, x, n)=2, x={-3:0}] [L90] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}, x[0]=0] [L90] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 820 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 765 mSDsluCounter, 405 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 728 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3194 IncrementalHoareTripleChecker+Invalid, 3922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 728 mSolverCounterUnsat, 353 mSDtfsCounter, 3194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 24 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 394 ConstructedInterpolants, 0 QuantifiedInterpolants, 1065 SizeOfPredicates, 4 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 84/90 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 22:37:08,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...