/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi010_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:24:14,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:24:14,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:24:14,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:24:14,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:24:14,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:24:14,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:24:14,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:24:14,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:24:14,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:24:14,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:24:14,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:24:14,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:24:14,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:24:14,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:24:14,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:24:14,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:24:14,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:24:14,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:24:14,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:24:14,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:24:14,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:24:14,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:24:14,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:24:14,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:24:14,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:24:14,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:24:14,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:24:14,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:24:14,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:24:14,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:24:14,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:24:14,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:24:14,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:24:14,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:24:14,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:24:14,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:24:14,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:24:14,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:24:14,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:24:14,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:24:14,394 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:24:14,413 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:24:14,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:24:14,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:24:14,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:24:14,416 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:24:14,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:24:14,416 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:24:14,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:24:14,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:24:14,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:24:14,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:24:14,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:24:14,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:24:14,418 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:24:14,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:24:14,419 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:24:14,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:24:14,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:24:14,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:24:14,420 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:24:14,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:24:14,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:24:14,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:24:14,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:24:14,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:24:14,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:24:14,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:24:14,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:24:14,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:24:14,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:24:14,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:24:14,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:24:14,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:24:14,714 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:24:14,715 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:24:14,715 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010_pso.opt.i [2019-12-26 23:24:14,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2287794/a61f7093db4d4863a1332200cf2fc8bb/FLAGe1d0b54ae [2019-12-26 23:24:15,360 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:24:15,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010_pso.opt.i [2019-12-26 23:24:15,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2287794/a61f7093db4d4863a1332200cf2fc8bb/FLAGe1d0b54ae [2019-12-26 23:24:15,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2287794/a61f7093db4d4863a1332200cf2fc8bb [2019-12-26 23:24:15,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:24:15,646 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:24:15,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:24:15,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:24:15,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:24:15,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:24:15" (1/1) ... [2019-12-26 23:24:15,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:15, skipping insertion in model container [2019-12-26 23:24:15,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:24:15" (1/1) ... [2019-12-26 23:24:15,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:24:15,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:24:16,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:24:16,331 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:24:16,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:24:16,490 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:24:16,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16 WrapperNode [2019-12-26 23:24:16,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:24:16,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:24:16,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:24:16,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:24:16,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16" (1/1) ... [2019-12-26 23:24:16,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16" (1/1) ... [2019-12-26 23:24:16,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:24:16,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:24:16,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:24:16,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:24:16,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16" (1/1) ... [2019-12-26 23:24:16,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16" (1/1) ... [2019-12-26 23:24:16,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16" (1/1) ... [2019-12-26 23:24:16,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16" (1/1) ... [2019-12-26 23:24:16,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16" (1/1) ... [2019-12-26 23:24:16,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16" (1/1) ... [2019-12-26 23:24:16,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16" (1/1) ... [2019-12-26 23:24:16,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:24:16,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:24:16,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:24:16,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:24:16,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16" (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 [2019-12-26 23:24:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:24:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:24:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:24:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:24:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:24:16,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:24:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:24:16,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:24:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:24:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:24:16,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:24:16,699 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:24:17,715 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:24:17,715 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:24:17,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:24:17 BoogieIcfgContainer [2019-12-26 23:24:17,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:24:17,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:24:17,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:24:17,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:24:17,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:24:15" (1/3) ... [2019-12-26 23:24:17,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adf489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:24:17, skipping insertion in model container [2019-12-26 23:24:17,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:24:16" (2/3) ... [2019-12-26 23:24:17,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adf489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:24:17, skipping insertion in model container [2019-12-26 23:24:17,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:24:17" (3/3) ... [2019-12-26 23:24:17,726 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi010_pso.opt.i [2019-12-26 23:24:17,736 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:24:17,736 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:24:17,744 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:24:17,745 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:24:17,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,838 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,879 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,881 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,901 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,905 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:24:17,925 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:24:17,946 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:24:17,946 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:24:17,947 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:24:17,947 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:24:17,947 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:24:17,947 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:24:17,947 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:24:17,947 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:24:17,964 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-26 23:24:17,966 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-26 23:24:18,096 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-26 23:24:18,096 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:24:18,120 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-26 23:24:18,147 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-26 23:24:18,246 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-26 23:24:18,246 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:24:18,259 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-26 23:24:18,293 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-26 23:24:18,294 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:24:23,206 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:24:23,322 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 23:24:23,444 INFO L206 etLargeBlockEncoding]: Checked pairs total: 121847 [2019-12-26 23:24:23,444 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-26 23:24:23,447 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 102 places, 126 transitions [2019-12-26 23:24:24,914 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23697 states. [2019-12-26 23:24:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 23697 states. [2019-12-26 23:24:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:24:24,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:24,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:24:24,924 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash 960453199, now seen corresponding path program 1 times [2019-12-26 23:24:24,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:24,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151492366] [2019-12-26 23:24:24,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:25,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151492366] [2019-12-26 23:24:25,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:25,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:24:25,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646468691] [2019-12-26 23:24:25,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:24:25,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:25,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:24:25,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:24:25,211 INFO L87 Difference]: Start difference. First operand 23697 states. Second operand 3 states. [2019-12-26 23:24:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:25,662 INFO L93 Difference]: Finished difference Result 23505 states and 84597 transitions. [2019-12-26 23:24:25,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:24:25,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:24:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:25,902 INFO L225 Difference]: With dead ends: 23505 [2019-12-26 23:24:25,902 INFO L226 Difference]: Without dead ends: 22000 [2019-12-26 23:24:25,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:24:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22000 states. [2019-12-26 23:24:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22000 to 22000. [2019-12-26 23:24:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22000 states. [2019-12-26 23:24:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22000 states to 22000 states and 79119 transitions. [2019-12-26 23:24:27,928 INFO L78 Accepts]: Start accepts. Automaton has 22000 states and 79119 transitions. Word has length 5 [2019-12-26 23:24:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:27,929 INFO L462 AbstractCegarLoop]: Abstraction has 22000 states and 79119 transitions. [2019-12-26 23:24:27,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:24:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 22000 states and 79119 transitions. [2019-12-26 23:24:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:24:27,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:27,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:27,942 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:27,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:27,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1767797629, now seen corresponding path program 1 times [2019-12-26 23:24:27,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:27,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926892115] [2019-12-26 23:24:27,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:28,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926892115] [2019-12-26 23:24:28,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:28,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:24:28,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805420152] [2019-12-26 23:24:28,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:24:28,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:28,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:24:28,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:24:28,271 INFO L87 Difference]: Start difference. First operand 22000 states and 79119 transitions. Second operand 4 states. [2019-12-26 23:24:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:28,884 INFO L93 Difference]: Finished difference Result 34136 states and 117485 transitions. [2019-12-26 23:24:28,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:24:28,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:24:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:29,039 INFO L225 Difference]: With dead ends: 34136 [2019-12-26 23:24:29,039 INFO L226 Difference]: Without dead ends: 34120 [2019-12-26 23:24:29,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:24:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34120 states. [2019-12-26 23:24:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34120 to 32747. [2019-12-26 23:24:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32747 states. [2019-12-26 23:24:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32747 states to 32747 states and 113702 transitions. [2019-12-26 23:24:30,469 INFO L78 Accepts]: Start accepts. Automaton has 32747 states and 113702 transitions. Word has length 11 [2019-12-26 23:24:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:30,469 INFO L462 AbstractCegarLoop]: Abstraction has 32747 states and 113702 transitions. [2019-12-26 23:24:30,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:24:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 32747 states and 113702 transitions. [2019-12-26 23:24:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:24:30,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:30,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:30,472 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1354653160, now seen corresponding path program 1 times [2019-12-26 23:24:30,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:30,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485694030] [2019-12-26 23:24:30,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:31,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485694030] [2019-12-26 23:24:31,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:31,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:24:31,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039721423] [2019-12-26 23:24:31,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:24:31,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:31,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:24:31,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:24:31,944 INFO L87 Difference]: Start difference. First operand 32747 states and 113702 transitions. Second operand 4 states. [2019-12-26 23:24:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:32,367 INFO L93 Difference]: Finished difference Result 42448 states and 144693 transitions. [2019-12-26 23:24:32,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:24:32,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:24:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:32,536 INFO L225 Difference]: With dead ends: 42448 [2019-12-26 23:24:32,536 INFO L226 Difference]: Without dead ends: 42433 [2019-12-26 23:24:32,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:24:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42433 states. [2019-12-26 23:24:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42433 to 37509. [2019-12-26 23:24:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37509 states. [2019-12-26 23:24:33,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37509 states to 37509 states and 129444 transitions. [2019-12-26 23:24:33,949 INFO L78 Accepts]: Start accepts. Automaton has 37509 states and 129444 transitions. Word has length 14 [2019-12-26 23:24:33,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:33,950 INFO L462 AbstractCegarLoop]: Abstraction has 37509 states and 129444 transitions. [2019-12-26 23:24:33,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:24:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 37509 states and 129444 transitions. [2019-12-26 23:24:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:24:33,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:33,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:33,955 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:33,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:33,955 INFO L82 PathProgramCache]: Analyzing trace with hash 287658910, now seen corresponding path program 1 times [2019-12-26 23:24:33,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:33,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376628183] [2019-12-26 23:24:33,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:34,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376628183] [2019-12-26 23:24:34,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:34,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:24:34,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937843148] [2019-12-26 23:24:34,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:24:34,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:34,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:24:34,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:24:34,003 INFO L87 Difference]: Start difference. First operand 37509 states and 129444 transitions. Second operand 3 states. [2019-12-26 23:24:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:34,147 INFO L93 Difference]: Finished difference Result 35330 states and 121730 transitions. [2019-12-26 23:24:34,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:24:34,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 23:24:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:34,594 INFO L225 Difference]: With dead ends: 35330 [2019-12-26 23:24:34,594 INFO L226 Difference]: Without dead ends: 35330 [2019-12-26 23:24:34,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:24:34,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35330 states. [2019-12-26 23:24:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35330 to 35330. [2019-12-26 23:24:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35330 states. [2019-12-26 23:24:37,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35330 states to 35330 states and 121730 transitions. [2019-12-26 23:24:37,487 INFO L78 Accepts]: Start accepts. Automaton has 35330 states and 121730 transitions. Word has length 16 [2019-12-26 23:24:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:37,487 INFO L462 AbstractCegarLoop]: Abstraction has 35330 states and 121730 transitions. [2019-12-26 23:24:37,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:24:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 35330 states and 121730 transitions. [2019-12-26 23:24:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 23:24:37,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:37,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:37,501 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:37,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1416377548, now seen corresponding path program 1 times [2019-12-26 23:24:37,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:37,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991888495] [2019-12-26 23:24:37,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:37,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991888495] [2019-12-26 23:24:37,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:37,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:24:37,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795384929] [2019-12-26 23:24:37,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:24:37,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:37,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:24:37,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:24:37,615 INFO L87 Difference]: Start difference. First operand 35330 states and 121730 transitions. Second operand 5 states. [2019-12-26 23:24:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:38,341 INFO L93 Difference]: Finished difference Result 42336 states and 143476 transitions. [2019-12-26 23:24:38,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:24:38,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-26 23:24:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:38,423 INFO L225 Difference]: With dead ends: 42336 [2019-12-26 23:24:38,424 INFO L226 Difference]: Without dead ends: 42308 [2019-12-26 23:24:38,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:24:38,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42308 states. [2019-12-26 23:24:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42308 to 35180. [2019-12-26 23:24:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35180 states. [2019-12-26 23:24:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35180 states to 35180 states and 121282 transitions. [2019-12-26 23:24:39,538 INFO L78 Accepts]: Start accepts. Automaton has 35180 states and 121282 transitions. Word has length 20 [2019-12-26 23:24:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:39,538 INFO L462 AbstractCegarLoop]: Abstraction has 35180 states and 121282 transitions. [2019-12-26 23:24:39,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:24:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 35180 states and 121282 transitions. [2019-12-26 23:24:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 23:24:39,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:39,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:39,580 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:39,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:39,580 INFO L82 PathProgramCache]: Analyzing trace with hash -904071527, now seen corresponding path program 1 times [2019-12-26 23:24:39,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:39,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385425009] [2019-12-26 23:24:39,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:39,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385425009] [2019-12-26 23:24:39,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:39,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:24:39,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184662976] [2019-12-26 23:24:39,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:24:39,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:39,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:24:39,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:24:39,659 INFO L87 Difference]: Start difference. First operand 35180 states and 121282 transitions. Second operand 4 states. [2019-12-26 23:24:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:39,711 INFO L93 Difference]: Finished difference Result 5875 states and 16524 transitions. [2019-12-26 23:24:39,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:24:39,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-26 23:24:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:39,719 INFO L225 Difference]: With dead ends: 5875 [2019-12-26 23:24:39,720 INFO L226 Difference]: Without dead ends: 3697 [2019-12-26 23:24:39,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:24:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-12-26 23:24:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3697. [2019-12-26 23:24:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3697 states. [2019-12-26 23:24:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3697 states and 9023 transitions. [2019-12-26 23:24:39,779 INFO L78 Accepts]: Start accepts. Automaton has 3697 states and 9023 transitions. Word has length 30 [2019-12-26 23:24:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:39,780 INFO L462 AbstractCegarLoop]: Abstraction has 3697 states and 9023 transitions. [2019-12-26 23:24:39,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:24:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3697 states and 9023 transitions. [2019-12-26 23:24:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:24:39,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:39,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:39,787 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:39,787 INFO L82 PathProgramCache]: Analyzing trace with hash 927574064, now seen corresponding path program 1 times [2019-12-26 23:24:39,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:39,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674454480] [2019-12-26 23:24:39,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:39,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:39,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674454480] [2019-12-26 23:24:39,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:39,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:24:39,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090273615] [2019-12-26 23:24:39,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:24:39,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:39,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:24:39,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:24:39,881 INFO L87 Difference]: Start difference. First operand 3697 states and 9023 transitions. Second operand 5 states. [2019-12-26 23:24:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:40,000 INFO L93 Difference]: Finished difference Result 6071 states and 15015 transitions. [2019-12-26 23:24:40,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:24:40,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-26 23:24:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:40,008 INFO L225 Difference]: With dead ends: 6071 [2019-12-26 23:24:40,008 INFO L226 Difference]: Without dead ends: 4750 [2019-12-26 23:24:40,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:24:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4750 states. [2019-12-26 23:24:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4750 to 4750. [2019-12-26 23:24:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4750 states. [2019-12-26 23:24:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4750 states to 4750 states and 11868 transitions. [2019-12-26 23:24:40,078 INFO L78 Accepts]: Start accepts. Automaton has 4750 states and 11868 transitions. Word has length 41 [2019-12-26 23:24:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:40,079 INFO L462 AbstractCegarLoop]: Abstraction has 4750 states and 11868 transitions. [2019-12-26 23:24:40,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:24:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4750 states and 11868 transitions. [2019-12-26 23:24:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 23:24:40,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:40,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:40,088 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash -759882014, now seen corresponding path program 1 times [2019-12-26 23:24:40,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:40,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743582059] [2019-12-26 23:24:40,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:40,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743582059] [2019-12-26 23:24:40,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:40,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:24:40,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895054218] [2019-12-26 23:24:40,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:24:40,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:40,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:24:40,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:24:40,174 INFO L87 Difference]: Start difference. First operand 4750 states and 11868 transitions. Second operand 5 states. [2019-12-26 23:24:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:40,611 INFO L93 Difference]: Finished difference Result 5410 states and 13278 transitions. [2019-12-26 23:24:40,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:24:40,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-26 23:24:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:40,621 INFO L225 Difference]: With dead ends: 5410 [2019-12-26 23:24:40,621 INFO L226 Difference]: Without dead ends: 5410 [2019-12-26 23:24:40,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:24:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2019-12-26 23:24:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 5148. [2019-12-26 23:24:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5148 states. [2019-12-26 23:24:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 12759 transitions. [2019-12-26 23:24:40,676 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 12759 transitions. Word has length 42 [2019-12-26 23:24:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:40,677 INFO L462 AbstractCegarLoop]: Abstraction has 5148 states and 12759 transitions. [2019-12-26 23:24:40,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:24:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 12759 transitions. [2019-12-26 23:24:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 23:24:40,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:40,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:40,683 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:40,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:40,684 INFO L82 PathProgramCache]: Analyzing trace with hash -800932999, now seen corresponding path program 1 times [2019-12-26 23:24:40,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:40,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941335926] [2019-12-26 23:24:40,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:40,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941335926] [2019-12-26 23:24:40,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:40,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:24:40,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072405628] [2019-12-26 23:24:40,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:24:40,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:40,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:24:40,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:24:40,773 INFO L87 Difference]: Start difference. First operand 5148 states and 12759 transitions. Second operand 5 states. [2019-12-26 23:24:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:41,207 INFO L93 Difference]: Finished difference Result 6138 states and 14768 transitions. [2019-12-26 23:24:41,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:24:41,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-26 23:24:41,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:41,216 INFO L225 Difference]: With dead ends: 6138 [2019-12-26 23:24:41,217 INFO L226 Difference]: Without dead ends: 6138 [2019-12-26 23:24:41,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:24:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2019-12-26 23:24:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5202. [2019-12-26 23:24:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5202 states. [2019-12-26 23:24:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 12514 transitions. [2019-12-26 23:24:41,311 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 12514 transitions. Word has length 43 [2019-12-26 23:24:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:41,311 INFO L462 AbstractCegarLoop]: Abstraction has 5202 states and 12514 transitions. [2019-12-26 23:24:41,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:24:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 12514 transitions. [2019-12-26 23:24:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 23:24:41,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:41,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:41,321 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:41,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:41,321 INFO L82 PathProgramCache]: Analyzing trace with hash 551589791, now seen corresponding path program 1 times [2019-12-26 23:24:41,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:41,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995849505] [2019-12-26 23:24:41,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:41,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995849505] [2019-12-26 23:24:41,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:41,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:24:41,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36346014] [2019-12-26 23:24:41,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:24:41,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:41,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:24:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:24:41,418 INFO L87 Difference]: Start difference. First operand 5202 states and 12514 transitions. Second operand 5 states. [2019-12-26 23:24:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:41,476 INFO L93 Difference]: Finished difference Result 3468 states and 8399 transitions. [2019-12-26 23:24:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:24:41,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-26 23:24:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:41,483 INFO L225 Difference]: With dead ends: 3468 [2019-12-26 23:24:41,484 INFO L226 Difference]: Without dead ends: 3272 [2019-12-26 23:24:41,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:24:41,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2019-12-26 23:24:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 3137. [2019-12-26 23:24:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2019-12-26 23:24:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 7692 transitions. [2019-12-26 23:24:41,549 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 7692 transitions. Word has length 43 [2019-12-26 23:24:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:41,550 INFO L462 AbstractCegarLoop]: Abstraction has 3137 states and 7692 transitions. [2019-12-26 23:24:41,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:24:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 7692 transitions. [2019-12-26 23:24:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:24:41,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:41,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:41,558 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:41,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:41,559 INFO L82 PathProgramCache]: Analyzing trace with hash 856625615, now seen corresponding path program 1 times [2019-12-26 23:24:41,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:41,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094449555] [2019-12-26 23:24:41,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:41,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094449555] [2019-12-26 23:24:41,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:41,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:24:41,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784092597] [2019-12-26 23:24:41,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:24:41,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:41,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:24:41,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:24:41,689 INFO L87 Difference]: Start difference. First operand 3137 states and 7692 transitions. Second operand 4 states. [2019-12-26 23:24:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:41,724 INFO L93 Difference]: Finished difference Result 3830 states and 9227 transitions. [2019-12-26 23:24:41,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:24:41,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-26 23:24:41,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:41,728 INFO L225 Difference]: With dead ends: 3830 [2019-12-26 23:24:41,728 INFO L226 Difference]: Without dead ends: 764 [2019-12-26 23:24:41,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:24:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-26 23:24:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2019-12-26 23:24:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-12-26 23:24:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1638 transitions. [2019-12-26 23:24:41,743 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1638 transitions. Word has length 59 [2019-12-26 23:24:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:41,743 INFO L462 AbstractCegarLoop]: Abstraction has 764 states and 1638 transitions. [2019-12-26 23:24:41,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:24:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1638 transitions. [2019-12-26 23:24:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:24:41,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:41,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:41,746 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:41,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:41,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1805007936, now seen corresponding path program 1 times [2019-12-26 23:24:41,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:41,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864331966] [2019-12-26 23:24:41,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:41,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864331966] [2019-12-26 23:24:41,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:41,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:24:41,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683783418] [2019-12-26 23:24:41,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:24:41,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:41,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:24:41,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:24:41,897 INFO L87 Difference]: Start difference. First operand 764 states and 1638 transitions. Second operand 8 states. [2019-12-26 23:24:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:42,167 INFO L93 Difference]: Finished difference Result 2344 states and 4930 transitions. [2019-12-26 23:24:42,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:24:42,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-26 23:24:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:42,169 INFO L225 Difference]: With dead ends: 2344 [2019-12-26 23:24:42,169 INFO L226 Difference]: Without dead ends: 1622 [2019-12-26 23:24:42,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:24:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-12-26 23:24:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 895. [2019-12-26 23:24:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-26 23:24:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1903 transitions. [2019-12-26 23:24:42,181 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1903 transitions. Word has length 59 [2019-12-26 23:24:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:42,182 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1903 transitions. [2019-12-26 23:24:42,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:24:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1903 transitions. [2019-12-26 23:24:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:24:42,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:42,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:42,183 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:42,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:42,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1971095894, now seen corresponding path program 2 times [2019-12-26 23:24:42,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:42,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170877453] [2019-12-26 23:24:42,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:42,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170877453] [2019-12-26 23:24:42,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:42,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:24:42,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605940858] [2019-12-26 23:24:42,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:24:42,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:42,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:24:42,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:24:42,354 INFO L87 Difference]: Start difference. First operand 895 states and 1903 transitions. Second operand 10 states. [2019-12-26 23:24:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:43,099 INFO L93 Difference]: Finished difference Result 1887 states and 4038 transitions. [2019-12-26 23:24:43,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 23:24:43,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-26 23:24:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:43,102 INFO L225 Difference]: With dead ends: 1887 [2019-12-26 23:24:43,103 INFO L226 Difference]: Without dead ends: 1887 [2019-12-26 23:24:43,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:24:43,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2019-12-26 23:24:43,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1023. [2019-12-26 23:24:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-12-26 23:24:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 2214 transitions. [2019-12-26 23:24:43,117 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 2214 transitions. Word has length 59 [2019-12-26 23:24:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:43,117 INFO L462 AbstractCegarLoop]: Abstraction has 1023 states and 2214 transitions. [2019-12-26 23:24:43,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:24:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 2214 transitions. [2019-12-26 23:24:43,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:24:43,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:43,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:43,120 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:43,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:43,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1333119268, now seen corresponding path program 3 times [2019-12-26 23:24:43,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:43,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429940604] [2019-12-26 23:24:43,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:43,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429940604] [2019-12-26 23:24:43,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:43,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:24:43,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800710163] [2019-12-26 23:24:43,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:24:43,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:43,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:24:43,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:24:43,213 INFO L87 Difference]: Start difference. First operand 1023 states and 2214 transitions. Second operand 6 states. [2019-12-26 23:24:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:43,629 INFO L93 Difference]: Finished difference Result 1310 states and 2782 transitions. [2019-12-26 23:24:43,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:24:43,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-26 23:24:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:43,638 INFO L225 Difference]: With dead ends: 1310 [2019-12-26 23:24:43,638 INFO L226 Difference]: Without dead ends: 1310 [2019-12-26 23:24:43,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:24:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-12-26 23:24:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1029. [2019-12-26 23:24:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-12-26 23:24:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 2225 transitions. [2019-12-26 23:24:43,653 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 2225 transitions. Word has length 59 [2019-12-26 23:24:43,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:43,654 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 2225 transitions. [2019-12-26 23:24:43,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:24:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 2225 transitions. [2019-12-26 23:24:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:24:43,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:43,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:43,656 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash -320938732, now seen corresponding path program 4 times [2019-12-26 23:24:43,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:43,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15701366] [2019-12-26 23:24:43,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:24:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:24:43,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15701366] [2019-12-26 23:24:43,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:24:43,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:24:43,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042937479] [2019-12-26 23:24:43,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:24:43,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:24:43,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:24:43,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:24:43,793 INFO L87 Difference]: Start difference. First operand 1029 states and 2225 transitions. Second operand 3 states. [2019-12-26 23:24:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:24:43,812 INFO L93 Difference]: Finished difference Result 1028 states and 2223 transitions. [2019-12-26 23:24:43,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:24:43,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 23:24:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:24:43,814 INFO L225 Difference]: With dead ends: 1028 [2019-12-26 23:24:43,814 INFO L226 Difference]: Without dead ends: 1028 [2019-12-26 23:24:43,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:24:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-12-26 23:24:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 902. [2019-12-26 23:24:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-12-26 23:24:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1983 transitions. [2019-12-26 23:24:43,829 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1983 transitions. Word has length 59 [2019-12-26 23:24:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:24:43,830 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1983 transitions. [2019-12-26 23:24:43,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:24:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1983 transitions. [2019-12-26 23:24:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:24:43,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:24:43,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:24:43,832 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:24:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:24:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1249946427, now seen corresponding path program 1 times [2019-12-26 23:24:43,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:24:43,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416601816] [2019-12-26 23:24:43,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:24:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:24:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:24:43,993 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:24:43,995 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:24:43,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff0_thd2~0_427) (= 0 v_~__unbuffered_p0_EAX~0_40) (= v_~y$r_buff0_thd0~0_102 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= 0 v_~y$w_buff0~0_194) (= v_~main$tmp_guard0~0_27 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1767~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1767~0.base_19|) |v_ULTIMATE.start_main_~#t1767~0.offset_14| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1767~0.base_19|) (= v_~y$read_delayed~0_6 0) (= v_~y$r_buff1_thd1~0_255 0) (= v_~y$flush_delayed~0_195 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_ULTIMATE.start_main_~#t1767~0.offset_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_242 0) (= 0 v_~weak$$choice0~0_161) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1767~0.base_19| 4) |v_#length_17|) (= v_~y$r_buff0_thd1~0_290 0) (= v_~main$tmp_guard1~0_32 0) (= v_~x~0_50 0) (= 0 v_~__unbuffered_cnt~0_49) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1~0_196 0) (= v_~y$w_buff0_used~0_766 0) (= v_~y$r_buff1_thd0~0_184 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~__unbuffered_p1_EBX~0_32 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1767~0.base_19| 1)) (= v_~y~0_216 0) (= v_~y$w_buff1_used~0_425 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1767~0.base_19|)) (= 0 v_~y$r_buff1_thd2~0_284) (= v_~y$mem_tmp~0_173 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1767~0.offset=|v_ULTIMATE.start_main_~#t1767~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_766, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_15|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1767~0.base=|v_ULTIMATE.start_main_~#t1767~0.base_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_255, ~y$mem_tmp~0=v_~y$mem_tmp~0_173, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_~#t1768~0.offset=|v_ULTIMATE.start_main_~#t1768~0.offset_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_194, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_195, #length=|v_#length_17|, ~y~0=v_~y~0_216, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ULTIMATE.start_main_~#t1768~0.base=|v_ULTIMATE.start_main_~#t1768~0.base_17|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_129|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_84|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_284, ~weak$$choice0~0=v_~weak$$choice0~0_161, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_198|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_30|, ~y$w_buff1~0=v_~y$w_buff1~0_196, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_102, #valid=|v_#valid_45|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_427, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_184, ~x~0=v_~x~0_50, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_425} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1767~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ULTIMATE.start_main_~#t1767~0.base, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1768~0.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1768~0.base, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:24:44,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-1-->L812: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1768~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1768~0.base_11|) |v_ULTIMATE.start_main_~#t1768~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1768~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1768~0.offset_10|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1768~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1768~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1768~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1768~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1768~0.offset=|v_ULTIMATE.start_main_~#t1768~0.offset_10|, ULTIMATE.start_main_~#t1768~0.base=|v_ULTIMATE.start_main_~#t1768~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1768~0.offset, ULTIMATE.start_main_~#t1768~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 23:24:44,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_~y$w_buff0_used~0_154 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| 1) (= 1 v_~y$w_buff0~0_41) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_8) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_~y$w_buff1_used~0_78 v_~y$w_buff0_used~0_155) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_8|) (= 0 (mod v_~y$w_buff1_used~0_78 256)) (= v_~y$w_buff0~0_42 v_~y$w_buff1~0_30)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~y$w_buff0~0=v_~y$w_buff0~0_42, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_30, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_8, ~y$w_buff0~0=v_~y$w_buff0~0_41, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:24:44,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] L772-2-->L772-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1494086935 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1494086935 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite29_Out1494086935| |P1Thread1of1ForFork1_#t~ite28_Out1494086935|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~y$w_buff0~0_In1494086935 |P1Thread1of1ForFork1_#t~ite28_Out1494086935|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out1494086935| ~y$w_buff1~0_In1494086935) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1494086935, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1494086935, ~y$w_buff0~0=~y$w_buff0~0_In1494086935, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1494086935} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1494086935|, ~y$w_buff1~0=~y$w_buff1~0_In1494086935, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1494086935, ~y$w_buff0~0=~y$w_buff0~0_In1494086935, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1494086935, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1494086935|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-26 23:24:44,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L777-->L778: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_69 256))) (= v_~y$r_buff0_thd2~0_142 v_~y$r_buff0_thd2~0_141)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_142, ~weak$$choice2~0=v_~weak$$choice2~0_69} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_141, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_11|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_13|, ~weak$$choice2~0=v_~weak$$choice2~0_69} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-26 23:24:44,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1969028262 256) 0))) (or (and (= ~y$mem_tmp~0_In-1969028262 |P1Thread1of1ForFork1_#t~ite48_Out-1969028262|) (not .cse0)) (and .cse0 (= ~y~0_In-1969028262 |P1Thread1of1ForFork1_#t~ite48_Out-1969028262|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1969028262, ~y$flush_delayed~0=~y$flush_delayed~0_In-1969028262, ~y~0=~y~0_In-1969028262} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1969028262, ~y$flush_delayed~0=~y$flush_delayed~0_In-1969028262, ~y~0=~y~0_In-1969028262, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1969028262|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-26 23:24:44,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1521966313 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out1521966313| ~y$mem_tmp~0_In1521966313) (not .cse0)) (and (= ~y~0_In1521966313 |P0Thread1of1ForFork0_#t~ite25_Out1521966313|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1521966313, ~y$flush_delayed~0=~y$flush_delayed~0_In1521966313, ~y~0=~y~0_In1521966313} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1521966313, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1521966313|, ~y$flush_delayed~0=~y$flush_delayed~0_In1521966313, ~y~0=~y~0_In1521966313} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-26 23:24:44,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L744-2-->P0EXIT: Formula: (and (= v_~y$flush_delayed~0_168 0) (= v_~y~0_183 |v_P0Thread1of1ForFork0_#t~ite25_32|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_31|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_168, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_183} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-26 23:24:44,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-166548014 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-166548014 256)))) (or (and (= ~y$w_buff0_used~0_In-166548014 |P1Thread1of1ForFork1_#t~ite51_Out-166548014|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-166548014|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-166548014, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-166548014} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-166548014, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-166548014|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-166548014} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-26 23:24:44,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In112110287 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In112110287 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In112110287 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In112110287 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out112110287| ~y$w_buff1_used~0_In112110287) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite52_Out112110287| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In112110287, ~y$w_buff0_used~0=~y$w_buff0_used~0_In112110287, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In112110287, ~y$w_buff1_used~0=~y$w_buff1_used~0_In112110287} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In112110287, ~y$w_buff0_used~0=~y$w_buff0_used~0_In112110287, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out112110287|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In112110287, ~y$w_buff1_used~0=~y$w_buff1_used~0_In112110287} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-26 23:24:44,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In56880837 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In56880837 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd2~0_Out56880837 0)) (and (= ~y$r_buff0_thd2~0_In56880837 ~y$r_buff0_thd2~0_Out56880837) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In56880837, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In56880837} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out56880837|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In56880837, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out56880837} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:24:44,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-118041958 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-118041958 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-118041958 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-118041958 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite54_Out-118041958| ~y$r_buff1_thd2~0_In-118041958)) (and (= |P1Thread1of1ForFork1_#t~ite54_Out-118041958| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-118041958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-118041958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-118041958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-118041958} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-118041958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-118041958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-118041958, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-118041958|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-118041958} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-26 23:24:44,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= v_~y$r_buff1_thd2~0_210 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_210, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:24:44,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L816-->L818-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_203 256)) (= (mod v_~y$r_buff0_thd0~0_26 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:24:44,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L818-2-->L818-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1658330612 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1658330612 256)))) (or (and (= ~y$w_buff1~0_In1658330612 |ULTIMATE.start_main_#t~ite57_Out1658330612|) (not .cse0) (not .cse1)) (and (= ~y~0_In1658330612 |ULTIMATE.start_main_#t~ite57_Out1658330612|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1658330612, ~y~0=~y~0_In1658330612, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1658330612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658330612} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1658330612, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1658330612|, ~y~0=~y~0_In1658330612, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1658330612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658330612} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-26 23:24:44,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L818-4-->L819: Formula: (= v_~y~0_45 |v_ULTIMATE.start_main_#t~ite57_16|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_16|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_26|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_15|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-26 23:24:44,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In726568168 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In726568168 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out726568168| 0)) (and (= |ULTIMATE.start_main_#t~ite59_Out726568168| ~y$w_buff0_used~0_In726568168) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In726568168, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In726568168} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In726568168, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In726568168, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out726568168|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-26 23:24:44,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In200947945 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In200947945 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In200947945 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In200947945 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In200947945 |ULTIMATE.start_main_#t~ite60_Out200947945|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out200947945|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In200947945, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In200947945, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In200947945, ~y$w_buff1_used~0=~y$w_buff1_used~0_In200947945} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out200947945|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In200947945, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In200947945, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In200947945, ~y$w_buff1_used~0=~y$w_buff1_used~0_In200947945} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-26 23:24:44,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In827019245 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In827019245 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out827019245| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite61_Out827019245| ~y$r_buff0_thd0~0_In827019245)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In827019245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In827019245} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out827019245|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In827019245, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In827019245} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-26 23:24:44,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In40336419 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In40336419 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In40336419 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In40336419 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out40336419|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out40336419| ~y$r_buff1_thd0~0_In40336419)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In40336419, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In40336419, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In40336419, ~y$w_buff1_used~0=~y$w_buff1_used~0_In40336419} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out40336419|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In40336419, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In40336419, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In40336419, ~y$w_buff1_used~0=~y$w_buff1_used~0_In40336419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-26 23:24:44,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y$r_buff1_thd0~0_164 |v_ULTIMATE.start_main_#t~ite62_41|) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_23 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_164, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:24:44,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:24:44 BasicIcfg [2019-12-26 23:24:44,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:24:44,165 INFO L168 Benchmark]: Toolchain (without parser) took 28519.34 ms. Allocated memory was 138.4 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 101.6 MB in the beginning and 458.2 MB in the end (delta: -356.6 MB). Peak memory consumption was 927.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:24:44,166 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:24:44,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.16 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 155.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:24:44,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.65 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:24:44,173 INFO L168 Benchmark]: Boogie Preprocessor took 43.44 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:24:44,174 INFO L168 Benchmark]: RCFGBuilder took 1111.18 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 97.5 MB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:24:44,174 INFO L168 Benchmark]: TraceAbstraction took 26444.39 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 96.9 MB in the beginning and 458.2 MB in the end (delta: -361.4 MB). Peak memory consumption was 859.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:24:44,177 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.16 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 155.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.65 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.44 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1111.18 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 97.5 MB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26444.39 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 96.9 MB in the beginning and 458.2 MB in the end (delta: -361.4 MB). Peak memory consumption was 859.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 178 ProgramPointsBefore, 102 ProgramPointsAfterwards, 227 TransitionsBefore, 126 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 9537 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 279 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 121847 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1767, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] FCALL, FORK 0 pthread_create(&t1768, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L763] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L764] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = (_Bool)1 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 [L784] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2925 SDtfs, 3327 SDslu, 5355 SDs, 0 SdLazy, 2823 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37509occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 16756 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 545 ConstructedInterpolants, 0 QuantifiedInterpolants, 76241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...