java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/packet_filter_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:34,274 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:34,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:34,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:34,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:34,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:34,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:34,298 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:34,299 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:34,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:34,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:34,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:34,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:34,304 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:34,305 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:34,306 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:34,307 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:34,308 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:34,311 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:34,312 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:34,314 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:34,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:34,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:34,323 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:34,323 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:34,324 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:34,327 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:34,328 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:34,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:34,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:34,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:34,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:34,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:34,337 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:34,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:34,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:34,338 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:00:34,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:34,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:34,364 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:34,364 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:34,365 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:34,365 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:34,366 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:34,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:34,366 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:34,366 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:34,366 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:34,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:34,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:34,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:34,367 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:34,367 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:34,367 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:34,368 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:34,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:34,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:34,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:34,368 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:34,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:34,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:34,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:34,369 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:34,369 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:34,370 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:34,370 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:34,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:34,370 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:34,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:34,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:34,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:34,456 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:34,456 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:34,457 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/packet_filter_true-unreach-call.i [2018-11-23 13:00:34,528 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb96e40a/a5aa94258366416a9077d58e9c720478/FLAG65668d186 [2018-11-23 13:00:35,116 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:35,117 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/packet_filter_true-unreach-call.i [2018-11-23 13:00:35,136 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb96e40a/a5aa94258366416a9077d58e9c720478/FLAG65668d186 [2018-11-23 13:00:35,392 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb96e40a/a5aa94258366416a9077d58e9c720478 [2018-11-23 13:00:35,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:35,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:35,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:35,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:35,411 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:35,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:35" (1/1) ... [2018-11-23 13:00:35,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72581a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:35, skipping insertion in model container [2018-11-23 13:00:35,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:35" (1/1) ... [2018-11-23 13:00:35,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:35,496 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:35,868 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:35,881 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:35,966 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:36,042 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:36,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36 WrapperNode [2018-11-23 13:00:36,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:36,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:36,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:36,044 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:36,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36" (1/1) ... [2018-11-23 13:00:36,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36" (1/1) ... [2018-11-23 13:00:36,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:36,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:36,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:36,163 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:36,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36" (1/1) ... [2018-11-23 13:00:36,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36" (1/1) ... [2018-11-23 13:00:36,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36" (1/1) ... [2018-11-23 13:00:36,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36" (1/1) ... [2018-11-23 13:00:36,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36" (1/1) ... [2018-11-23 13:00:36,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36" (1/1) ... [2018-11-23 13:00:36,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36" (1/1) ... [2018-11-23 13:00:36,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:36,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:36,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:36,232 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:36,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:36,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:00:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:00:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2018-11-23 13:00:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2018-11-23 13:00:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2018-11-23 13:00:36,298 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2018-11-23 13:00:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:36,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:36,298 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-11-23 13:00:36,299 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-11-23 13:00:36,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:36,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2018-11-23 13:00:36,300 INFO L130 BoogieDeclarations]: Found specification of procedure send [2018-11-23 13:00:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:00:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 13:00:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2018-11-23 13:00:36,301 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2018-11-23 13:00:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 13:00:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:37,518 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:37,519 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:00:37,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:37 BoogieIcfgContainer [2018-11-23 13:00:37,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:37,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:37,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:37,524 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:37,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:35" (1/3) ... [2018-11-23 13:00:37,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4700a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:37, skipping insertion in model container [2018-11-23 13:00:37,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:36" (2/3) ... [2018-11-23 13:00:37,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4700a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:37, skipping insertion in model container [2018-11-23 13:00:37,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:37" (3/3) ... [2018-11-23 13:00:37,528 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter_true-unreach-call.i [2018-11-23 13:00:37,538 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:37,547 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 13:00:37,566 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 13:00:37,599 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:37,606 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:37,606 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:37,606 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:37,606 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:37,606 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:37,606 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:37,606 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:37,606 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-23 13:00:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:00:37,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:37,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:37,636 INFO L423 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:37,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash -70149457, now seen corresponding path program 1 times [2018-11-23 13:00:37,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:37,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:37,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:37,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:37,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:37,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {60#true} is VALID [2018-11-23 13:00:37,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {60#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {60#true} is VALID [2018-11-23 13:00:37,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-23 13:00:37,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #135#return; {60#true} is VALID [2018-11-23 13:00:37,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret44 := main(); {60#true} is VALID [2018-11-23 13:00:37,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {60#true} call ~#prio_queue~0.base, ~#prio_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#prio_queue~0.base, ~#prio_queue~0.offset, 4);call ~#normal_queue~0.base, ~#normal_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {60#true} is VALID [2018-11-23 13:00:37,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {60#true} assume !true; {61#false} is VALID [2018-11-23 13:00:37,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {61#false} call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~#prio_queue~0.base, ~#prio_queue~0.offset, 4); {61#false} is VALID [2018-11-23 13:00:37,804 INFO L256 TraceCheckUtils]: 8: Hoare triple {61#false} call process_prio_queue(#t~mem42.base, #t~mem42.offset); {61#false} is VALID [2018-11-23 13:00:37,805 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#false} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~1.base, ~node~1.offset := ~q.base, ~q.offset; {61#false} is VALID [2018-11-23 13:00:37,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#false} assume !!(~node~1.base != 0 || ~node~1.offset != 0);call #t~mem15 := read~int(~node~1.base, 4 + ~node~1.offset, 4);#t~short17 := 1 == #t~mem15 % 4294967296; {61#false} is VALID [2018-11-23 13:00:37,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {61#false} assume #t~short17; {61#false} is VALID [2018-11-23 13:00:37,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {61#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17;havoc #t~mem15; {61#false} is VALID [2018-11-23 13:00:37,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {61#false} assume !false; {61#false} is VALID [2018-11-23 13:00:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:37,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:37,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:00:37,819 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:00:37,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:37,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:00:38,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:38,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:00:38,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:00:38,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:38,050 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-11-23 13:00:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:38,624 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2018-11-23 13:00:38,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:00:38,625 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:00:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2018-11-23 13:00:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2018-11-23 13:00:38,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 110 transitions. [2018-11-23 13:00:39,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:39,272 INFO L225 Difference]: With dead ends: 86 [2018-11-23 13:00:39,272 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:00:39,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:00:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 13:00:39,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:39,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 13:00:39,337 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 13:00:39,338 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 13:00:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:39,346 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-11-23 13:00:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2018-11-23 13:00:39,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:39,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:39,348 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 13:00:39,348 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 13:00:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:39,355 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-11-23 13:00:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2018-11-23 13:00:39,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:39,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:39,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:39,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:00:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2018-11-23 13:00:39,364 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 14 [2018-11-23 13:00:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:39,365 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-11-23 13:00:39,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:00:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2018-11-23 13:00:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:00:39,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:39,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:39,367 INFO L423 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:39,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash 325102647, now seen corresponding path program 1 times [2018-11-23 13:00:39,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:39,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:39,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:39,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:39,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:39,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2018-11-23 13:00:39,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {340#true} is VALID [2018-11-23 13:00:39,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2018-11-23 13:00:39,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #135#return; {340#true} is VALID [2018-11-23 13:00:39,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret44 := main(); {340#true} is VALID [2018-11-23 13:00:39,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {340#true} call ~#prio_queue~0.base, ~#prio_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#prio_queue~0.base, ~#prio_queue~0.offset, 4);call ~#normal_queue~0.base, ~#normal_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {340#true} is VALID [2018-11-23 13:00:39,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {340#true} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {340#true} is VALID [2018-11-23 13:00:39,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {340#true} assume !(0 != #t~nondet28);havoc #t~nondet28; {340#true} is VALID [2018-11-23 13:00:39,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {340#true} call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~#prio_queue~0.base, ~#prio_queue~0.offset, 4); {340#true} is VALID [2018-11-23 13:00:39,465 INFO L256 TraceCheckUtils]: 9: Hoare triple {340#true} call process_prio_queue(#t~mem42.base, #t~mem42.offset); {340#true} is VALID [2018-11-23 13:00:39,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {340#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~1.base, ~node~1.offset := ~q.base, ~q.offset; {340#true} is VALID [2018-11-23 13:00:39,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {340#true} assume !!(~node~1.base != 0 || ~node~1.offset != 0);call #t~mem15 := read~int(~node~1.base, 4 + ~node~1.offset, 4);#t~short17 := 1 == #t~mem15 % 4294967296; {340#true} is VALID [2018-11-23 13:00:39,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {340#true} assume #t~short17; {342#|process_prio_queue_#t~short17|} is VALID [2018-11-23 13:00:39,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {342#|process_prio_queue_#t~short17|} assume !#t~short17;havoc #t~mem16;havoc #t~short17;havoc #t~mem15; {341#false} is VALID [2018-11-23 13:00:39,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {341#false} assume !false; {341#false} is VALID [2018-11-23 13:00:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:39,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:39,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:00:39,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 13:00:39,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:39,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:00:39,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:39,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:00:39,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:00:39,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:00:39,529 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 3 states. [2018-11-23 13:00:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:39,850 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-23 13:00:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:00:39,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 13:00:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:00:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 13:00:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:00:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 13:00:39,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-11-23 13:00:40,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:40,031 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:00:40,032 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:00:40,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:00:40,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:00:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 13:00:40,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:40,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 13:00:40,069 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 13:00:40,069 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 13:00:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:40,075 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 13:00:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-23 13:00:40,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:40,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:40,076 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 13:00:40,077 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 13:00:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:40,082 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 13:00:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-23 13:00:40,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:40,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:40,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:40,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:00:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2018-11-23 13:00:40,092 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 15 [2018-11-23 13:00:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:40,093 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2018-11-23 13:00:40,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:00:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-23 13:00:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:00:40,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:40,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:40,094 INFO L423 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:40,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:40,095 INFO L82 PathProgramCache]: Analyzing trace with hash 325104569, now seen corresponding path program 1 times [2018-11-23 13:00:40,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:40,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:40,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:40,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:40,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:40,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2018-11-23 13:00:40,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {585#true} is VALID [2018-11-23 13:00:40,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2018-11-23 13:00:40,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #135#return; {585#true} is VALID [2018-11-23 13:00:40,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret44 := main(); {585#true} is VALID [2018-11-23 13:00:40,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {585#true} call ~#prio_queue~0.base, ~#prio_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#prio_queue~0.base, ~#prio_queue~0.offset, 4);call ~#normal_queue~0.base, ~#normal_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {587#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:40,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {587#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {587#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:40,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {587#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} assume !(0 != #t~nondet28);havoc #t~nondet28; {587#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:40,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {587#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~#prio_queue~0.base, ~#prio_queue~0.offset, 4); {588#(and (= 0 |main_#t~mem42.offset|) (= 0 |main_#t~mem42.base|))} is VALID [2018-11-23 13:00:40,359 INFO L256 TraceCheckUtils]: 9: Hoare triple {588#(and (= 0 |main_#t~mem42.offset|) (= 0 |main_#t~mem42.base|))} call process_prio_queue(#t~mem42.base, #t~mem42.offset); {589#(and (= 0 |process_prio_queue_#in~q.offset|) (= 0 |process_prio_queue_#in~q.base|))} is VALID [2018-11-23 13:00:40,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {589#(and (= 0 |process_prio_queue_#in~q.offset|) (= 0 |process_prio_queue_#in~q.base|))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~1.base, ~node~1.offset := ~q.base, ~q.offset; {590#(and (= process_prio_queue_~node~1.offset 0) (= 0 process_prio_queue_~node~1.base))} is VALID [2018-11-23 13:00:40,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {590#(and (= process_prio_queue_~node~1.offset 0) (= 0 process_prio_queue_~node~1.base))} assume !!(~node~1.base != 0 || ~node~1.offset != 0);call #t~mem15 := read~int(~node~1.base, 4 + ~node~1.offset, 4);#t~short17 := 1 == #t~mem15 % 4294967296; {586#false} is VALID [2018-11-23 13:00:40,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {586#false} assume !#t~short17;call #t~mem16 := read~int(~node~1.base, ~node~1.offset, 4);#t~short17 := #t~mem16 % 4294967296 < 500; {586#false} is VALID [2018-11-23 13:00:40,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {586#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17;havoc #t~mem15; {586#false} is VALID [2018-11-23 13:00:40,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-11-23 13:00:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:40,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:40,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:00:40,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:00:40,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:40,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:00:40,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:40,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:00:40,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:00:40,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:40,403 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 6 states. [2018-11-23 13:00:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,298 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-11-23 13:00:41,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:00:41,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:00:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2018-11-23 13:00:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2018-11-23 13:00:41,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2018-11-23 13:00:41,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:41,544 INFO L225 Difference]: With dead ends: 82 [2018-11-23 13:00:41,544 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 13:00:41,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:00:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 13:00:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-11-23 13:00:41,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:41,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 59 states. [2018-11-23 13:00:41,578 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 59 states. [2018-11-23 13:00:41,579 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 59 states. [2018-11-23 13:00:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,584 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-23 13:00:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-23 13:00:41,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:41,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:41,585 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 62 states. [2018-11-23 13:00:41,586 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 62 states. [2018-11-23 13:00:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:41,590 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-23 13:00:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-23 13:00:41,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:41,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:41,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:41,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:00:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-23 13:00:41,596 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 15 [2018-11-23 13:00:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:41,596 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-23 13:00:41,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:00:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-23 13:00:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:00:41,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:41,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:41,598 INFO L423 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:41,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:41,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1323640266, now seen corresponding path program 1 times [2018-11-23 13:00:41,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:41,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:41,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:41,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:41,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:41,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {910#true} call ULTIMATE.init(); {910#true} is VALID [2018-11-23 13:00:41,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {910#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {910#true} is VALID [2018-11-23 13:00:41,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {910#true} assume true; {910#true} is VALID [2018-11-23 13:00:41,768 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {910#true} {910#true} #135#return; {910#true} is VALID [2018-11-23 13:00:41,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {910#true} call #t~ret44 := main(); {910#true} is VALID [2018-11-23 13:00:41,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {910#true} call ~#prio_queue~0.base, ~#prio_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#prio_queue~0.base, ~#prio_queue~0.offset, 4);call ~#normal_queue~0.base, ~#normal_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {912#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:00:41,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {912#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {912#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:00:41,776 INFO L273 TraceCheckUtils]: 7: Hoare triple {912#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} assume !(0 != #t~nondet28);havoc #t~nondet28; {912#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:00:41,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {912#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~#prio_queue~0.base, ~#prio_queue~0.offset, 4); {912#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:00:41,778 INFO L256 TraceCheckUtils]: 9: Hoare triple {912#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} call process_prio_queue(#t~mem42.base, #t~mem42.offset); {910#true} is VALID [2018-11-23 13:00:41,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {910#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~1.base, ~node~1.offset := ~q.base, ~q.offset; {910#true} is VALID [2018-11-23 13:00:41,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {910#true} assume !(~node~1.base != 0 || ~node~1.offset != 0); {910#true} is VALID [2018-11-23 13:00:41,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {910#true} assume true; {910#true} is VALID [2018-11-23 13:00:41,784 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {910#true} {912#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} #131#return; {912#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:00:41,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {912#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {913#(and (= 0 |main_#t~mem43.offset|) (= 0 |main_#t~mem43.base|))} is VALID [2018-11-23 13:00:41,786 INFO L256 TraceCheckUtils]: 15: Hoare triple {913#(and (= 0 |main_#t~mem43.offset|) (= 0 |main_#t~mem43.base|))} call process_normal_queue(#t~mem43.base, #t~mem43.offset); {914#(and (= 0 |process_normal_queue_#in~q.offset|) (= 0 |process_normal_queue_#in~q.base|))} is VALID [2018-11-23 13:00:41,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {914#(and (= 0 |process_normal_queue_#in~q.offset|) (= 0 |process_normal_queue_#in~q.base|))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~2.base, ~node~2.offset := ~q.base, ~q.offset; {915#(and (= 0 process_normal_queue_~node~2.base) (= 0 process_normal_queue_~node~2.offset))} is VALID [2018-11-23 13:00:41,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {915#(and (= 0 process_normal_queue_~node~2.base) (= 0 process_normal_queue_~node~2.offset))} assume !!(~node~2.base != 0 || ~node~2.offset != 0);call #t~mem22 := read~int(~node~2.base, 4 + ~node~2.offset, 4);#t~short24 := 0 == #t~mem22 % 4294967296; {911#false} is VALID [2018-11-23 13:00:41,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {911#false} assume #t~short24;call #t~mem23 := read~int(~node~2.base, ~node~2.offset, 4);#t~short24 := #t~mem23 % 4294967296 >= 500; {911#false} is VALID [2018-11-23 13:00:41,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {911#false} assume !#t~short24;havoc #t~mem22;havoc #t~mem23;havoc #t~short24; {911#false} is VALID [2018-11-23 13:00:41,789 INFO L273 TraceCheckUtils]: 20: Hoare triple {911#false} assume !false; {911#false} is VALID [2018-11-23 13:00:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:41,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:41,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:00:41,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:00:41,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:41,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:00:41,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:41,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:00:41,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:00:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:41,826 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 6 states. [2018-11-23 13:00:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,719 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2018-11-23 13:00:42,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:00:42,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:00:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2018-11-23 13:00:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2018-11-23 13:00:42,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2018-11-23 13:00:42,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:42,877 INFO L225 Difference]: With dead ends: 71 [2018-11-23 13:00:42,877 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 13:00:42,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:00:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 13:00:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 13:00:42,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:42,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-23 13:00:42,906 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-23 13:00:42,906 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-23 13:00:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,910 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 13:00:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 13:00:42,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:42,911 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-23 13:00:42,911 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-23 13:00:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:42,915 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 13:00:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 13:00:42,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:42,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:42,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:42,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:00:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-23 13:00:42,920 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-11-23 13:00:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:42,921 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-23 13:00:42,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:00:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-23 13:00:42,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:00:42,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:42,922 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:00:42,923 INFO L423 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:42,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:42,923 INFO L82 PathProgramCache]: Analyzing trace with hash 861249640, now seen corresponding path program 1 times [2018-11-23 13:00:42,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:42,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:42,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:42,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:42,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:43,355 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 13:00:43,788 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 13:00:43,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2018-11-23 13:00:43,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {1198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1198#true} is VALID [2018-11-23 13:00:43,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-23 13:00:43,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #135#return; {1198#true} is VALID [2018-11-23 13:00:43,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret44 := main(); {1198#true} is VALID [2018-11-23 13:00:43,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {1198#true} call ~#prio_queue~0.base, ~#prio_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#prio_queue~0.base, ~#prio_queue~0.offset, 4);call ~#normal_queue~0.base, ~#normal_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {1200#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} is VALID [2018-11-23 13:00:43,920 INFO L273 TraceCheckUtils]: 6: Hoare triple {1200#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {1200#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} is VALID [2018-11-23 13:00:43,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {1200#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} assume !!(0 != #t~nondet28);havoc #t~nondet28;call ~#new_packet~0.base, ~#new_packet~0.offset := #Ultimate.alloc(12); {1200#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} is VALID [2018-11-23 13:00:43,924 INFO L256 TraceCheckUtils]: 8: Hoare triple {1200#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} call #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset := receive(); {1201#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:43,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {1201#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ~#packet~0.base, ~#packet~0.offset := #Ultimate.alloc(12);call write~int(#t~nondet2, ~#packet~0.base, ~#packet~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1202#(and (= (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (select |#memory_$Pointer$.base| |receive_~#packet~0.base|))) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} is VALID [2018-11-23 13:00:43,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {1202#(and (= (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (select |#memory_$Pointer$.base| |receive_~#packet~0.base|))) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} assume 0 != #t~nondet3;#t~ite4 := 0; {1202#(and (= (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (select |#memory_$Pointer$.base| |receive_~#packet~0.base|))) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} is VALID [2018-11-23 13:00:43,934 INFO L273 TraceCheckUtils]: 11: Hoare triple {1202#(and (= (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (select |#memory_$Pointer$.base| |receive_~#packet~0.base|))) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} call write~int(#t~ite4, ~#packet~0.base, 4 + ~#packet~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call #t~ret5.base, #t~ret5.offset := __VERIFIER_nondet_charp();call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~#packet~0.base, 8 + ~#packet~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call #t~mem6 := read~int(~#packet~0.base, ~#packet~0.offset, 4);call #t~mem7 := read~int(~#packet~0.base, 4 + ~#packet~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#packet~0.base, 8 + ~#packet~0.offset, 4);#res.size, #res.prio, #res.payload.base, #res.payload.offset := #t~mem6, #t~mem7, #t~mem8.base, #t~mem8.offset;havoc #t~mem7;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem6;call ULTIMATE.dealloc(~#packet~0.base, ~#packet~0.offset);havoc ~#packet~0.base, ~#packet~0.offset; {1203#(and (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (store (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))))} is VALID [2018-11-23 13:00:43,939 INFO L273 TraceCheckUtils]: 12: Hoare triple {1203#(and (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (store (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))))} assume true; {1203#(and (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (store (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))))} is VALID [2018-11-23 13:00:43,947 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1203#(and (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (store (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))))} {1200#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} #123#return; {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:43,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} call write~init~int(#t~ret29.size, ~#new_packet~0.base, ~#new_packet~0.offset, 4);call write~init~int(#t~ret29.prio, ~#new_packet~0.base, 4 + ~#new_packet~0.offset, 4);call write~init~$Pointer$(#t~ret29.payload.base, #t~ret29.payload.offset, ~#new_packet~0.base, 8 + ~#new_packet~0.offset, 4);havoc #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset;call #t~mem30 := read~int(~#new_packet~0.base, ~#new_packet~0.offset, 4); {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:43,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} assume !(#t~mem30 % 4294967296 > 0);havoc #t~mem30; {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:43,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} call ULTIMATE.dealloc(~#new_packet~0.base, ~#new_packet~0.offset);havoc ~#new_packet~0.base, ~#new_packet~0.offset; {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:43,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:43,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} assume !(0 != #t~nondet28);havoc #t~nondet28; {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:43,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~#prio_queue~0.base, ~#prio_queue~0.offset, 4); {1205#(and (= 0 |main_#t~mem42.offset|) (= 0 |main_#t~mem42.base|))} is VALID [2018-11-23 13:00:43,954 INFO L256 TraceCheckUtils]: 20: Hoare triple {1205#(and (= 0 |main_#t~mem42.offset|) (= 0 |main_#t~mem42.base|))} call process_prio_queue(#t~mem42.base, #t~mem42.offset); {1206#(and (= 0 |process_prio_queue_#in~q.offset|) (= 0 |process_prio_queue_#in~q.base|))} is VALID [2018-11-23 13:00:43,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {1206#(and (= 0 |process_prio_queue_#in~q.offset|) (= 0 |process_prio_queue_#in~q.base|))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~1.base, ~node~1.offset := ~q.base, ~q.offset; {1207#(and (= process_prio_queue_~node~1.offset 0) (= 0 process_prio_queue_~node~1.base))} is VALID [2018-11-23 13:00:43,956 INFO L273 TraceCheckUtils]: 22: Hoare triple {1207#(and (= process_prio_queue_~node~1.offset 0) (= 0 process_prio_queue_~node~1.base))} assume !!(~node~1.base != 0 || ~node~1.offset != 0);call #t~mem15 := read~int(~node~1.base, 4 + ~node~1.offset, 4);#t~short17 := 1 == #t~mem15 % 4294967296; {1199#false} is VALID [2018-11-23 13:00:43,957 INFO L273 TraceCheckUtils]: 23: Hoare triple {1199#false} assume !#t~short17;call #t~mem16 := read~int(~node~1.base, ~node~1.offset, 4);#t~short17 := #t~mem16 % 4294967296 < 500; {1199#false} is VALID [2018-11-23 13:00:43,957 INFO L273 TraceCheckUtils]: 24: Hoare triple {1199#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17;havoc #t~mem15; {1199#false} is VALID [2018-11-23 13:00:43,958 INFO L273 TraceCheckUtils]: 25: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2018-11-23 13:00:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:43,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:43,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:43,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:44,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:44,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:44,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 13:00:44,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 13:00:44,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:44,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:44,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:44,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-11-23 13:00:46,446 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:46,446 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_33|, |main_~#normal_queue~0.base|]. (let ((.cse0 (store |v_#valid_33| |main_~#prio_queue~0.base| 1))) (and (= |#valid| (store .cse0 |main_~#normal_queue~0.base| 1)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= (select .cse0 |main_~#normal_queue~0.base|) 0))) [2018-11-23 13:00:46,447 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#normal_queue~0.base|]. (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= (select |#valid| |main_~#prio_queue~0.base|) 1)) [2018-11-23 13:00:46,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 13:00:46,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:46,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:46,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:34 [2018-11-23 13:00:46,780 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:46,781 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_34|, |main_~#new_packet~0.base|, |main_~#normal_queue~0.base|]. (and (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)) (= |#valid| (store |v_#valid_34| |main_~#new_packet~0.base| 1)) (= 1 (select |v_#valid_34| |main_~#prio_queue~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= (select |v_#valid_34| |main_~#normal_queue~0.base|) 1)) [2018-11-23 13:00:46,781 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#normal_queue~0.base|, |main_~#new_packet~0.base|]. (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 1 (select |#valid| |main_~#new_packet~0.base|)) (= (select |#valid| |main_~#prio_queue~0.base|) 1)) [2018-11-23 13:00:47,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:47,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:47,238 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:47,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:47,292 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:47,297 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:47,336 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:47,344 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:47,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:47,367 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-11-23 13:00:47,829 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:47,829 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_41|, |v_receive_~#packet~0.base_4|, |v_receive_~#packet~0.offset_4|, |v_receive_#t~ret5.base_4|, |v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.offset_41|, |v_receive_#t~ret5.offset_4|]. (let ((.cse0 (select |v_#memory_$Pointer$.base_41| |v_receive_~#packet~0.base_4|)) (.cse2 (select |v_#memory_$Pointer$.base_43| |v_receive_~#packet~0.base_4|)) (.cse1 (+ |v_receive_~#packet~0.offset_4| 8)) (.cse4 (select |v_#memory_$Pointer$.offset_43| |v_receive_~#packet~0.base_4|)) (.cse5 (select |v_#memory_$Pointer$.offset_41| |v_receive_~#packet~0.base_4|)) (.cse3 (+ |v_receive_~#packet~0.offset_4| 4))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_41| |v_receive_~#packet~0.base_4| (store .cse0 .cse1 |v_receive_#t~ret5.base_4|))) (= (store |v_#memory_$Pointer$.base_43| |v_receive_~#packet~0.base_4| (store .cse2 .cse3 (select .cse0 .cse3))) |v_#memory_$Pointer$.base_41|) (= |v_#memory_$Pointer$.base_43| (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| (select .cse2 |v_receive_~#packet~0.offset_4|)))) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_4|)) (= (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| (select .cse4 |v_receive_~#packet~0.offset_4|))) |v_#memory_$Pointer$.offset_43|) (= (store |v_#memory_$Pointer$.offset_41| |v_receive_~#packet~0.base_4| (store .cse5 .cse1 |v_receive_#t~ret5.offset_4|)) |#memory_$Pointer$.offset|) (= (store |v_#memory_$Pointer$.offset_43| |v_receive_~#packet~0.base_4| (store .cse4 .cse3 (select .cse5 .cse3))) |v_#memory_$Pointer$.offset_41|))) [2018-11-23 13:00:47,830 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|v_receive_~#packet~0.base_4|, |v_receive_~#packet~0.offset_4|, v_DerPreprocessor_2, v_DerPreprocessor_8, |v_receive_#t~ret5.offset_4|, v_DerPreprocessor_6, v_DerPreprocessor_4, |v_receive_#t~ret5.base_4|]. (let ((.cse0 (+ |v_receive_~#packet~0.offset_4| 4)) (.cse1 (+ |v_receive_~#packet~0.offset_4| 8))) (and (= (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (store (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_8) .cse1 |v_receive_#t~ret5.offset_4|)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_4|)) (= (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (store (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_6) .cse0 v_DerPreprocessor_4) .cse1 |v_receive_#t~ret5.base_4|)) |#memory_$Pointer$.base|))) [2018-11-23 13:00:52,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:52,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:52,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:52,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 13:00:52,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-23 13:00:52,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 13:00:52,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:52,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-11-23 13:00:52,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:52,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:52,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:52,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-23 13:00:52,289 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,306 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,337 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-23 13:00:52,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 13:00:52,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:52,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-11-23 13:00:52,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:52,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:52,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:52,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-23 13:00:52,427 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,458 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,539 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,562 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,599 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:76, output treesize:15 [2018-11-23 13:00:52,607 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:52,607 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_1|, |v_receive_~#packet~0.base_4|, |v_receive_~#packet~0.offset_4|, v_DerPreprocessor_6, v_DerPreprocessor_4, |v_receive_#t~ret5.base_4|, |main_~#normal_queue~0.base|, |v_old(#memory_$Pointer$.offset)_AFTER_CALL_1|, |v_old(#valid)_AFTER_CALL_2|, v_DerPreprocessor_2, v_DerPreprocessor_8, |v_receive_#t~ret5.offset_4|]. (let ((.cse0 (+ |v_receive_~#packet~0.offset_4| 4)) (.cse1 (+ |v_receive_~#packet~0.offset_4| 8))) (and (= |#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| |v_receive_~#packet~0.base_4| (store (store (store (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_6) .cse0 v_DerPreprocessor_4) .cse1 |v_receive_#t~ret5.base_4|))) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_1| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= (select |v_old(#valid)_AFTER_CALL_2| |main_~#prio_queue~0.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_2| |v_receive_~#packet~0.base_4|)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_1| |v_receive_~#packet~0.base_4| (store (store (store (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_1| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_8) .cse1 |v_receive_#t~ret5.offset_4|)) |#memory_$Pointer$.offset|) (= 1 (select |v_old(#valid)_AFTER_CALL_2| |main_~#normal_queue~0.base|)) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0))) [2018-11-23 13:00:52,608 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|))) [2018-11-23 13:00:52,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:00:52,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:00:52,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:00:52,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:00:52,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:52,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-23 13:00:52,725 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:52,726 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, |main_~#prio_queue~0.base|, |main_~#prio_queue~0.offset|, |#memory_$Pointer$.base|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|))) (and (= .cse0 |main_#t~mem42.offset|) (= .cse1 |main_#t~mem42.base|) (= 0 .cse1) (= 0 .cse0))) [2018-11-23 13:00:52,726 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |main_#t~mem42.offset|) (= 0 |main_#t~mem42.base|)) [2018-11-23 13:00:52,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2018-11-23 13:00:52,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {1198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1198#true} is VALID [2018-11-23 13:00:52,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-23 13:00:52,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #135#return; {1198#true} is VALID [2018-11-23 13:00:52,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret44 := main(); {1198#true} is VALID [2018-11-23 13:00:52,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {1198#true} call ~#prio_queue~0.base, ~#prio_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#prio_queue~0.base, ~#prio_queue~0.offset, 4);call ~#normal_queue~0.base, ~#normal_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {1226#(and (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (exists ((|main_~#normal_queue~0.base| Int)) (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)))) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} is VALID [2018-11-23 13:00:52,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {1226#(and (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (exists ((|main_~#normal_queue~0.base| Int)) (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)))) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {1226#(and (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (exists ((|main_~#normal_queue~0.base| Int)) (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)))) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} is VALID [2018-11-23 13:00:52,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {1226#(and (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (exists ((|main_~#normal_queue~0.base| Int)) (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)))) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} assume !!(0 != #t~nondet28);havoc #t~nondet28;call ~#new_packet~0.base, ~#new_packet~0.offset := #Ultimate.alloc(12); {1226#(and (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (exists ((|main_~#normal_queue~0.base| Int)) (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)))) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} is VALID [2018-11-23 13:00:52,838 INFO L256 TraceCheckUtils]: 8: Hoare triple {1226#(and (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (exists ((|main_~#normal_queue~0.base| Int)) (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)))) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} call #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset := receive(); {1201#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:52,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {1201#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ~#packet~0.base, ~#packet~0.offset := #Ultimate.alloc(12);call write~int(#t~nondet2, ~#packet~0.base, ~#packet~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1239#(and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|) |receive_~#packet~0.offset|)))) (= (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.base)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.base| |receive_~#packet~0.base|) |receive_~#packet~0.offset|))) |#memory_$Pointer$.base|) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} is VALID [2018-11-23 13:00:52,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {1239#(and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|) |receive_~#packet~0.offset|)))) (= (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.base)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.base| |receive_~#packet~0.base|) |receive_~#packet~0.offset|))) |#memory_$Pointer$.base|) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} assume 0 != #t~nondet3;#t~ite4 := 0; {1239#(and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|) |receive_~#packet~0.offset|)))) (= (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.base)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.base| |receive_~#packet~0.base|) |receive_~#packet~0.offset|))) |#memory_$Pointer$.base|) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} is VALID [2018-11-23 13:00:52,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {1239#(and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|) |receive_~#packet~0.offset|)))) (= (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.base)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.base| |receive_~#packet~0.base|) |receive_~#packet~0.offset|))) |#memory_$Pointer$.base|) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} call write~int(#t~ite4, ~#packet~0.base, 4 + ~#packet~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call #t~ret5.base, #t~ret5.offset := __VERIFIER_nondet_charp();call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~#packet~0.base, 8 + ~#packet~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call #t~mem6 := read~int(~#packet~0.base, ~#packet~0.offset, 4);call #t~mem7 := read~int(~#packet~0.base, 4 + ~#packet~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#packet~0.base, 8 + ~#packet~0.offset, 4);#res.size, #res.prio, #res.payload.base, #res.payload.offset := #t~mem6, #t~mem7, #t~mem8.base, #t~mem8.offset;havoc #t~mem7;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem6;call ULTIMATE.dealloc(~#packet~0.base, ~#packet~0.offset);havoc ~#packet~0.base, ~#packet~0.offset; {1246#(exists ((|v_receive_#t~ret5.offset_4| Int) (|v_receive_~#packet~0.offset_4| Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_6 Int) (|v_receive_~#packet~0.base_4| Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int) (|v_receive_#t~ret5.base_4| Int)) (and (= (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (store (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_2) (+ |v_receive_~#packet~0.offset_4| 4) v_DerPreprocessor_8) (+ |v_receive_~#packet~0.offset_4| 8) |v_receive_#t~ret5.offset_4|)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_4|)) (= (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (store (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_6) (+ |v_receive_~#packet~0.offset_4| 4) v_DerPreprocessor_4) (+ |v_receive_~#packet~0.offset_4| 8) |v_receive_#t~ret5.base_4|)) |#memory_$Pointer$.base|)))} is VALID [2018-11-23 13:00:52,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {1246#(exists ((|v_receive_#t~ret5.offset_4| Int) (|v_receive_~#packet~0.offset_4| Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_6 Int) (|v_receive_~#packet~0.base_4| Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int) (|v_receive_#t~ret5.base_4| Int)) (and (= (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (store (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_2) (+ |v_receive_~#packet~0.offset_4| 4) v_DerPreprocessor_8) (+ |v_receive_~#packet~0.offset_4| 8) |v_receive_#t~ret5.offset_4|)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_4|)) (= (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (store (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_6) (+ |v_receive_~#packet~0.offset_4| 4) v_DerPreprocessor_4) (+ |v_receive_~#packet~0.offset_4| 8) |v_receive_#t~ret5.base_4|)) |#memory_$Pointer$.base|)))} assume true; {1246#(exists ((|v_receive_#t~ret5.offset_4| Int) (|v_receive_~#packet~0.offset_4| Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_6 Int) (|v_receive_~#packet~0.base_4| Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int) (|v_receive_#t~ret5.base_4| Int)) (and (= (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (store (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_2) (+ |v_receive_~#packet~0.offset_4| 4) v_DerPreprocessor_8) (+ |v_receive_~#packet~0.offset_4| 8) |v_receive_#t~ret5.offset_4|)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_4|)) (= (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (store (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_6) (+ |v_receive_~#packet~0.offset_4| 4) v_DerPreprocessor_4) (+ |v_receive_~#packet~0.offset_4| 8) |v_receive_#t~ret5.base_4|)) |#memory_$Pointer$.base|)))} is VALID [2018-11-23 13:00:52,848 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1246#(exists ((|v_receive_#t~ret5.offset_4| Int) (|v_receive_~#packet~0.offset_4| Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_6 Int) (|v_receive_~#packet~0.base_4| Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int) (|v_receive_#t~ret5.base_4| Int)) (and (= (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (store (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_2) (+ |v_receive_~#packet~0.offset_4| 4) v_DerPreprocessor_8) (+ |v_receive_~#packet~0.offset_4| 8) |v_receive_#t~ret5.offset_4|)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_4|)) (= (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (store (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_6) (+ |v_receive_~#packet~0.offset_4| 4) v_DerPreprocessor_4) (+ |v_receive_~#packet~0.offset_4| 8) |v_receive_#t~ret5.base_4|)) |#memory_$Pointer$.base|)))} {1226#(and (= (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|) 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (exists ((|main_~#normal_queue~0.base| Int)) (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)))) (= (select |#valid| |main_~#prio_queue~0.base|) 1))} #123#return; {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:52,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} call write~init~int(#t~ret29.size, ~#new_packet~0.base, ~#new_packet~0.offset, 4);call write~init~int(#t~ret29.prio, ~#new_packet~0.base, 4 + ~#new_packet~0.offset, 4);call write~init~$Pointer$(#t~ret29.payload.base, #t~ret29.payload.offset, ~#new_packet~0.base, 8 + ~#new_packet~0.offset, 4);havoc #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset;call #t~mem30 := read~int(~#new_packet~0.base, ~#new_packet~0.offset, 4); {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:52,855 INFO L273 TraceCheckUtils]: 15: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} assume !(#t~mem30 % 4294967296 > 0);havoc #t~mem30; {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:52,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} call ULTIMATE.dealloc(~#new_packet~0.base, ~#new_packet~0.offset);havoc ~#new_packet~0.base, ~#new_packet~0.offset; {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:52,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:52,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} assume !(0 != #t~nondet28);havoc #t~nondet28; {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} is VALID [2018-11-23 13:00:52,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {1204#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)))} call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~#prio_queue~0.base, ~#prio_queue~0.offset, 4); {1205#(and (= 0 |main_#t~mem42.offset|) (= 0 |main_#t~mem42.base|))} is VALID [2018-11-23 13:00:52,859 INFO L256 TraceCheckUtils]: 20: Hoare triple {1205#(and (= 0 |main_#t~mem42.offset|) (= 0 |main_#t~mem42.base|))} call process_prio_queue(#t~mem42.base, #t~mem42.offset); {1206#(and (= 0 |process_prio_queue_#in~q.offset|) (= 0 |process_prio_queue_#in~q.base|))} is VALID [2018-11-23 13:00:52,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {1206#(and (= 0 |process_prio_queue_#in~q.offset|) (= 0 |process_prio_queue_#in~q.base|))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~1.base, ~node~1.offset := ~q.base, ~q.offset; {1207#(and (= process_prio_queue_~node~1.offset 0) (= 0 process_prio_queue_~node~1.base))} is VALID [2018-11-23 13:00:52,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {1207#(and (= process_prio_queue_~node~1.offset 0) (= 0 process_prio_queue_~node~1.base))} assume !!(~node~1.base != 0 || ~node~1.offset != 0);call #t~mem15 := read~int(~node~1.base, 4 + ~node~1.offset, 4);#t~short17 := 1 == #t~mem15 % 4294967296; {1199#false} is VALID [2018-11-23 13:00:52,862 INFO L273 TraceCheckUtils]: 23: Hoare triple {1199#false} assume !#t~short17;call #t~mem16 := read~int(~node~1.base, ~node~1.offset, 4);#t~short17 := #t~mem16 % 4294967296 < 500; {1199#false} is VALID [2018-11-23 13:00:52,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {1199#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17;havoc #t~mem15; {1199#false} is VALID [2018-11-23 13:00:52,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2018-11-23 13:00:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:52,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:52,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-11-23 13:00:52,901 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-11-23 13:00:52,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:52,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:00:53,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:53,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:00:53,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:00:53,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=123, Unknown=2, NotChecked=0, Total=156 [2018-11-23 13:00:53,196 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 13 states. [2018-11-23 13:01:00,109 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-23 13:01:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:24,019 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2018-11-23 13:01:24,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:01:24,019 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-11-23 13:01:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:01:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 114 transitions. [2018-11-23 13:01:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:01:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 114 transitions. [2018-11-23 13:01:24,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 114 transitions. [2018-11-23 13:01:24,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:24,227 INFO L225 Difference]: With dead ends: 93 [2018-11-23 13:01:24,227 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 13:01:24,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=59, Invalid=244, Unknown=3, NotChecked=0, Total=306 [2018-11-23 13:01:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 13:01:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2018-11-23 13:01:24,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:24,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 65 states. [2018-11-23 13:01:24,292 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 65 states. [2018-11-23 13:01:24,292 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 65 states. [2018-11-23 13:01:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:24,296 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-11-23 13:01:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2018-11-23 13:01:24,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:24,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:24,298 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 73 states. [2018-11-23 13:01:24,298 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 73 states. [2018-11-23 13:01:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:24,302 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-11-23 13:01:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2018-11-23 13:01:24,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:24,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:24,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:24,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 13:01:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-11-23 13:01:24,306 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 26 [2018-11-23 13:01:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:24,307 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-11-23 13:01:24,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:01:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-11-23 13:01:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:01:24,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:24,308 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:01:24,308 INFO L423 AbstractCegarLoop]: === Iteration 6 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:24,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash 541228919, now seen corresponding path program 1 times [2018-11-23 13:01:24,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:24,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:24,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:24,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:24,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:24,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {1657#true} call ULTIMATE.init(); {1657#true} is VALID [2018-11-23 13:01:24,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {1657#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1657#true} is VALID [2018-11-23 13:01:24,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {1657#true} assume true; {1657#true} is VALID [2018-11-23 13:01:24,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1657#true} {1657#true} #135#return; {1657#true} is VALID [2018-11-23 13:01:24,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {1657#true} call #t~ret44 := main(); {1657#true} is VALID [2018-11-23 13:01:24,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {1657#true} call ~#prio_queue~0.base, ~#prio_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#prio_queue~0.base, ~#prio_queue~0.offset, 4);call ~#normal_queue~0.base, ~#normal_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {1657#true} is VALID [2018-11-23 13:01:24,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {1657#true} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {1657#true} is VALID [2018-11-23 13:01:24,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {1657#true} assume !!(0 != #t~nondet28);havoc #t~nondet28;call ~#new_packet~0.base, ~#new_packet~0.offset := #Ultimate.alloc(12); {1657#true} is VALID [2018-11-23 13:01:24,472 INFO L256 TraceCheckUtils]: 8: Hoare triple {1657#true} call #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset := receive(); {1657#true} is VALID [2018-11-23 13:01:24,473 INFO L273 TraceCheckUtils]: 9: Hoare triple {1657#true} call ~#packet~0.base, ~#packet~0.offset := #Ultimate.alloc(12);call write~int(#t~nondet2, ~#packet~0.base, ~#packet~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1657#true} is VALID [2018-11-23 13:01:24,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {1657#true} assume 0 != #t~nondet3;#t~ite4 := 0; {1659#(= 0 |receive_#t~ite4|)} is VALID [2018-11-23 13:01:24,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {1659#(= 0 |receive_#t~ite4|)} call write~int(#t~ite4, ~#packet~0.base, 4 + ~#packet~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call #t~ret5.base, #t~ret5.offset := __VERIFIER_nondet_charp();call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~#packet~0.base, 8 + ~#packet~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call #t~mem6 := read~int(~#packet~0.base, ~#packet~0.offset, 4);call #t~mem7 := read~int(~#packet~0.base, 4 + ~#packet~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#packet~0.base, 8 + ~#packet~0.offset, 4);#res.size, #res.prio, #res.payload.base, #res.payload.offset := #t~mem6, #t~mem7, #t~mem8.base, #t~mem8.offset;havoc #t~mem7;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem6;call ULTIMATE.dealloc(~#packet~0.base, ~#packet~0.offset);havoc ~#packet~0.base, ~#packet~0.offset; {1660#(= 0 |receive_#res.prio|)} is VALID [2018-11-23 13:01:24,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {1660#(= 0 |receive_#res.prio|)} assume true; {1660#(= 0 |receive_#res.prio|)} is VALID [2018-11-23 13:01:24,490 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1660#(= 0 |receive_#res.prio|)} {1657#true} #123#return; {1661#(= 0 |main_#t~ret29.prio|)} is VALID [2018-11-23 13:01:24,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {1661#(= 0 |main_#t~ret29.prio|)} call write~init~int(#t~ret29.size, ~#new_packet~0.base, ~#new_packet~0.offset, 4);call write~init~int(#t~ret29.prio, ~#new_packet~0.base, 4 + ~#new_packet~0.offset, 4);call write~init~$Pointer$(#t~ret29.payload.base, #t~ret29.payload.offset, ~#new_packet~0.base, 8 + ~#new_packet~0.offset, 4);havoc #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset;call #t~mem30 := read~int(~#new_packet~0.base, ~#new_packet~0.offset, 4); {1662#(= 0 (select (select |#memory_int| |main_~#new_packet~0.base|) (+ |main_~#new_packet~0.offset| 4)))} is VALID [2018-11-23 13:01:24,492 INFO L273 TraceCheckUtils]: 15: Hoare triple {1662#(= 0 (select (select |#memory_int| |main_~#new_packet~0.base|) (+ |main_~#new_packet~0.offset| 4)))} assume #t~mem30 % 4294967296 > 0;havoc #t~mem30;call #t~mem31 := read~int(~#new_packet~0.base, 4 + ~#new_packet~0.offset, 4); {1663#(= |main_#t~mem31| 0)} is VALID [2018-11-23 13:01:24,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {1663#(= |main_#t~mem31| 0)} assume 1 == #t~mem31 % 4294967296;havoc #t~mem31;call #t~mem32 := read~int(~#new_packet~0.base, ~#new_packet~0.offset, 4);call #t~mem33 := read~int(~#new_packet~0.base, 4 + ~#new_packet~0.offset, 4);call #t~mem34.base, #t~mem34.offset := read~$Pointer$(~#new_packet~0.base, 8 + ~#new_packet~0.offset, 4); {1658#false} is VALID [2018-11-23 13:01:24,492 INFO L256 TraceCheckUtils]: 17: Hoare triple {1658#false} call append_to_queue(#t~mem32, #t~mem33, #t~mem34.base, #t~mem34.offset, ~#prio_queue~0.base, ~#prio_queue~0.offset); {1657#true} is VALID [2018-11-23 13:01:24,493 INFO L273 TraceCheckUtils]: 18: Hoare triple {1657#true} call ~#p.base, ~#p.offset := #Ultimate.alloc(12);call write~int(#in~p.size, ~#p.base, ~#p.offset, 4);call write~int(#in~p.prio, ~#p.base, 4 + ~#p.offset, 4);call write~$Pointer$(#in~p.payload.base, #in~p.payload.offset, ~#p.base, 8 + ~#p.offset, 4);~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(16);~node~0.base, ~node~0.offset := #t~malloc9.base, #t~malloc9.offset;call #t~mem10 := read~int(~#p.base, ~#p.offset, 4);call #t~mem11 := read~int(~#p.base, 4 + ~#p.offset, 4);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#p.base, 8 + ~#p.offset, 4);call write~int(#t~mem10, ~node~0.base, ~node~0.offset, 4);call write~int(#t~mem11, ~node~0.base, 4 + ~node~0.offset, 4);call write~$Pointer$(#t~mem12.base, #t~mem12.offset, ~node~0.base, 8 + ~node~0.offset, 4);havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem11;havoc #t~mem10;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~q.base, ~q.offset, 4);call write~$Pointer$(#t~mem13.base, #t~mem13.offset, ~node~0.base, 12 + ~node~0.offset, 4);havoc #t~mem13.base, #t~mem13.offset;call write~$Pointer$(~node~0.base, ~node~0.offset, ~q.base, ~q.offset, 4);call ULTIMATE.dealloc(~#p.base, ~#p.offset);havoc ~#p.base, ~#p.offset; {1657#true} is VALID [2018-11-23 13:01:24,493 INFO L273 TraceCheckUtils]: 19: Hoare triple {1657#true} assume true; {1657#true} is VALID [2018-11-23 13:01:24,493 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1657#true} {1658#false} #125#return; {1658#false} is VALID [2018-11-23 13:01:24,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {1658#false} havoc #t~mem33;havoc #t~mem32;havoc #t~mem34.base, #t~mem34.offset; {1658#false} is VALID [2018-11-23 13:01:24,494 INFO L273 TraceCheckUtils]: 22: Hoare triple {1658#false} call ULTIMATE.dealloc(~#new_packet~0.base, ~#new_packet~0.offset);havoc ~#new_packet~0.base, ~#new_packet~0.offset; {1658#false} is VALID [2018-11-23 13:01:24,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {1658#false} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {1658#false} is VALID [2018-11-23 13:01:24,495 INFO L273 TraceCheckUtils]: 24: Hoare triple {1658#false} assume !(0 != #t~nondet28);havoc #t~nondet28; {1658#false} is VALID [2018-11-23 13:01:24,495 INFO L273 TraceCheckUtils]: 25: Hoare triple {1658#false} call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~#prio_queue~0.base, ~#prio_queue~0.offset, 4); {1658#false} is VALID [2018-11-23 13:01:24,495 INFO L256 TraceCheckUtils]: 26: Hoare triple {1658#false} call process_prio_queue(#t~mem42.base, #t~mem42.offset); {1658#false} is VALID [2018-11-23 13:01:24,495 INFO L273 TraceCheckUtils]: 27: Hoare triple {1658#false} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~1.base, ~node~1.offset := ~q.base, ~q.offset; {1658#false} is VALID [2018-11-23 13:01:24,496 INFO L273 TraceCheckUtils]: 28: Hoare triple {1658#false} assume !!(~node~1.base != 0 || ~node~1.offset != 0);call #t~mem15 := read~int(~node~1.base, 4 + ~node~1.offset, 4);#t~short17 := 1 == #t~mem15 % 4294967296; {1658#false} is VALID [2018-11-23 13:01:24,496 INFO L273 TraceCheckUtils]: 29: Hoare triple {1658#false} assume !#t~short17;call #t~mem16 := read~int(~node~1.base, ~node~1.offset, 4);#t~short17 := #t~mem16 % 4294967296 < 500; {1658#false} is VALID [2018-11-23 13:01:24,496 INFO L273 TraceCheckUtils]: 30: Hoare triple {1658#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17;havoc #t~mem15; {1658#false} is VALID [2018-11-23 13:01:24,496 INFO L273 TraceCheckUtils]: 31: Hoare triple {1658#false} assume !false; {1658#false} is VALID [2018-11-23 13:01:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:24,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:24,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:01:24,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-11-23 13:01:24,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:24,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:01:24,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:24,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:01:24,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:01:24,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:01:24,543 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 7 states. [2018-11-23 13:01:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:25,476 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2018-11-23 13:01:25,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:01:25,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-11-23 13:01:25,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:01:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-23 13:01:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:01:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-23 13:01:25,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2018-11-23 13:01:25,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:25,704 INFO L225 Difference]: With dead ends: 123 [2018-11-23 13:01:25,704 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 13:01:25,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:01:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 13:01:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2018-11-23 13:01:25,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:25,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 73 states. [2018-11-23 13:01:25,792 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 73 states. [2018-11-23 13:01:25,792 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 73 states. [2018-11-23 13:01:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:25,796 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2018-11-23 13:01:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2018-11-23 13:01:25,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:25,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:25,797 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 78 states. [2018-11-23 13:01:25,797 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 78 states. [2018-11-23 13:01:25,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:25,801 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2018-11-23 13:01:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2018-11-23 13:01:25,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:25,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:25,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:25,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 13:01:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2018-11-23 13:01:25,806 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 32 [2018-11-23 13:01:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:25,806 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2018-11-23 13:01:25,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:01:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-23 13:01:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:01:25,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:25,807 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:01:25,807 INFO L423 AbstractCegarLoop]: === Iteration 7 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:25,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:25,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1913735077, now seen corresponding path program 1 times [2018-11-23 13:01:25,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:25,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:25,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:25,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:25,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:26,234 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 13:01:26,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {2081#true} call ULTIMATE.init(); {2081#true} is VALID [2018-11-23 13:01:26,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {2081#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2081#true} is VALID [2018-11-23 13:01:26,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {2081#true} assume true; {2081#true} is VALID [2018-11-23 13:01:26,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2081#true} {2081#true} #135#return; {2081#true} is VALID [2018-11-23 13:01:26,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {2081#true} call #t~ret44 := main(); {2081#true} is VALID [2018-11-23 13:01:26,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {2081#true} call ~#prio_queue~0.base, ~#prio_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#prio_queue~0.base, ~#prio_queue~0.offset, 4);call ~#normal_queue~0.base, ~#normal_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {2083#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} is VALID [2018-11-23 13:01:26,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {2083#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {2083#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} is VALID [2018-11-23 13:01:26,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {2083#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} assume !!(0 != #t~nondet28);havoc #t~nondet28;call ~#new_packet~0.base, ~#new_packet~0.offset := #Ultimate.alloc(12); {2084#(and (not (= |main_~#normal_queue~0.base| |main_~#new_packet~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} is VALID [2018-11-23 13:01:26,360 INFO L256 TraceCheckUtils]: 8: Hoare triple {2084#(and (not (= |main_~#normal_queue~0.base| |main_~#new_packet~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} call #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset := receive(); {2085#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:26,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {2085#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ~#packet~0.base, ~#packet~0.offset := #Ultimate.alloc(12);call write~int(#t~nondet2, ~#packet~0.base, ~#packet~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2086#(and (= (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (select |#memory_$Pointer$.base| |receive_~#packet~0.base|))) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} is VALID [2018-11-23 13:01:26,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {2086#(and (= (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (select |#memory_$Pointer$.base| |receive_~#packet~0.base|))) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} assume 0 != #t~nondet3;#t~ite4 := 0; {2086#(and (= (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (select |#memory_$Pointer$.base| |receive_~#packet~0.base|))) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} is VALID [2018-11-23 13:01:26,368 INFO L273 TraceCheckUtils]: 11: Hoare triple {2086#(and (= (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (select |#memory_$Pointer$.base| |receive_~#packet~0.base|))) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} call write~int(#t~ite4, ~#packet~0.base, 4 + ~#packet~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call #t~ret5.base, #t~ret5.offset := __VERIFIER_nondet_charp();call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~#packet~0.base, 8 + ~#packet~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call #t~mem6 := read~int(~#packet~0.base, ~#packet~0.offset, 4);call #t~mem7 := read~int(~#packet~0.base, 4 + ~#packet~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#packet~0.base, 8 + ~#packet~0.offset, 4);#res.size, #res.prio, #res.payload.base, #res.payload.offset := #t~mem6, #t~mem7, #t~mem8.base, #t~mem8.offset;havoc #t~mem7;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem6;call ULTIMATE.dealloc(~#packet~0.base, ~#packet~0.offset);havoc ~#packet~0.base, ~#packet~0.offset; {2087#(and (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (store (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))))} is VALID [2018-11-23 13:01:26,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {2087#(and (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (store (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))))} assume true; {2087#(and (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (store (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))))} is VALID [2018-11-23 13:01:26,378 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2087#(and (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (store (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))))} {2084#(and (not (= |main_~#normal_queue~0.base| |main_~#new_packet~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} #123#return; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:26,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} call write~init~int(#t~ret29.size, ~#new_packet~0.base, ~#new_packet~0.offset, 4);call write~init~int(#t~ret29.prio, ~#new_packet~0.base, 4 + ~#new_packet~0.offset, 4);call write~init~$Pointer$(#t~ret29.payload.base, #t~ret29.payload.offset, ~#new_packet~0.base, 8 + ~#new_packet~0.offset, 4);havoc #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset;call #t~mem30 := read~int(~#new_packet~0.base, ~#new_packet~0.offset, 4); {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:26,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} assume !(#t~mem30 % 4294967296 > 0);havoc #t~mem30; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:26,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} call ULTIMATE.dealloc(~#new_packet~0.base, ~#new_packet~0.offset);havoc ~#new_packet~0.base, ~#new_packet~0.offset; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:26,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:26,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} assume !(0 != #t~nondet28);havoc #t~nondet28; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:26,382 INFO L273 TraceCheckUtils]: 19: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~#prio_queue~0.base, ~#prio_queue~0.offset, 4); {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:26,382 INFO L256 TraceCheckUtils]: 20: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} call process_prio_queue(#t~mem42.base, #t~mem42.offset); {2081#true} is VALID [2018-11-23 13:01:26,382 INFO L273 TraceCheckUtils]: 21: Hoare triple {2081#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~1.base, ~node~1.offset := ~q.base, ~q.offset; {2081#true} is VALID [2018-11-23 13:01:26,382 INFO L273 TraceCheckUtils]: 22: Hoare triple {2081#true} assume !(~node~1.base != 0 || ~node~1.offset != 0); {2081#true} is VALID [2018-11-23 13:01:26,383 INFO L273 TraceCheckUtils]: 23: Hoare triple {2081#true} assume true; {2081#true} is VALID [2018-11-23 13:01:26,384 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2081#true} {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} #131#return; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:26,385 INFO L273 TraceCheckUtils]: 25: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {2089#(and (= 0 |main_#t~mem43.offset|) (= 0 |main_#t~mem43.base|))} is VALID [2018-11-23 13:01:26,386 INFO L256 TraceCheckUtils]: 26: Hoare triple {2089#(and (= 0 |main_#t~mem43.offset|) (= 0 |main_#t~mem43.base|))} call process_normal_queue(#t~mem43.base, #t~mem43.offset); {2090#(and (= 0 |process_normal_queue_#in~q.offset|) (= 0 |process_normal_queue_#in~q.base|))} is VALID [2018-11-23 13:01:26,387 INFO L273 TraceCheckUtils]: 27: Hoare triple {2090#(and (= 0 |process_normal_queue_#in~q.offset|) (= 0 |process_normal_queue_#in~q.base|))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~2.base, ~node~2.offset := ~q.base, ~q.offset; {2091#(and (= 0 process_normal_queue_~node~2.base) (= 0 process_normal_queue_~node~2.offset))} is VALID [2018-11-23 13:01:26,388 INFO L273 TraceCheckUtils]: 28: Hoare triple {2091#(and (= 0 process_normal_queue_~node~2.base) (= 0 process_normal_queue_~node~2.offset))} assume !!(~node~2.base != 0 || ~node~2.offset != 0);call #t~mem22 := read~int(~node~2.base, 4 + ~node~2.offset, 4);#t~short24 := 0 == #t~mem22 % 4294967296; {2082#false} is VALID [2018-11-23 13:01:26,388 INFO L273 TraceCheckUtils]: 29: Hoare triple {2082#false} assume #t~short24;call #t~mem23 := read~int(~node~2.base, ~node~2.offset, 4);#t~short24 := #t~mem23 % 4294967296 >= 500; {2082#false} is VALID [2018-11-23 13:01:26,388 INFO L273 TraceCheckUtils]: 30: Hoare triple {2082#false} assume !#t~short24;havoc #t~mem22;havoc #t~mem23;havoc #t~short24; {2082#false} is VALID [2018-11-23 13:01:26,389 INFO L273 TraceCheckUtils]: 31: Hoare triple {2082#false} assume !false; {2082#false} is VALID [2018-11-23 13:01:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:26,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:26,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:26,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:26,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:26,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 13:01:26,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 13:01:26,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:26,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-11-23 13:01:26,901 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:26,902 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_36|, |main_~#prio_queue~0.base|]. (and (= |#valid| (store (store |v_#valid_36| |main_~#prio_queue~0.base| 1) |main_~#normal_queue~0.base| 1)) (= (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|) 0)) [2018-11-23 13:01:26,902 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#prio_queue~0.base|]. (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (= (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|) 0) (= (select |#valid| |main_~#prio_queue~0.base|) 1)) [2018-11-23 13:01:26,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 13:01:26,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:26,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-11-23 13:01:26,938 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:26,938 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_37|, |main_~#new_packet~0.base|]. (and (= |#valid| (store |v_#valid_37| |main_~#new_packet~0.base| 1)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |v_#valid_37| |main_~#normal_queue~0.base|) 1)) [2018-11-23 13:01:26,938 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#new_packet~0.base|]. (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 1 (select |#valid| |main_~#new_packet~0.base|))) [2018-11-23 13:01:27,029 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,078 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,123 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,127 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,159 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,164 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,180 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-11-23 13:01:29,185 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:29,185 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_44|, |v_receive_~#packet~0.base_5|, |v_receive_~#packet~0.offset_5|, |v_receive_#t~ret5.base_5|, |v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.offset_46|, |v_#memory_$Pointer$.base_46|, |v_receive_#t~ret5.offset_5|]. (let ((.cse1 (+ |v_receive_~#packet~0.offset_5| 4)) (.cse0 (select |v_#memory_$Pointer$.offset_46| |v_receive_~#packet~0.base_5|)) (.cse3 (select |v_#memory_$Pointer$.base_46| |v_receive_~#packet~0.base_5|)) (.cse4 (select |v_#memory_$Pointer$.base_44| |v_receive_~#packet~0.base_5|)) (.cse2 (select |v_#memory_$Pointer$.offset_44| |v_receive_~#packet~0.base_5|)) (.cse5 (+ |v_receive_~#packet~0.offset_5| 8))) (and (= (store |v_#memory_$Pointer$.offset_46| |v_receive_~#packet~0.base_5| (store .cse0 .cse1 (select .cse2 .cse1))) |v_#memory_$Pointer$.offset_44|) (= |v_#memory_$Pointer$.base_44| (store |v_#memory_$Pointer$.base_46| |v_receive_~#packet~0.base_5| (store .cse3 .cse1 (select .cse4 .cse1)))) (= (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5| (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| (select .cse0 |v_receive_~#packet~0.offset_5|))) |v_#memory_$Pointer$.offset_46|) (= |v_#memory_$Pointer$.base_46| (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5| (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| (select .cse3 |v_receive_~#packet~0.offset_5|)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_44| |v_receive_~#packet~0.base_5| (store .cse4 .cse5 |v_receive_#t~ret5.base_5|))) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_5|)) (= (store |v_#memory_$Pointer$.offset_44| |v_receive_~#packet~0.base_5| (store .cse2 .cse5 |v_receive_#t~ret5.offset_5|)) |#memory_$Pointer$.offset|))) [2018-11-23 13:01:29,186 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|v_receive_~#packet~0.base_5|, |v_receive_~#packet~0.offset_5|, v_DerPreprocessor_14, v_DerPreprocessor_12, |v_receive_#t~ret5.offset_5|, v_DerPreprocessor_10, v_DerPreprocessor_16, |v_receive_#t~ret5.base_5|]. (let ((.cse0 (+ |v_receive_~#packet~0.offset_5| 4)) (.cse1 (+ |v_receive_~#packet~0.offset_5| 8))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5| (store (store (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_14) .cse0 v_DerPreprocessor_12) .cse1 |v_receive_#t~ret5.offset_5|))) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_5|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5| (store (store (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_10) .cse0 v_DerPreprocessor_16) .cse1 |v_receive_#t~ret5.base_5|))))) [2018-11-23 13:01:33,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:33,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:33,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 13:01:33,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-23 13:01:33,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 13:01:33,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:33,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-11-23 13:01:33,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:33,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:33,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:33,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-23 13:01:33,468 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,485 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-23 13:01:33,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 13:01:33,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:33,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-11-23 13:01:33,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:33,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:33,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:33,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-23 13:01:33,602 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,616 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,627 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,646 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,673 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:67, output treesize:15 [2018-11-23 13:01:33,690 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:33,691 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.offset)_AFTER_CALL_2|, |v_receive_~#packet~0.base_5|, |v_receive_~#packet~0.offset_5|, v_DerPreprocessor_14, v_DerPreprocessor_12, |v_receive_#t~ret5.offset_5|, |v_old(#valid)_AFTER_CALL_4|, |v_old(#memory_$Pointer$.base)_AFTER_CALL_2|, v_DerPreprocessor_10, v_DerPreprocessor_16, |v_receive_#t~ret5.base_5|]. (let ((.cse0 (+ |v_receive_~#packet~0.offset_5| 4)) (.cse1 (+ |v_receive_~#packet~0.offset_5| 8))) (and (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_2| |v_receive_~#packet~0.base_5| (store (store (store (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_2| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_14) .cse0 v_DerPreprocessor_12) .cse1 |v_receive_#t~ret5.offset_5|)) |#memory_$Pointer$.offset|) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_2| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select |v_old(#valid)_AFTER_CALL_4| |v_receive_~#packet~0.base_5|)) (= |#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |v_receive_~#packet~0.base_5| (store (store (store (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_10) .cse0 v_DerPreprocessor_16) .cse1 |v_receive_#t~ret5.base_5|))) (= 1 (select |v_old(#valid)_AFTER_CALL_4| |main_~#normal_queue~0.base|)) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|) 0))) [2018-11-23 13:01:33,691 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|) 0)) [2018-11-23 13:01:33,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:01:33,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:01:33,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:01:33,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:01:33,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:33,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-23 13:01:33,922 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:33,922 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, |main_~#normal_queue~0.base|, |main_~#normal_queue~0.offset|, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|))) (and (= |main_#t~mem43.offset| .cse0) (= 0 .cse1) (= 0 .cse0) (= .cse1 |main_#t~mem43.base|))) [2018-11-23 13:01:33,923 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |main_#t~mem43.base|) (= |main_#t~mem43.offset| 0)) [2018-11-23 13:01:33,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {2081#true} call ULTIMATE.init(); {2081#true} is VALID [2018-11-23 13:01:33,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {2081#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2081#true} is VALID [2018-11-23 13:01:33,967 INFO L273 TraceCheckUtils]: 2: Hoare triple {2081#true} assume true; {2081#true} is VALID [2018-11-23 13:01:33,967 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2081#true} {2081#true} #135#return; {2081#true} is VALID [2018-11-23 13:01:33,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {2081#true} call #t~ret44 := main(); {2081#true} is VALID [2018-11-23 13:01:33,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {2081#true} call ~#prio_queue~0.base, ~#prio_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#prio_queue~0.base, ~#prio_queue~0.offset, 4);call ~#normal_queue~0.base, ~#normal_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {2083#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} is VALID [2018-11-23 13:01:33,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {2083#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {2083#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} is VALID [2018-11-23 13:01:33,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {2083#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} assume !!(0 != #t~nondet28);havoc #t~nondet28;call ~#new_packet~0.base, ~#new_packet~0.offset := #Ultimate.alloc(12); {2083#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} is VALID [2018-11-23 13:01:33,971 INFO L256 TraceCheckUtils]: 8: Hoare triple {2083#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} call #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset := receive(); {2085#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:33,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {2085#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ~#packet~0.base, ~#packet~0.offset := #Ultimate.alloc(12);call write~int(#t~nondet2, ~#packet~0.base, ~#packet~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2122#(and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|) |receive_~#packet~0.offset|)))) (= (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.base)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.base| |receive_~#packet~0.base|) |receive_~#packet~0.offset|))) |#memory_$Pointer$.base|) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} is VALID [2018-11-23 13:01:33,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {2122#(and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|) |receive_~#packet~0.offset|)))) (= (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.base)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.base| |receive_~#packet~0.base|) |receive_~#packet~0.offset|))) |#memory_$Pointer$.base|) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} assume 0 != #t~nondet3;#t~ite4 := 0; {2122#(and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|) |receive_~#packet~0.offset|)))) (= (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.base)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.base| |receive_~#packet~0.base|) |receive_~#packet~0.offset|))) |#memory_$Pointer$.base|) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} is VALID [2018-11-23 13:01:33,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {2122#(and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.offset)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.offset| |receive_~#packet~0.base|) |receive_~#packet~0.offset|)))) (= (store |old(#memory_$Pointer$.base)| |receive_~#packet~0.base| (store (select |old(#memory_$Pointer$.base)| |receive_~#packet~0.base|) |receive_~#packet~0.offset| (select (select |#memory_$Pointer$.base| |receive_~#packet~0.base|) |receive_~#packet~0.offset|))) |#memory_$Pointer$.base|) (= 0 (select |old(#valid)| |receive_~#packet~0.base|)))} call write~int(#t~ite4, ~#packet~0.base, 4 + ~#packet~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call #t~ret5.base, #t~ret5.offset := __VERIFIER_nondet_charp();call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~#packet~0.base, 8 + ~#packet~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call #t~mem6 := read~int(~#packet~0.base, ~#packet~0.offset, 4);call #t~mem7 := read~int(~#packet~0.base, 4 + ~#packet~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#packet~0.base, 8 + ~#packet~0.offset, 4);#res.size, #res.prio, #res.payload.base, #res.payload.offset := #t~mem6, #t~mem7, #t~mem8.base, #t~mem8.offset;havoc #t~mem7;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem6;call ULTIMATE.dealloc(~#packet~0.base, ~#packet~0.offset);havoc ~#packet~0.base, ~#packet~0.offset; {2129#(exists ((|v_receive_#t~ret5.offset_5| Int) (v_DerPreprocessor_14 Int) (|v_receive_~#packet~0.offset_5| Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_16 Int) (|v_receive_~#packet~0.base_5| Int) (v_DerPreprocessor_10 Int) (|v_receive_#t~ret5.base_5| Int)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5| (store (store (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_14) (+ |v_receive_~#packet~0.offset_5| 4) v_DerPreprocessor_12) (+ |v_receive_~#packet~0.offset_5| 8) |v_receive_#t~ret5.offset_5|))) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_5|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5| (store (store (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_10) (+ |v_receive_~#packet~0.offset_5| 4) v_DerPreprocessor_16) (+ |v_receive_~#packet~0.offset_5| 8) |v_receive_#t~ret5.base_5|)))))} is VALID [2018-11-23 13:01:33,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {2129#(exists ((|v_receive_#t~ret5.offset_5| Int) (v_DerPreprocessor_14 Int) (|v_receive_~#packet~0.offset_5| Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_16 Int) (|v_receive_~#packet~0.base_5| Int) (v_DerPreprocessor_10 Int) (|v_receive_#t~ret5.base_5| Int)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5| (store (store (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_14) (+ |v_receive_~#packet~0.offset_5| 4) v_DerPreprocessor_12) (+ |v_receive_~#packet~0.offset_5| 8) |v_receive_#t~ret5.offset_5|))) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_5|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5| (store (store (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_10) (+ |v_receive_~#packet~0.offset_5| 4) v_DerPreprocessor_16) (+ |v_receive_~#packet~0.offset_5| 8) |v_receive_#t~ret5.base_5|)))))} assume true; {2129#(exists ((|v_receive_#t~ret5.offset_5| Int) (v_DerPreprocessor_14 Int) (|v_receive_~#packet~0.offset_5| Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_16 Int) (|v_receive_~#packet~0.base_5| Int) (v_DerPreprocessor_10 Int) (|v_receive_#t~ret5.base_5| Int)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5| (store (store (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_14) (+ |v_receive_~#packet~0.offset_5| 4) v_DerPreprocessor_12) (+ |v_receive_~#packet~0.offset_5| 8) |v_receive_#t~ret5.offset_5|))) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_5|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5| (store (store (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_10) (+ |v_receive_~#packet~0.offset_5| 4) v_DerPreprocessor_16) (+ |v_receive_~#packet~0.offset_5| 8) |v_receive_#t~ret5.base_5|)))))} is VALID [2018-11-23 13:01:33,984 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2129#(exists ((|v_receive_#t~ret5.offset_5| Int) (v_DerPreprocessor_14 Int) (|v_receive_~#packet~0.offset_5| Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_16 Int) (|v_receive_~#packet~0.base_5| Int) (v_DerPreprocessor_10 Int) (|v_receive_#t~ret5.base_5| Int)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5| (store (store (store (select |old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_14) (+ |v_receive_~#packet~0.offset_5| 4) v_DerPreprocessor_12) (+ |v_receive_~#packet~0.offset_5| 8) |v_receive_#t~ret5.offset_5|))) (= 0 (select |old(#valid)| |v_receive_~#packet~0.base_5|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5| (store (store (store (select |old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5|) |v_receive_~#packet~0.offset_5| v_DerPreprocessor_10) (+ |v_receive_~#packet~0.offset_5| 4) v_DerPreprocessor_16) (+ |v_receive_~#packet~0.offset_5| 8) |v_receive_#t~ret5.base_5|)))))} {2083#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= (select |#valid| |main_~#normal_queue~0.base|) 1))} #123#return; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:33,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} call write~init~int(#t~ret29.size, ~#new_packet~0.base, ~#new_packet~0.offset, 4);call write~init~int(#t~ret29.prio, ~#new_packet~0.base, 4 + ~#new_packet~0.offset, 4);call write~init~$Pointer$(#t~ret29.payload.base, #t~ret29.payload.offset, ~#new_packet~0.base, 8 + ~#new_packet~0.offset, 4);havoc #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset;call #t~mem30 := read~int(~#new_packet~0.base, ~#new_packet~0.offset, 4); {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:33,985 INFO L273 TraceCheckUtils]: 15: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} assume !(#t~mem30 % 4294967296 > 0);havoc #t~mem30; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:33,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} call ULTIMATE.dealloc(~#new_packet~0.base, ~#new_packet~0.offset);havoc ~#new_packet~0.base, ~#new_packet~0.offset; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:33,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:33,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} assume !(0 != #t~nondet28);havoc #t~nondet28; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:33,989 INFO L273 TraceCheckUtils]: 19: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~#prio_queue~0.base, ~#prio_queue~0.offset, 4); {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:33,992 INFO L256 TraceCheckUtils]: 20: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} call process_prio_queue(#t~mem42.base, #t~mem42.offset); {2157#(exists ((|v_main_~#normal_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#normal_queue~0.base_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|)) (= (select (select |#memory_$Pointer$.base| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|) 0)))} is VALID [2018-11-23 13:01:33,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {2157#(exists ((|v_main_~#normal_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#normal_queue~0.base_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|)) (= (select (select |#memory_$Pointer$.base| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|) 0)))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~1.base, ~node~1.offset := ~q.base, ~q.offset; {2157#(exists ((|v_main_~#normal_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#normal_queue~0.base_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|)) (= (select (select |#memory_$Pointer$.base| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|) 0)))} is VALID [2018-11-23 13:01:34,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {2157#(exists ((|v_main_~#normal_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#normal_queue~0.base_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|)) (= (select (select |#memory_$Pointer$.base| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|) 0)))} assume !(~node~1.base != 0 || ~node~1.offset != 0); {2157#(exists ((|v_main_~#normal_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#normal_queue~0.base_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|)) (= (select (select |#memory_$Pointer$.base| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|) 0)))} is VALID [2018-11-23 13:01:34,000 INFO L273 TraceCheckUtils]: 23: Hoare triple {2157#(exists ((|v_main_~#normal_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#normal_queue~0.base_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|)) (= (select (select |#memory_$Pointer$.base| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|) 0)))} assume true; {2157#(exists ((|v_main_~#normal_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#normal_queue~0.base_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|)) (= (select (select |#memory_$Pointer$.base| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|) 0)))} is VALID [2018-11-23 13:01:34,001 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2157#(exists ((|v_main_~#normal_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#normal_queue~0.base_BEFORE_CALL_2| Int)) (and (= 0 (select (select |#memory_$Pointer$.offset| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|)) (= (select (select |#memory_$Pointer$.base| |v_main_~#normal_queue~0.base_BEFORE_CALL_2|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_2|) 0)))} {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} #131#return; {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} is VALID [2018-11-23 13:01:34,010 INFO L273 TraceCheckUtils]: 25: Hoare triple {2088#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#normal_queue~0.base|) |main_~#normal_queue~0.offset|)))} havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {2089#(and (= 0 |main_#t~mem43.offset|) (= 0 |main_#t~mem43.base|))} is VALID [2018-11-23 13:01:34,011 INFO L256 TraceCheckUtils]: 26: Hoare triple {2089#(and (= 0 |main_#t~mem43.offset|) (= 0 |main_#t~mem43.base|))} call process_normal_queue(#t~mem43.base, #t~mem43.offset); {2090#(and (= 0 |process_normal_queue_#in~q.offset|) (= 0 |process_normal_queue_#in~q.base|))} is VALID [2018-11-23 13:01:34,012 INFO L273 TraceCheckUtils]: 27: Hoare triple {2090#(and (= 0 |process_normal_queue_#in~q.offset|) (= 0 |process_normal_queue_#in~q.base|))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~2.base, ~node~2.offset := ~q.base, ~q.offset; {2091#(and (= 0 process_normal_queue_~node~2.base) (= 0 process_normal_queue_~node~2.offset))} is VALID [2018-11-23 13:01:34,012 INFO L273 TraceCheckUtils]: 28: Hoare triple {2091#(and (= 0 process_normal_queue_~node~2.base) (= 0 process_normal_queue_~node~2.offset))} assume !!(~node~2.base != 0 || ~node~2.offset != 0);call #t~mem22 := read~int(~node~2.base, 4 + ~node~2.offset, 4);#t~short24 := 0 == #t~mem22 % 4294967296; {2082#false} is VALID [2018-11-23 13:01:34,013 INFO L273 TraceCheckUtils]: 29: Hoare triple {2082#false} assume #t~short24;call #t~mem23 := read~int(~node~2.base, ~node~2.offset, 4);#t~short24 := #t~mem23 % 4294967296 >= 500; {2082#false} is VALID [2018-11-23 13:01:34,013 INFO L273 TraceCheckUtils]: 30: Hoare triple {2082#false} assume !#t~short24;havoc #t~mem22;havoc #t~mem23;havoc #t~short24; {2082#false} is VALID [2018-11-23 13:01:34,013 INFO L273 TraceCheckUtils]: 31: Hoare triple {2082#false} assume !false; {2082#false} is VALID [2018-11-23 13:01:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:34,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:34,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-11-23 13:01:34,040 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-23 13:01:34,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:34,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:01:34,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:34,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:01:34,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:01:34,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=144, Unknown=2, NotChecked=0, Total=182 [2018-11-23 13:01:34,120 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 14 states. [2018-11-23 13:01:40,616 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-23 13:01:51,013 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 13:02:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:18,234 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2018-11-23 13:02:18,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:02:18,234 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-23 13:02:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:02:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 103 transitions. [2018-11-23 13:02:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:02:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 103 transitions. [2018-11-23 13:02:18,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 103 transitions. [2018-11-23 13:02:18,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:18,410 INFO L225 Difference]: With dead ends: 93 [2018-11-23 13:02:18,410 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 13:02:18,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=76, Invalid=297, Unknown=7, NotChecked=0, Total=380 [2018-11-23 13:02:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 13:02:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-11-23 13:02:18,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:18,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 67 states. [2018-11-23 13:02:18,592 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 67 states. [2018-11-23 13:02:18,592 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 67 states. [2018-11-23 13:02:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:18,595 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2018-11-23 13:02:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2018-11-23 13:02:18,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:18,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:18,595 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 76 states. [2018-11-23 13:02:18,595 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 76 states. [2018-11-23 13:02:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:18,599 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2018-11-23 13:02:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2018-11-23 13:02:18,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:18,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:18,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:18,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:02:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-11-23 13:02:18,603 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 32 [2018-11-23 13:02:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:18,603 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-23 13:02:18,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:02:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-23 13:02:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:02:18,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:18,605 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:02:18,605 INFO L423 AbstractCegarLoop]: === Iteration 8 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:18,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:18,605 INFO L82 PathProgramCache]: Analyzing trace with hash 760083637, now seen corresponding path program 1 times [2018-11-23 13:02:18,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:18,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:18,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:19,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {2568#true} call ULTIMATE.init(); {2568#true} is VALID [2018-11-23 13:02:19,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {2568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2568#true} is VALID [2018-11-23 13:02:19,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {2568#true} assume true; {2568#true} is VALID [2018-11-23 13:02:19,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2568#true} {2568#true} #135#return; {2568#true} is VALID [2018-11-23 13:02:19,738 INFO L256 TraceCheckUtils]: 4: Hoare triple {2568#true} call #t~ret44 := main(); {2568#true} is VALID [2018-11-23 13:02:19,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {2568#true} call ~#prio_queue~0.base, ~#prio_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#prio_queue~0.base, ~#prio_queue~0.offset, 4);call ~#normal_queue~0.base, ~#normal_queue~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#normal_queue~0.base, ~#normal_queue~0.offset, 4); {2570#(= 0 |main_~#prio_queue~0.offset|)} is VALID [2018-11-23 13:02:19,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {2570#(= 0 |main_~#prio_queue~0.offset|)} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {2570#(= 0 |main_~#prio_queue~0.offset|)} is VALID [2018-11-23 13:02:19,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {2570#(= 0 |main_~#prio_queue~0.offset|)} assume !!(0 != #t~nondet28);havoc #t~nondet28;call ~#new_packet~0.base, ~#new_packet~0.offset := #Ultimate.alloc(12); {2570#(= 0 |main_~#prio_queue~0.offset|)} is VALID [2018-11-23 13:02:19,745 INFO L256 TraceCheckUtils]: 8: Hoare triple {2570#(= 0 |main_~#prio_queue~0.offset|)} call #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset := receive(); {2568#true} is VALID [2018-11-23 13:02:19,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {2568#true} call ~#packet~0.base, ~#packet~0.offset := #Ultimate.alloc(12);call write~int(#t~nondet2, ~#packet~0.base, ~#packet~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2568#true} is VALID [2018-11-23 13:02:19,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {2568#true} assume !(0 != #t~nondet3);#t~ite4 := 1; {2571#(= 1 |receive_#t~ite4|)} is VALID [2018-11-23 13:02:19,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {2571#(= 1 |receive_#t~ite4|)} call write~int(#t~ite4, ~#packet~0.base, 4 + ~#packet~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call #t~ret5.base, #t~ret5.offset := __VERIFIER_nondet_charp();call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~#packet~0.base, 8 + ~#packet~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call #t~mem6 := read~int(~#packet~0.base, ~#packet~0.offset, 4);call #t~mem7 := read~int(~#packet~0.base, 4 + ~#packet~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#packet~0.base, 8 + ~#packet~0.offset, 4);#res.size, #res.prio, #res.payload.base, #res.payload.offset := #t~mem6, #t~mem7, #t~mem8.base, #t~mem8.offset;havoc #t~mem7;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem6;call ULTIMATE.dealloc(~#packet~0.base, ~#packet~0.offset);havoc ~#packet~0.base, ~#packet~0.offset; {2572#(= 1 |receive_#res.prio|)} is VALID [2018-11-23 13:02:19,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {2572#(= 1 |receive_#res.prio|)} assume true; {2572#(= 1 |receive_#res.prio|)} is VALID [2018-11-23 13:02:19,749 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2572#(= 1 |receive_#res.prio|)} {2570#(= 0 |main_~#prio_queue~0.offset|)} #123#return; {2573#(and (= 1 |main_#t~ret29.prio|) (= 0 |main_~#prio_queue~0.offset|))} is VALID [2018-11-23 13:02:19,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {2573#(and (= 1 |main_#t~ret29.prio|) (= 0 |main_~#prio_queue~0.offset|))} call write~init~int(#t~ret29.size, ~#new_packet~0.base, ~#new_packet~0.offset, 4);call write~init~int(#t~ret29.prio, ~#new_packet~0.base, 4 + ~#new_packet~0.offset, 4);call write~init~$Pointer$(#t~ret29.payload.base, #t~ret29.payload.offset, ~#new_packet~0.base, 8 + ~#new_packet~0.offset, 4);havoc #t~ret29.size, #t~ret29.prio, #t~ret29.payload.base, #t~ret29.payload.offset;call #t~mem30 := read~int(~#new_packet~0.base, ~#new_packet~0.offset, 4); {2574#(and (= 1 (select (select |#memory_int| |main_~#new_packet~0.base|) (+ |main_~#new_packet~0.offset| 4))) (= 0 |main_~#prio_queue~0.offset|))} is VALID [2018-11-23 13:02:19,751 INFO L273 TraceCheckUtils]: 15: Hoare triple {2574#(and (= 1 (select (select |#memory_int| |main_~#new_packet~0.base|) (+ |main_~#new_packet~0.offset| 4))) (= 0 |main_~#prio_queue~0.offset|))} assume #t~mem30 % 4294967296 > 0;havoc #t~mem30;call #t~mem31 := read~int(~#new_packet~0.base, 4 + ~#new_packet~0.offset, 4); {2574#(and (= 1 (select (select |#memory_int| |main_~#new_packet~0.base|) (+ |main_~#new_packet~0.offset| 4))) (= 0 |main_~#prio_queue~0.offset|))} is VALID [2018-11-23 13:02:19,752 INFO L273 TraceCheckUtils]: 16: Hoare triple {2574#(and (= 1 (select (select |#memory_int| |main_~#new_packet~0.base|) (+ |main_~#new_packet~0.offset| 4))) (= 0 |main_~#prio_queue~0.offset|))} assume 1 == #t~mem31 % 4294967296;havoc #t~mem31;call #t~mem32 := read~int(~#new_packet~0.base, ~#new_packet~0.offset, 4);call #t~mem33 := read~int(~#new_packet~0.base, 4 + ~#new_packet~0.offset, 4);call #t~mem34.base, #t~mem34.offset := read~$Pointer$(~#new_packet~0.base, 8 + ~#new_packet~0.offset, 4); {2575#(and (= 1 |main_#t~mem33|) (= 0 |main_~#prio_queue~0.offset|))} is VALID [2018-11-23 13:02:19,753 INFO L256 TraceCheckUtils]: 17: Hoare triple {2575#(and (= 1 |main_#t~mem33|) (= 0 |main_~#prio_queue~0.offset|))} call append_to_queue(#t~mem32, #t~mem33, #t~mem34.base, #t~mem34.offset, ~#prio_queue~0.base, ~#prio_queue~0.offset); {2568#true} is VALID [2018-11-23 13:02:19,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {2568#true} call ~#p.base, ~#p.offset := #Ultimate.alloc(12);call write~int(#in~p.size, ~#p.base, ~#p.offset, 4);call write~int(#in~p.prio, ~#p.base, 4 + ~#p.offset, 4);call write~$Pointer$(#in~p.payload.base, #in~p.payload.offset, ~#p.base, 8 + ~#p.offset, 4);~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(16);~node~0.base, ~node~0.offset := #t~malloc9.base, #t~malloc9.offset;call #t~mem10 := read~int(~#p.base, ~#p.offset, 4);call #t~mem11 := read~int(~#p.base, 4 + ~#p.offset, 4);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#p.base, 8 + ~#p.offset, 4);call write~int(#t~mem10, ~node~0.base, ~node~0.offset, 4);call write~int(#t~mem11, ~node~0.base, 4 + ~node~0.offset, 4);call write~$Pointer$(#t~mem12.base, #t~mem12.offset, ~node~0.base, 8 + ~node~0.offset, 4);havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem11;havoc #t~mem10;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~q.base, ~q.offset, 4);call write~$Pointer$(#t~mem13.base, #t~mem13.offset, ~node~0.base, 12 + ~node~0.offset, 4);havoc #t~mem13.base, #t~mem13.offset;call write~$Pointer$(~node~0.base, ~node~0.offset, ~q.base, ~q.offset, 4);call ULTIMATE.dealloc(~#p.base, ~#p.offset);havoc ~#p.base, ~#p.offset; {2576#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (or (= |append_to_queue_#in~q.offset| 4) (= |append_to_queue_#in~p.prio| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) 4))))} is VALID [2018-11-23 13:02:19,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {2576#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (or (= |append_to_queue_#in~q.offset| 4) (= |append_to_queue_#in~p.prio| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) 4))))} assume true; {2576#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (or (= |append_to_queue_#in~q.offset| 4) (= |append_to_queue_#in~p.prio| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) 4))))} is VALID [2018-11-23 13:02:19,760 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {2576#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (or (= |append_to_queue_#in~q.offset| 4) (= |append_to_queue_#in~p.prio| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) 4))))} {2575#(and (= 1 |main_#t~mem33|) (= 0 |main_~#prio_queue~0.offset|))} #125#return; {2577#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) 4)))} is VALID [2018-11-23 13:02:19,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {2577#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) 4)))} havoc #t~mem33;havoc #t~mem32;havoc #t~mem34.base, #t~mem34.offset; {2577#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) 4)))} is VALID [2018-11-23 13:02:19,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {2577#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) 4)))} call ULTIMATE.dealloc(~#new_packet~0.base, ~#new_packet~0.offset);havoc ~#new_packet~0.base, ~#new_packet~0.offset; {2577#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) 4)))} is VALID [2018-11-23 13:02:19,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {2577#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) 4)))} assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647; {2577#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) 4)))} is VALID [2018-11-23 13:02:19,763 INFO L273 TraceCheckUtils]: 24: Hoare triple {2577#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) 4)))} assume !(0 != #t~nondet28);havoc #t~nondet28; {2577#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) 4)))} is VALID [2018-11-23 13:02:19,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {2577#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#prio_queue~0.base|) |main_~#prio_queue~0.offset|)) 4)))} call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~#prio_queue~0.base, ~#prio_queue~0.offset, 4); {2578#(and (= 0 |main_#t~mem42.offset|) (= 1 (select (select |#memory_int| |main_#t~mem42.base|) 4)))} is VALID [2018-11-23 13:02:19,765 INFO L256 TraceCheckUtils]: 26: Hoare triple {2578#(and (= 0 |main_#t~mem42.offset|) (= 1 (select (select |#memory_int| |main_#t~mem42.base|) 4)))} call process_prio_queue(#t~mem42.base, #t~mem42.offset); {2579#(and (= 0 |process_prio_queue_#in~q.offset|) (= 1 (select (select |#memory_int| |process_prio_queue_#in~q.base|) 4)))} is VALID [2018-11-23 13:02:19,766 INFO L273 TraceCheckUtils]: 27: Hoare triple {2579#(and (= 0 |process_prio_queue_#in~q.offset|) (= 1 (select (select |#memory_int| |process_prio_queue_#in~q.base|) 4)))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~node~1.base, ~node~1.offset := ~q.base, ~q.offset; {2580#(= 1 (select (select |#memory_int| process_prio_queue_~node~1.base) (+ process_prio_queue_~node~1.offset 4)))} is VALID [2018-11-23 13:02:19,767 INFO L273 TraceCheckUtils]: 28: Hoare triple {2580#(= 1 (select (select |#memory_int| process_prio_queue_~node~1.base) (+ process_prio_queue_~node~1.offset 4)))} assume !!(~node~1.base != 0 || ~node~1.offset != 0);call #t~mem15 := read~int(~node~1.base, 4 + ~node~1.offset, 4);#t~short17 := 1 == #t~mem15 % 4294967296; {2581#|process_prio_queue_#t~short17|} is VALID [2018-11-23 13:02:19,768 INFO L273 TraceCheckUtils]: 29: Hoare triple {2581#|process_prio_queue_#t~short17|} assume !#t~short17;call #t~mem16 := read~int(~node~1.base, ~node~1.offset, 4);#t~short17 := #t~mem16 % 4294967296 < 500; {2569#false} is VALID [2018-11-23 13:02:19,768 INFO L273 TraceCheckUtils]: 30: Hoare triple {2569#false} assume !#t~short17;havoc #t~mem16;havoc #t~short17;havoc #t~mem15; {2569#false} is VALID [2018-11-23 13:02:19,768 INFO L273 TraceCheckUtils]: 31: Hoare triple {2569#false} assume !false; {2569#false} is VALID [2018-11-23 13:02:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:19,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:19,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:19,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:19,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:19,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:19,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 13:02:19,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 13:02:19,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:19,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:19,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:19,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-23 13:02:19,978 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:02:19,978 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_39|, |main_~#normal_queue~0.base|]. (let ((.cse0 (store |v_#valid_39| |main_~#prio_queue~0.base| 1))) (and (= |#valid| (store .cse0 |main_~#normal_queue~0.base| 1)) (= (select .cse0 |main_~#normal_queue~0.base|) 0) (= |main_~#prio_queue~0.offset| 0))) [2018-11-23 13:02:19,978 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#normal_queue~0.base|]. (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)) (= |main_~#prio_queue~0.offset| 0) (= (select |#valid| |main_~#prio_queue~0.base|) 1)) [2018-11-23 13:02:20,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:20,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:20,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:20,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-23 13:02:20,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:20,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:20,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2018-11-23 13:02:20,054 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:02:20,055 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_40|, |main_~#normal_queue~0.base|]. (and (= 1 (select |v_#valid_40| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)) (= 1 (select |v_#valid_40| |main_~#prio_queue~0.base|)) (= |#valid| (store |v_#valid_40| |main_~#new_packet~0.base| 1)) (= 0 (select |v_#valid_40| |main_~#new_packet~0.base|)) (= |main_~#prio_queue~0.offset| 0)) [2018-11-23 13:02:20,055 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#normal_queue~0.base|]. (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#new_packet~0.base|)) (not (= |main_~#new_packet~0.base| |main_~#normal_queue~0.base|)) (= |main_~#prio_queue~0.offset| 0) (= (select |#valid| |main_~#prio_queue~0.base|) 1) (= 1 (select |#valid| |main_~#new_packet~0.base|))) [2018-11-23 13:02:20,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:20,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:20,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:20,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:20,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-11-23 13:02:20,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:20,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:20,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:36 [2018-11-23 13:02:20,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 13:02:20,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-11-23 13:02:20,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:20,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:20,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:20,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:41 [2018-11-23 13:02:20,802 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:02:20,803 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#new_packet~0.base|, |main_~#new_packet~0.offset|, |main_~#normal_queue~0.base|, |v_receive_~#packet~0.base_6|]. (let ((.cse0 (select (select |#memory_int| |main_~#new_packet~0.base|) (+ |main_~#new_packet~0.offset| 4)))) (and (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)) (= 1 (mod .cse0 4294967296)) (not (= |main_~#prio_queue~0.base| |main_~#new_packet~0.base|)) (= |main_#t~mem33| .cse0) (= 0 (select |#valid| |v_receive_~#packet~0.base_6|)) (not (= |main_~#new_packet~0.base| |main_~#normal_queue~0.base|)) (= |main_~#prio_queue~0.offset| 0) (= 1 (select |#valid| |main_~#new_packet~0.base|)) (= (select |#valid| |main_~#prio_queue~0.base|) 1))) [2018-11-23 13:02:20,803 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#normal_queue~0.base|, |main_~#new_packet~0.base|, |v_receive_~#packet~0.base_6|]. (and (= 1 (mod |main_#t~mem33| 4294967296)) (= 1 (select |#valid| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#normal_queue~0.base|)) (not (= |main_~#prio_queue~0.base| |main_~#new_packet~0.base|)) (= 0 (select |#valid| |v_receive_~#packet~0.base_6|)) (not (= |main_~#new_packet~0.base| |main_~#normal_queue~0.base|)) (= |main_~#prio_queue~0.offset| 0) (= 1 (select |#valid| |main_~#new_packet~0.base|)) (= (select |#valid| |main_~#prio_queue~0.base|) 1)) [2018-11-23 13:02:21,857 WARN L180 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2018-11-23 13:02:21,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-11-23 13:02:21,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-11-23 13:02:21,953 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 13:02:22,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-11-23 13:02:22,237 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:22,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-11-23 13:02:22,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:22,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-23 13:02:22,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 13:02:22,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 41 [2018-11-23 13:02:22,536 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 6 xjuncts. [2018-11-23 13:02:22,615 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:02:22,670 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:02:22,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:02:22,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-11-23 13:02:22,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 13:02:22,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-11-23 13:02:22,898 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:22,961 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 13:02:23,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 13:02:23,124 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,144 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,187 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-11-23 13:02:23,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 13:02:23,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-11-23 13:02:23,508 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,526 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 13:02:23,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 13:02:23,585 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,600 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,616 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-11-23 13:02:23,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-11-23 13:02:23,652 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:23,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-23 13:02:23,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 45 [2018-11-23 13:02:23,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 39 [2018-11-23 13:02:24,063 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:24,064 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_2 input size 22 context size 22 output size 22 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:02:24,069 INFO L168 Benchmark]: Toolchain (without parser) took 108664.99 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -341.1 MB). Peak memory consumption was 710.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:24,070 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:24,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:24,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.21 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.5 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:24,071 INFO L168 Benchmark]: Boogie Preprocessor took 68.56 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:24,072 INFO L168 Benchmark]: RCFGBuilder took 1287.58 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:24,072 INFO L168 Benchmark]: TraceAbstraction took 106547.90 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 338.7 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 366.8 MB). Peak memory consumption was 705.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:24,075 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 636.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 119.21 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.5 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.56 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1287.58 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106547.90 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 338.7 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 366.8 MB). Peak memory consumption was 705.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_2 input size 22 context size 22 output size 22 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_2 input size 22 context size 22 output size 22: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...