/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:31:48,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:31:48,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:31:48,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:31:48,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:31:48,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:31:48,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:31:48,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:31:48,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:31:48,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:31:48,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:31:48,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:31:48,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:31:48,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:31:48,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:31:48,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:31:48,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:31:48,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:31:48,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:31:48,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:31:48,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:31:48,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:31:48,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:31:48,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:31:48,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:31:48,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:31:48,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:31:48,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:31:48,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:31:48,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:31:48,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:31:48,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:31:48,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:31:48,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:31:48,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:31:48,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:31:48,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:31:48,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:31:48,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:31:48,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:31:48,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:31:48,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:31:48,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:31:48,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:31:48,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:31:48,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:31:48,637 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:31:48,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:31:48,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:31:48,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:31:48,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:31:48,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:31:48,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:31:48,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:31:48,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:31:48,639 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:31:48,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:31:48,639 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:31:48,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:31:48,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:31:48,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:31:48,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:31:48,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:31:48,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:31:48,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:31:48,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:31:48,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:31:48,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:31:48,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:31:48,644 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:31:48,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:31:48,644 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:31:48,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:31:48,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:31:48,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:31:48,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:31:48,932 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:31:48,932 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:31:48,933 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2019-12-27 17:31:48,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0f0182f/74d64b01fe7f4e4488f07d5030fad60e/FLAG75270c455 [2019-12-27 17:31:49,532 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:31:49,533 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2019-12-27 17:31:49,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0f0182f/74d64b01fe7f4e4488f07d5030fad60e/FLAG75270c455 [2019-12-27 17:31:49,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0f0182f/74d64b01fe7f4e4488f07d5030fad60e [2019-12-27 17:31:49,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:31:49,803 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:31:49,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:31:49,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:31:49,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:31:49,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:31:49" (1/1) ... [2019-12-27 17:31:49,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2651ab3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:49, skipping insertion in model container [2019-12-27 17:31:49,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:31:49" (1/1) ... [2019-12-27 17:31:49,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:31:49,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:31:50,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:31:50,435 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:31:50,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:31:50,588 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:31:50,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50 WrapperNode [2019-12-27 17:31:50,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:31:50,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:31:50,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:31:50,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:31:50,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50" (1/1) ... [2019-12-27 17:31:50,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50" (1/1) ... [2019-12-27 17:31:50,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:31:50,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:31:50,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:31:50,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:31:50,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50" (1/1) ... [2019-12-27 17:31:50,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50" (1/1) ... [2019-12-27 17:31:50,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50" (1/1) ... [2019-12-27 17:31:50,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50" (1/1) ... [2019-12-27 17:31:50,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50" (1/1) ... [2019-12-27 17:31:50,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50" (1/1) ... [2019-12-27 17:31:50,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50" (1/1) ... [2019-12-27 17:31:50,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:31:50,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:31:50,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:31:50,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:31:50,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50" (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-27 17:31:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:31:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:31:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:31:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:31:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:31:50,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:31:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:31:50,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:31:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:31:50,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:31:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:31:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:31:50,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:31:50,769 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:31:51,465 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:31:51,465 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:31:51,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:31:51 BoogieIcfgContainer [2019-12-27 17:31:51,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:31:51,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:31:51,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:31:51,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:31:51,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:31:49" (1/3) ... [2019-12-27 17:31:51,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6c2af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:31:51, skipping insertion in model container [2019-12-27 17:31:51,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:50" (2/3) ... [2019-12-27 17:31:51,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6c2af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:31:51, skipping insertion in model container [2019-12-27 17:31:51,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:31:51" (3/3) ... [2019-12-27 17:31:51,475 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.opt.i [2019-12-27 17:31:51,485 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:31:51,485 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:31:51,496 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:31:51,497 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:31:51,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,531 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,532 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,533 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,545 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,545 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,546 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,546 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,546 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,557 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,559 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,559 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:51,585 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:31:51,625 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:31:51,625 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:31:51,625 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:31:51,626 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:31:51,629 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:31:51,630 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:31:51,630 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:31:51,630 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:31:51,662 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 17:31:51,664 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 17:31:51,760 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 17:31:51,760 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:31:51,774 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:31:51,793 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 17:31:51,866 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 17:31:51,867 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:31:51,873 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:31:51,886 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 17:31:51,887 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:31:56,748 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 17:31:56,865 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-27 17:31:56,865 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 17:31:56,868 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 17:31:57,944 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-27 17:31:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-27 17:31:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 17:31:57,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:31:57,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:31:57,953 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:31:57,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:31:57,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-27 17:31:57,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:31:57,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157386038] [2019-12-27 17:31:57,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:31:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:31:58,234 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-27 17:31:58,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157386038] [2019-12-27 17:31:58,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:31:58,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:31:58,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1087964864] [2019-12-27 17:31:58,237 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:31:58,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:31:58,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 17:31:58,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:31:58,262 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:31:58,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:31:58,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:31:58,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:31:58,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:31:58,280 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-27 17:31:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:31:58,736 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-27 17:31:58,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:31:58,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 17:31:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:31:58,930 INFO L225 Difference]: With dead ends: 16398 [2019-12-27 17:31:58,930 INFO L226 Difference]: Without dead ends: 16062 [2019-12-27 17:31:58,935 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-27 17:31:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-27 17:32:00,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-27 17:32:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-27 17:32:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-27 17:32:00,319 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-27 17:32:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:00,320 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-27 17:32:00,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:32:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-27 17:32:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:32:00,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:00,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:32:00,325 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:00,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:00,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-27 17:32:00,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:00,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201750718] [2019-12-27 17:32:00,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:00,434 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-27 17:32:00,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201750718] [2019-12-27 17:32:00,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:00,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:32:00,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1369946669] [2019-12-27 17:32:00,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:00,438 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:00,449 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 17:32:00,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:00,495 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:32:00,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:32:00,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:00,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:32:00,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:32:00,501 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 5 states. [2019-12-27 17:32:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:01,361 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-27 17:32:01,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:32:01,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 17:32:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:01,475 INFO L225 Difference]: With dead ends: 24942 [2019-12-27 17:32:01,476 INFO L226 Difference]: Without dead ends: 24928 [2019-12-27 17:32:01,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:32:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-27 17:32:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-27 17:32:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-27 17:32:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-27 17:32:02,370 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-27 17:32:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:02,370 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-27 17:32:02,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:32:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-27 17:32:02,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:32:02,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:02,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:32:02,375 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:02,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-27 17:32:02,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:02,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139499906] [2019-12-27 17:32:02,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:02,439 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-27 17:32:02,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139499906] [2019-12-27 17:32:02,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:02,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:32:02,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1874535110] [2019-12-27 17:32:02,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:02,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:02,444 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:32:02,444 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:02,444 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:02,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:32:02,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:02,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:32:02,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:32:02,445 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 3 states. [2019-12-27 17:32:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:02,510 INFO L93 Difference]: Finished difference Result 12675 states and 40338 transitions. [2019-12-27 17:32:02,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:32:02,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:32:02,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:02,554 INFO L225 Difference]: With dead ends: 12675 [2019-12-27 17:32:02,554 INFO L226 Difference]: Without dead ends: 12675 [2019-12-27 17:32:02,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-27 17:32:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-27 17:32:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 12675. [2019-12-27 17:32:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2019-12-27 17:32:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 40338 transitions. [2019-12-27 17:32:03,794 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 40338 transitions. Word has length 13 [2019-12-27 17:32:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:03,794 INFO L462 AbstractCegarLoop]: Abstraction has 12675 states and 40338 transitions. [2019-12-27 17:32:03,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:32:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 40338 transitions. [2019-12-27 17:32:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:32:03,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:03,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:32:03,797 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:03,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1884008947, now seen corresponding path program 1 times [2019-12-27 17:32:03,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:03,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645965698] [2019-12-27 17:32:03,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:03,886 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-27 17:32:03,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645965698] [2019-12-27 17:32:03,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:03,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:32:03,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [951086794] [2019-12-27 17:32:03,891 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:03,892 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:03,896 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 17:32:03,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:03,896 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:03,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:32:03,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:03,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:32:03,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:32:03,897 INFO L87 Difference]: Start difference. First operand 12675 states and 40338 transitions. Second operand 4 states. [2019-12-27 17:32:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:03,920 INFO L93 Difference]: Finished difference Result 1939 states and 4540 transitions. [2019-12-27 17:32:03,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:32:03,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 17:32:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:03,927 INFO L225 Difference]: With dead ends: 1939 [2019-12-27 17:32:03,928 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 17:32:03,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:32:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 17:32:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-27 17:32:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-27 17:32:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4540 transitions. [2019-12-27 17:32:03,962 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4540 transitions. Word has length 14 [2019-12-27 17:32:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:03,962 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4540 transitions. [2019-12-27 17:32:03,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:32:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4540 transitions. [2019-12-27 17:32:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:32:03,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:03,965 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] [2019-12-27 17:32:03,965 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:03,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:03,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1748149180, now seen corresponding path program 1 times [2019-12-27 17:32:03,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:03,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952701367] [2019-12-27 17:32:03,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:04,027 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-27 17:32:04,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952701367] [2019-12-27 17:32:04,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:04,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:32:04,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2031113033] [2019-12-27 17:32:04,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:04,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:04,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 170 transitions. [2019-12-27 17:32:04,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:04,071 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:32:04,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:32:04,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:32:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:32:04,073 INFO L87 Difference]: Start difference. First operand 1939 states and 4540 transitions. Second operand 6 states. [2019-12-27 17:32:04,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:04,104 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-27 17:32:04,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:32:04,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 17:32:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:04,106 INFO L225 Difference]: With dead ends: 653 [2019-12-27 17:32:04,106 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 17:32:04,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:32:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 17:32:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-27 17:32:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 17:32:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-27 17:32:04,116 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-27 17:32:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:04,117 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-27 17:32:04,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:32:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-27 17:32:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:32:04,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:04,120 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] [2019-12-27 17:32:04,120 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:04,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:04,120 INFO L82 PathProgramCache]: Analyzing trace with hash 306322931, now seen corresponding path program 1 times [2019-12-27 17:32:04,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:04,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570281901] [2019-12-27 17:32:04,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:04,219 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-27 17:32:04,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570281901] [2019-12-27 17:32:04,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:04,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:32:04,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [254358721] [2019-12-27 17:32:04,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:04,238 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:04,287 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 128 transitions. [2019-12-27 17:32:04,287 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:04,288 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:04,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:32:04,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:04,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:32:04,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:32:04,289 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-27 17:32:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:04,342 INFO L93 Difference]: Finished difference Result 607 states and 1414 transitions. [2019-12-27 17:32:04,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:32:04,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 17:32:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:04,344 INFO L225 Difference]: With dead ends: 607 [2019-12-27 17:32:04,344 INFO L226 Difference]: Without dead ends: 607 [2019-12-27 17:32:04,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:32:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-27 17:32:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-12-27 17:32:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-27 17:32:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1410 transitions. [2019-12-27 17:32:04,354 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1410 transitions. Word has length 55 [2019-12-27 17:32:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:04,355 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1410 transitions. [2019-12-27 17:32:04,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:32:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1410 transitions. [2019-12-27 17:32:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:32:04,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:04,357 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] [2019-12-27 17:32:04,357 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-27 17:32:04,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:04,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026625098] [2019-12-27 17:32:04,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:04,467 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-27 17:32:04,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026625098] [2019-12-27 17:32:04,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:04,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:32:04,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1328292452] [2019-12-27 17:32:04,468 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:04,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:04,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 128 transitions. [2019-12-27 17:32:04,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:04,609 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:32:04,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:32:04,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:04,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:32:04,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:32:04,611 INFO L87 Difference]: Start difference. First operand 603 states and 1410 transitions. Second operand 5 states. [2019-12-27 17:32:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:04,844 INFO L93 Difference]: Finished difference Result 892 states and 2082 transitions. [2019-12-27 17:32:04,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:32:04,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 17:32:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:04,853 INFO L225 Difference]: With dead ends: 892 [2019-12-27 17:32:04,853 INFO L226 Difference]: Without dead ends: 892 [2019-12-27 17:32:04,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-27 17:32:04,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-12-27 17:32:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 717. [2019-12-27 17:32:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-12-27 17:32:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1691 transitions. [2019-12-27 17:32:04,871 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1691 transitions. Word has length 55 [2019-12-27 17:32:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:04,872 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1691 transitions. [2019-12-27 17:32:04,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:32:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1691 transitions. [2019-12-27 17:32:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:32:04,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:04,875 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] [2019-12-27 17:32:04,875 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash 297273929, now seen corresponding path program 2 times [2019-12-27 17:32:04,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:04,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616318012] [2019-12-27 17:32:04,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:05,038 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-27 17:32:05,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616318012] [2019-12-27 17:32:05,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:05,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:32:05,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292613692] [2019-12-27 17:32:05,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:05,055 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:05,103 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 126 transitions. [2019-12-27 17:32:05,104 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:05,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:32:05,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:32:05,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:05,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:32:05,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:32:05,187 INFO L87 Difference]: Start difference. First operand 717 states and 1691 transitions. Second operand 10 states. [2019-12-27 17:32:06,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:06,268 INFO L93 Difference]: Finished difference Result 1612 states and 3598 transitions. [2019-12-27 17:32:06,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:32:06,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 17:32:06,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:06,273 INFO L225 Difference]: With dead ends: 1612 [2019-12-27 17:32:06,274 INFO L226 Difference]: Without dead ends: 1612 [2019-12-27 17:32:06,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:32:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2019-12-27 17:32:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 759. [2019-12-27 17:32:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-27 17:32:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1794 transitions. [2019-12-27 17:32:06,294 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1794 transitions. Word has length 55 [2019-12-27 17:32:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:06,295 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1794 transitions. [2019-12-27 17:32:06,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:32:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1794 transitions. [2019-12-27 17:32:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:32:06,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:06,297 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] [2019-12-27 17:32:06,298 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1649215159, now seen corresponding path program 3 times [2019-12-27 17:32:06,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:06,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716132561] [2019-12-27 17:32:06,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:06,429 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-27 17:32:06,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716132561] [2019-12-27 17:32:06,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:06,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:32:06,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [170942156] [2019-12-27 17:32:06,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:06,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:06,494 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 119 transitions. [2019-12-27 17:32:06,495 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:06,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:32:06,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:32:06,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:06,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:32:06,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:32:06,497 INFO L87 Difference]: Start difference. First operand 759 states and 1794 transitions. Second operand 6 states. [2019-12-27 17:32:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:06,558 INFO L93 Difference]: Finished difference Result 1096 states and 2421 transitions. [2019-12-27 17:32:06,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:32:06,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 17:32:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:06,560 INFO L225 Difference]: With dead ends: 1096 [2019-12-27 17:32:06,560 INFO L226 Difference]: Without dead ends: 695 [2019-12-27 17:32:06,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:32:06,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-12-27 17:32:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2019-12-27 17:32:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-12-27 17:32:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1608 transitions. [2019-12-27 17:32:06,572 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1608 transitions. Word has length 55 [2019-12-27 17:32:06,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:06,572 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1608 transitions. [2019-12-27 17:32:06,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:32:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1608 transitions. [2019-12-27 17:32:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:32:06,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:06,575 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] [2019-12-27 17:32:06,575 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:06,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:06,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1541862407, now seen corresponding path program 4 times [2019-12-27 17:32:06,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:06,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566775616] [2019-12-27 17:32:06,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:06,671 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-27 17:32:06,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566775616] [2019-12-27 17:32:06,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:06,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:32:06,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52358087] [2019-12-27 17:32:06,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:06,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:06,787 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 174 transitions. [2019-12-27 17:32:06,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:06,805 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:32:06,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:32:06,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:06,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:32:06,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:32:06,806 INFO L87 Difference]: Start difference. First operand 695 states and 1608 transitions. Second operand 6 states. [2019-12-27 17:32:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:07,150 INFO L93 Difference]: Finished difference Result 1113 states and 2557 transitions. [2019-12-27 17:32:07,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:32:07,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 17:32:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:07,152 INFO L225 Difference]: With dead ends: 1113 [2019-12-27 17:32:07,152 INFO L226 Difference]: Without dead ends: 1113 [2019-12-27 17:32:07,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:32:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-12-27 17:32:07,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 767. [2019-12-27 17:32:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-12-27 17:32:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1777 transitions. [2019-12-27 17:32:07,170 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1777 transitions. Word has length 55 [2019-12-27 17:32:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:07,171 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1777 transitions. [2019-12-27 17:32:07,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:32:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1777 transitions. [2019-12-27 17:32:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:32:07,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:07,173 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] [2019-12-27 17:32:07,173 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:07,174 INFO L82 PathProgramCache]: Analyzing trace with hash 710265715, now seen corresponding path program 5 times [2019-12-27 17:32:07,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:07,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456746242] [2019-12-27 17:32:07,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:07,231 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-27 17:32:07,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456746242] [2019-12-27 17:32:07,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:07,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:32:07,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [478040389] [2019-12-27 17:32:07,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:07,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:07,316 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 210 transitions. [2019-12-27 17:32:07,317 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:07,332 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:32:07,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:32:07,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:32:07,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:32:07,333 INFO L87 Difference]: Start difference. First operand 767 states and 1777 transitions. Second operand 5 states. [2019-12-27 17:32:07,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:07,467 INFO L93 Difference]: Finished difference Result 878 states and 1968 transitions. [2019-12-27 17:32:07,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:32:07,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 17:32:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:07,469 INFO L225 Difference]: With dead ends: 878 [2019-12-27 17:32:07,469 INFO L226 Difference]: Without dead ends: 878 [2019-12-27 17:32:07,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:32:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-12-27 17:32:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 675. [2019-12-27 17:32:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2019-12-27 17:32:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1524 transitions. [2019-12-27 17:32:07,482 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1524 transitions. Word has length 55 [2019-12-27 17:32:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:07,482 INFO L462 AbstractCegarLoop]: Abstraction has 675 states and 1524 transitions. [2019-12-27 17:32:07,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:32:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1524 transitions. [2019-12-27 17:32:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 17:32:07,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:07,484 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] [2019-12-27 17:32:07,484 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:07,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:07,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1651570348, now seen corresponding path program 1 times [2019-12-27 17:32:07,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:07,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312318250] [2019-12-27 17:32:07,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:07,569 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-27 17:32:07,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312318250] [2019-12-27 17:32:07,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:07,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:32:07,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [328596597] [2019-12-27 17:32:07,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:07,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:07,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 169 transitions. [2019-12-27 17:32:07,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:07,670 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:07,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:32:07,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:07,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:32:07,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:32:07,672 INFO L87 Difference]: Start difference. First operand 675 states and 1524 transitions. Second operand 3 states. [2019-12-27 17:32:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:07,709 INFO L93 Difference]: Finished difference Result 674 states and 1522 transitions. [2019-12-27 17:32:07,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:32:07,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 17:32:07,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:07,710 INFO L225 Difference]: With dead ends: 674 [2019-12-27 17:32:07,710 INFO L226 Difference]: Without dead ends: 674 [2019-12-27 17:32:07,711 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-27 17:32:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-12-27 17:32:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 411. [2019-12-27 17:32:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-27 17:32:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 911 transitions. [2019-12-27 17:32:07,723 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 911 transitions. Word has length 56 [2019-12-27 17:32:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:07,723 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 911 transitions. [2019-12-27 17:32:07,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:32:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 911 transitions. [2019-12-27 17:32:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:32:07,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:07,724 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] [2019-12-27 17:32:07,725 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:07,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:07,725 INFO L82 PathProgramCache]: Analyzing trace with hash 729563135, now seen corresponding path program 1 times [2019-12-27 17:32:07,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:07,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417579706] [2019-12-27 17:32:07,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:07,938 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-27 17:32:07,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417579706] [2019-12-27 17:32:07,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:07,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:32:07,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [189698880] [2019-12-27 17:32:07,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:07,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:08,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 170 transitions. [2019-12-27 17:32:08,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:08,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:08,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:32:08,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:32:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:32:08,024 INFO L87 Difference]: Start difference. First operand 411 states and 911 transitions. Second operand 5 states. [2019-12-27 17:32:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:08,073 INFO L93 Difference]: Finished difference Result 587 states and 1222 transitions. [2019-12-27 17:32:08,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:32:08,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 17:32:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:08,074 INFO L225 Difference]: With dead ends: 587 [2019-12-27 17:32:08,075 INFO L226 Difference]: Without dead ends: 207 [2019-12-27 17:32:08,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:32:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-12-27 17:32:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-12-27 17:32:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-27 17:32:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-27 17:32:08,079 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 57 [2019-12-27 17:32:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:08,079 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-27 17:32:08,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:32:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-27 17:32:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:32:08,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:08,080 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] [2019-12-27 17:32:08,080 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:08,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:08,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 2 times [2019-12-27 17:32:08,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:08,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737682121] [2019-12-27 17:32:08,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:08,294 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-27 17:32:08,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737682121] [2019-12-27 17:32:08,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:08,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:32:08,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [790521419] [2019-12-27 17:32:08,296 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:08,313 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:08,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 163 transitions. [2019-12-27 17:32:08,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:08,501 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:32:08,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:32:08,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:08,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:32:08,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:32:08,503 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 15 states. [2019-12-27 17:32:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:10,436 INFO L93 Difference]: Finished difference Result 535 states and 905 transitions. [2019-12-27 17:32:10,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 17:32:10,436 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-27 17:32:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:10,437 INFO L225 Difference]: With dead ends: 535 [2019-12-27 17:32:10,438 INFO L226 Difference]: Without dead ends: 505 [2019-12-27 17:32:10,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=316, Invalid=1406, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 17:32:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-12-27 17:32:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 307. [2019-12-27 17:32:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-27 17:32:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-27 17:32:10,445 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 57 [2019-12-27 17:32:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:10,446 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-27 17:32:10,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:32:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-27 17:32:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:32:10,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:10,447 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] [2019-12-27 17:32:10,447 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1834190715, now seen corresponding path program 3 times [2019-12-27 17:32:10,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:10,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29126305] [2019-12-27 17:32:10,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:10,730 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-27 17:32:10,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29126305] [2019-12-27 17:32:10,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:10,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:32:10,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [188465674] [2019-12-27 17:32:10,731 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:10,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:10,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 115 states and 151 transitions. [2019-12-27 17:32:10,800 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:10,829 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:32:10,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:32:10,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:10,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:32:10,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:32:10,830 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 14 states. [2019-12-27 17:32:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:11,338 INFO L93 Difference]: Finished difference Result 415 states and 703 transitions. [2019-12-27 17:32:11,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 17:32:11,338 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 17:32:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:11,339 INFO L225 Difference]: With dead ends: 415 [2019-12-27 17:32:11,339 INFO L226 Difference]: Without dead ends: 385 [2019-12-27 17:32:11,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-27 17:32:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-27 17:32:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 315. [2019-12-27 17:32:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-27 17:32:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 549 transitions. [2019-12-27 17:32:11,345 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 549 transitions. Word has length 57 [2019-12-27 17:32:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:11,345 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 549 transitions. [2019-12-27 17:32:11,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:32:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 549 transitions. [2019-12-27 17:32:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:32:11,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:11,346 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] [2019-12-27 17:32:11,347 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 4 times [2019-12-27 17:32:11,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:11,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138640362] [2019-12-27 17:32:11,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:32:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:32:11,472 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:32:11,474 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:32:11,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1492~0.base_26| 4)) (= v_~y$w_buff1~0_200 0) (= v_~y$w_buff0_used~0_650 0) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1492~0.base_26|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (= 0 |v_ULTIMATE.start_main_~#t1492~0.offset_19|) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= v_~y$w_buff1_used~0_407 0) (= v_~y$r_buff0_thd2~0_88 0) (= |v_#NULL.offset_5| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1492~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1492~0.base_26|) |v_ULTIMATE.start_main_~#t1492~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff1_thd2~0_131) (= v_~y$mem_tmp~0_31 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1492~0.base_26| 1) |v_#valid_60|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (= v_~main$tmp_guard0~0_24 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1492~0.base_26|)) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_~#t1493~0.offset=|v_ULTIMATE.start_main_~#t1493~0.offset_19|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ULTIMATE.start_main_~#t1494~0.base=|v_ULTIMATE.start_main_~#t1494~0.base_21|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ULTIMATE.start_main_~#t1494~0.offset=|v_ULTIMATE.start_main_~#t1494~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ~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_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_~#t1493~0.base=|v_ULTIMATE.start_main_~#t1493~0.base_26|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t1492~0.offset=|v_ULTIMATE.start_main_~#t1492~0.offset_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_~#t1492~0.base=|v_ULTIMATE.start_main_~#t1492~0.base_26|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1493~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t1494~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1494~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1493~0.base, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1492~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_~#t1492~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:32:11,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1493~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1493~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1493~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1493~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1493~0.base_13| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1493~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1493~0.base_13|) |v_ULTIMATE.start_main_~#t1493~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1493~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1493~0.offset=|v_ULTIMATE.start_main_~#t1493~0.offset_11|, ULTIMATE.start_main_~#t1493~0.base=|v_ULTIMATE.start_main_~#t1493~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1493~0.offset, ULTIMATE.start_main_~#t1493~0.base] because there is no mapped edge [2019-12-27 17:32:11,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1494~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1494~0.offset_10|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1494~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t1494~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1494~0.base_12|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1494~0.base_12| 1) |v_#valid_38|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1494~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1494~0.base_12|) |v_ULTIMATE.start_main_~#t1494~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1494~0.offset=|v_ULTIMATE.start_main_~#t1494~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1494~0.base=|v_ULTIMATE.start_main_~#t1494~0.base_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1494~0.offset, ULTIMATE.start_main_~#t1494~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 17:32:11,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P2Thread1of1ForFork0_~arg.base_8 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= (mod v_~y$w_buff1_used~0_89 256) 0) (= v_P2Thread1of1ForFork0_~arg.offset_8 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_8, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:32:11,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= |v_P0Thread1of1ForFork1_#res.base_11| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_11|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 17:32:11,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In115637553 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In115637553 256)))) (or (and (= ~y$w_buff0_used~0_In115637553 |P2Thread1of1ForFork0_#t~ite11_Out115637553|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite11_Out115637553|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In115637553, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In115637553} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In115637553, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out115637553|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In115637553} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 17:32:11,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1292098117 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1292098117 256)))) (or (and (= ~y~0_In-1292098117 |P1Thread1of1ForFork2_#t~ite3_Out-1292098117|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-1292098117| ~y$w_buff1~0_In-1292098117) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1292098117, ~y$w_buff1~0=~y$w_buff1~0_In-1292098117, ~y~0=~y~0_In-1292098117, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1292098117} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1292098117, ~y$w_buff1~0=~y$w_buff1~0_In-1292098117, ~y~0=~y~0_In-1292098117, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1292098117|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1292098117} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 17:32:11,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_12| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_12|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_13|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 17:32:11,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In464772129 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In464772129 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out464772129|)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out464772129| ~y$w_buff0_used~0_In464772129) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In464772129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In464772129} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In464772129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In464772129, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out464772129|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 17:32:11,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2027518250 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-2027518250 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2027518250 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-2027518250 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite6_Out-2027518250| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite6_Out-2027518250| ~y$w_buff1_used~0_In-2027518250)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2027518250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027518250, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2027518250, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2027518250} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2027518250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2027518250, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2027518250, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-2027518250|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2027518250} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 17:32:11,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1569638113 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1569638113 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1569638113 |P1Thread1of1ForFork2_#t~ite7_Out1569638113|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out1569638113|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1569638113, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1569638113} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1569638113, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1569638113, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1569638113|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 17:32:11,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1350697295 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1350697295 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1350697295 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1350697295 256)))) (or (and (= ~y$w_buff1_used~0_In1350697295 |P2Thread1of1ForFork0_#t~ite12_Out1350697295|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out1350697295|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1350697295, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1350697295, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1350697295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1350697295} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1350697295, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1350697295, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1350697295|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1350697295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1350697295} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 17:32:11,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-567547790 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-567547790 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-567547790 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-567547790 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite8_Out-567547790| ~y$r_buff1_thd2~0_In-567547790)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-567547790|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-567547790, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-567547790, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-567547790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-567547790} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-567547790, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-567547790, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-567547790|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-567547790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-567547790} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:32:11,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite8_28| v_~y$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 17:32:11,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-225779159 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-225779159 256)))) (or (and (= 0 ~y$r_buff0_thd3~0_Out-225779159) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_Out-225779159 ~y$r_buff0_thd3~0_In-225779159) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-225779159, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-225779159} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-225779159, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-225779159, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-225779159|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 17:32:11,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-597371669 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-597371669 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-597371669 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-597371669 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out-597371669| ~y$r_buff1_thd3~0_In-597371669)) (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-597371669|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-597371669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-597371669, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-597371669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-597371669} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-597371669|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-597371669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-597371669, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-597371669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-597371669} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 17:32:11,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_40| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 17:32:11,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:32:11,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1732036803 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1732036803 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite18_Out-1732036803| ~y$w_buff1~0_In-1732036803)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite18_Out-1732036803| ~y~0_In-1732036803)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1732036803, ~y~0=~y~0_In-1732036803, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1732036803, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1732036803} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1732036803, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1732036803|, ~y~0=~y~0_In-1732036803, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1732036803, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1732036803} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 17:32:11,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-27 17:32:11,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1502845717 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1502845717 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1502845717| ~y$w_buff0_used~0_In1502845717)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out1502845717|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1502845717, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1502845717} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1502845717, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1502845717, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1502845717|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:32:11,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1485897469 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1485897469 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1485897469 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1485897469 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out-1485897469| 0)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1485897469 |ULTIMATE.start_main_#t~ite21_Out-1485897469|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1485897469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1485897469, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1485897469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1485897469} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1485897469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1485897469, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1485897469|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1485897469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1485897469} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:32:11,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1346541438 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1346541438 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1346541438| ~y$r_buff0_thd0~0_In1346541438)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1346541438|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1346541438, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1346541438} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1346541438, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1346541438, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1346541438|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:32:11,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-99218390 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-99218390 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-99218390 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-99218390 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out-99218390| ~y$r_buff1_thd0~0_In-99218390) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite23_Out-99218390| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-99218390, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-99218390, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99218390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99218390} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-99218390, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-99218390, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99218390, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-99218390|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99218390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:32:11,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1552145949 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite30_Out-1552145949| ~y$w_buff0~0_In-1552145949) (not .cse0) (= |ULTIMATE.start_main_#t~ite29_In-1552145949| |ULTIMATE.start_main_#t~ite29_Out-1552145949|)) (and (= ~y$w_buff0~0_In-1552145949 |ULTIMATE.start_main_#t~ite29_Out-1552145949|) (= |ULTIMATE.start_main_#t~ite30_Out-1552145949| |ULTIMATE.start_main_#t~ite29_Out-1552145949|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1552145949 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1552145949 256))) (= (mod ~y$w_buff0_used~0_In-1552145949 256) 0) (and (= (mod ~y$w_buff1_used~0_In-1552145949 256) 0) .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1552145949, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1552145949|, ~y$w_buff0~0=~y$w_buff0~0_In-1552145949, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1552145949, ~weak$$choice2~0=~weak$$choice2~0_In-1552145949, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1552145949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1552145949} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1552145949|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1552145949, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1552145949|, ~y$w_buff0~0=~y$w_buff0~0_In-1552145949, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1552145949, ~weak$$choice2~0=~weak$$choice2~0_In-1552145949, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1552145949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1552145949} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 17:32:11,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:32:11,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:32:11,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:32:11,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:32:11 BasicIcfg [2019-12-27 17:32:11,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:32:11,600 INFO L168 Benchmark]: Toolchain (without parser) took 21798.12 ms. Allocated memory was 139.5 MB in the beginning and 945.3 MB in the end (delta: 805.8 MB). Free memory was 103.0 MB in the beginning and 483.0 MB in the end (delta: -380.0 MB). Peak memory consumption was 425.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:32:11,601 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 139.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 17:32:11,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.94 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.5 MB in the beginning and 159.2 MB in the end (delta: -56.6 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:32:11,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.66 ms. Allocated memory is still 204.5 MB. Free memory was 159.2 MB in the beginning and 156.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:32:11,603 INFO L168 Benchmark]: Boogie Preprocessor took 36.35 ms. Allocated memory is still 204.5 MB. Free memory was 156.3 MB in the beginning and 154.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:32:11,603 INFO L168 Benchmark]: RCFGBuilder took 769.00 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 107.4 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:32:11,604 INFO L168 Benchmark]: TraceAbstraction took 20130.65 ms. Allocated memory was 204.5 MB in the beginning and 945.3 MB in the end (delta: 740.8 MB). Free memory was 107.4 MB in the beginning and 483.0 MB in the end (delta: -375.6 MB). Peak memory consumption was 365.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:32:11,608 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.16 ms. Allocated memory is still 139.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 784.94 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.5 MB in the beginning and 159.2 MB in the end (delta: -56.6 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.66 ms. Allocated memory is still 204.5 MB. Free memory was 159.2 MB in the beginning and 156.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.35 ms. Allocated memory is still 204.5 MB. Free memory was 156.3 MB in the beginning and 154.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 769.00 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 107.4 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20130.65 ms. Allocated memory was 204.5 MB in the beginning and 945.3 MB in the end (delta: 740.8 MB). Free memory was 107.4 MB in the beginning and 483.0 MB in the end (delta: -375.6 MB). Peak memory consumption was 365.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 3955 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 45 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48383 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L802] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L804] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 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 [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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 [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1525 SDtfs, 1776 SDslu, 4070 SDs, 0 SdLazy, 2338 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 58 SyntacticMatches, 18 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22166occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 4930 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 615 ConstructedInterpolants, 0 QuantifiedInterpolants, 103065 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...