/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:05:32,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:05:32,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:05:32,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:05:32,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:05:32,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:05:32,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:05:32,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:05:32,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:05:32,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:05:32,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:05:32,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:05:32,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:05:32,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:05:32,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:05:32,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:05:32,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:05:32,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:05:32,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:05:32,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:05:32,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:05:32,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:05:32,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:05:32,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:05:32,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:05:32,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:05:32,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:05:32,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:05:32,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:05:32,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:05:32,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:05:32,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:05:32,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:05:32,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:05:32,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:05:32,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:05:32,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:05:32,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:05:32,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:05:32,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:05:32,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:05:32,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:05:32,659 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:05:32,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:05:32,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:05:32,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:05:32,661 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:05:32,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:05:32,662 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:05:32,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:05:32,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:05:32,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:05:32,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:05:32,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:05:32,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:05:32,664 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:05:32,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:05:32,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:05:32,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:05:32,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:05:32,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:05:32,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:05:32,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:05:32,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:05:32,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:05:32,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:05:32,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:05:32,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:05:32,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:05:32,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:05:32,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:05:32,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:05:32,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:05:32,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:05:32,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:05:32,963 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:05:32,964 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:05:32,965 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2019-12-18 14:05:33,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13017b4c/d097cba3bef5469da600cb8b01f73682/FLAGd862d15a9 [2019-12-18 14:05:33,620 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:05:33,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2019-12-18 14:05:33,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13017b4c/d097cba3bef5469da600cb8b01f73682/FLAGd862d15a9 [2019-12-18 14:05:33,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13017b4c/d097cba3bef5469da600cb8b01f73682 [2019-12-18 14:05:33,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:05:33,929 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:05:33,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:05:33,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:05:33,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:05:33,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:05:33" (1/1) ... [2019-12-18 14:05:33,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:33, skipping insertion in model container [2019-12-18 14:05:33,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:05:33" (1/1) ... [2019-12-18 14:05:33,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:05:34,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:05:34,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:05:34,522 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:05:34,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:05:34,663 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:05:34,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34 WrapperNode [2019-12-18 14:05:34,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:05:34,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:05:34,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:05:34,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:05:34,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34" (1/1) ... [2019-12-18 14:05:34,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34" (1/1) ... [2019-12-18 14:05:34,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:05:34,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:05:34,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:05:34,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:05:34,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34" (1/1) ... [2019-12-18 14:05:34,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34" (1/1) ... [2019-12-18 14:05:34,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34" (1/1) ... [2019-12-18 14:05:34,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34" (1/1) ... [2019-12-18 14:05:34,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34" (1/1) ... [2019-12-18 14:05:34,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34" (1/1) ... [2019-12-18 14:05:34,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34" (1/1) ... [2019-12-18 14:05:34,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:05:34,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:05:34,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:05:34,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:05:34,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34" (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-18 14:05:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:05:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:05:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:05:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:05:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:05:34,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:05:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:05:34,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:05:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:05:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:05:34,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:05:34,839 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:05:35,546 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:05:35,546 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:05:35,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:05:35 BoogieIcfgContainer [2019-12-18 14:05:35,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:05:35,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:05:35,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:05:35,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:05:35,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:05:33" (1/3) ... [2019-12-18 14:05:35,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc644d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:05:35, skipping insertion in model container [2019-12-18 14:05:35,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:34" (2/3) ... [2019-12-18 14:05:35,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc644d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:05:35, skipping insertion in model container [2019-12-18 14:05:35,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:05:35" (3/3) ... [2019-12-18 14:05:35,556 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2019-12-18 14:05:35,566 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:05:35,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:05:35,574 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:05:35,575 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:05:35,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,619 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,619 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,619 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,633 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,633 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:35,653 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:05:35,670 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:05:35,670 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:05:35,670 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:05:35,670 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:05:35,671 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:05:35,671 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:05:35,671 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:05:35,671 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:05:35,688 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 14:05:35,690 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:05:35,801 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:05:35,801 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:05:35,819 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:05:35,836 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:05:35,887 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:05:35,888 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:05:35,893 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:05:35,905 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 14:05:35,906 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:05:40,156 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 14:05:40,275 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50487 [2019-12-18 14:05:40,275 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-18 14:05:40,279 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-18 14:05:40,777 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-12-18 14:05:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-12-18 14:05:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:05:40,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:40,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:05:40,787 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:40,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:40,792 INFO L82 PathProgramCache]: Analyzing trace with hash 692929394, now seen corresponding path program 1 times [2019-12-18 14:05:40,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:40,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851696621] [2019-12-18 14:05:40,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:40,995 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-18 14:05:40,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851696621] [2019-12-18 14:05:40,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:40,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:05:40,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799285629] [2019-12-18 14:05:41,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:05:41,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:41,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:05:41,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:05:41,022 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-12-18 14:05:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:41,401 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-12-18 14:05:41,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:05:41,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:05:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:41,534 INFO L225 Difference]: With dead ends: 9416 [2019-12-18 14:05:41,534 INFO L226 Difference]: Without dead ends: 9234 [2019-12-18 14:05:41,536 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-18 14:05:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-12-18 14:05:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-12-18 14:05:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-18 14:05:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-12-18 14:05:42,026 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-12-18 14:05:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:42,027 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-12-18 14:05:42,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:05:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-12-18 14:05:42,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:05:42,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:42,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:05:42,033 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:42,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1820083367, now seen corresponding path program 1 times [2019-12-18 14:05:42,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:42,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489468890] [2019-12-18 14:05:42,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:42,197 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-18 14:05:42,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489468890] [2019-12-18 14:05:42,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:42,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:05:42,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221169092] [2019-12-18 14:05:42,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:05:42,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:42,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:05:42,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:05:42,202 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 4 states. [2019-12-18 14:05:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:42,695 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-12-18 14:05:42,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:05:42,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:05:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:42,767 INFO L225 Difference]: With dead ends: 14362 [2019-12-18 14:05:42,767 INFO L226 Difference]: Without dead ends: 14355 [2019-12-18 14:05:42,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:05:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-12-18 14:05:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-12-18 14:05:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-12-18 14:05:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-12-18 14:05:43,827 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-12-18 14:05:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:43,828 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-12-18 14:05:43,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:05:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-12-18 14:05:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:05:43,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:43,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:05:43,836 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash 417951775, now seen corresponding path program 1 times [2019-12-18 14:05:43,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:43,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200835903] [2019-12-18 14:05:43,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:43,926 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-18 14:05:43,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200835903] [2019-12-18 14:05:43,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:43,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:05:43,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240181434] [2019-12-18 14:05:43,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:05:43,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:05:43,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:05:43,929 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-12-18 14:05:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:43,956 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-12-18 14:05:43,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:05:43,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 14:05:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:43,963 INFO L225 Difference]: With dead ends: 1778 [2019-12-18 14:05:43,963 INFO L226 Difference]: Without dead ends: 1778 [2019-12-18 14:05:43,964 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-18 14:05:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-18 14:05:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-12-18 14:05:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-12-18 14:05:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-12-18 14:05:44,008 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-12-18 14:05:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:44,008 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-12-18 14:05:44,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:05:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-12-18 14:05:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 14:05:44,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:44,012 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] [2019-12-18 14:05:44,013 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:44,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:44,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1954901459, now seen corresponding path program 1 times [2019-12-18 14:05:44,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:44,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422300173] [2019-12-18 14:05:44,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:44,106 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-18 14:05:44,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422300173] [2019-12-18 14:05:44,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:44,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:05:44,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301907441] [2019-12-18 14:05:44,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:05:44,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:44,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:05:44,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:05:44,109 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 4 states. [2019-12-18 14:05:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:44,127 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-12-18 14:05:44,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:05:44,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 14:05:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:44,128 INFO L225 Difference]: With dead ends: 371 [2019-12-18 14:05:44,129 INFO L226 Difference]: Without dead ends: 371 [2019-12-18 14:05:44,129 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-18 14:05:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-18 14:05:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-12-18 14:05:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-18 14:05:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-12-18 14:05:44,136 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-12-18 14:05:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:44,137 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-12-18 14:05:44,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:05:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-12-18 14:05:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:05:44,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:44,139 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] [2019-12-18 14:05:44,139 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:44,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:44,139 INFO L82 PathProgramCache]: Analyzing trace with hash 798988436, now seen corresponding path program 1 times [2019-12-18 14:05:44,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:44,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705396851] [2019-12-18 14:05:44,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:44,212 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-18 14:05:44,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705396851] [2019-12-18 14:05:44,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:44,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:05:44,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822527513] [2019-12-18 14:05:44,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:05:44,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:44,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:05:44,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:05:44,215 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-12-18 14:05:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:44,373 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-12-18 14:05:44,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:05:44,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 14:05:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:44,376 INFO L225 Difference]: With dead ends: 345 [2019-12-18 14:05:44,376 INFO L226 Difference]: Without dead ends: 345 [2019-12-18 14:05:44,377 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-18 14:05:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-18 14:05:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-18 14:05:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-18 14:05:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-12-18 14:05:44,384 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-12-18 14:05:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:44,386 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-12-18 14:05:44,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:05:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-12-18 14:05:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:05:44,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:44,391 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] [2019-12-18 14:05:44,391 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:44,391 INFO L82 PathProgramCache]: Analyzing trace with hash 112676449, now seen corresponding path program 1 times [2019-12-18 14:05:44,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:44,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228277537] [2019-12-18 14:05:44,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:44,490 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-18 14:05:44,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228277537] [2019-12-18 14:05:44,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:44,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:05:44,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683642874] [2019-12-18 14:05:44,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:05:44,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:05:44,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:05:44,493 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-12-18 14:05:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:44,539 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-12-18 14:05:44,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:05:44,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 14:05:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:44,541 INFO L225 Difference]: With dead ends: 345 [2019-12-18 14:05:44,541 INFO L226 Difference]: Without dead ends: 345 [2019-12-18 14:05:44,541 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-18 14:05:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-18 14:05:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-18 14:05:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-18 14:05:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-12-18 14:05:44,548 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-12-18 14:05:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:44,551 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-12-18 14:05:44,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:05:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-12-18 14:05:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:05:44,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:44,552 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] [2019-12-18 14:05:44,552 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash 107384222, now seen corresponding path program 1 times [2019-12-18 14:05:44,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:44,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952998988] [2019-12-18 14:05:44,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:44,663 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-18 14:05:44,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952998988] [2019-12-18 14:05:44,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:44,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:05:44,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667395852] [2019-12-18 14:05:44,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:05:44,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:44,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:05:44,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:05:44,665 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 5 states. [2019-12-18 14:05:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:44,875 INFO L93 Difference]: Finished difference Result 480 states and 875 transitions. [2019-12-18 14:05:44,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:05:44,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 14:05:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:44,877 INFO L225 Difference]: With dead ends: 480 [2019-12-18 14:05:44,877 INFO L226 Difference]: Without dead ends: 480 [2019-12-18 14:05:44,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-18 14:05:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-18 14:05:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 390. [2019-12-18 14:05:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-12-18 14:05:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 719 transitions. [2019-12-18 14:05:44,887 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 719 transitions. Word has length 52 [2019-12-18 14:05:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:44,887 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 719 transitions. [2019-12-18 14:05:44,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:05:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 719 transitions. [2019-12-18 14:05:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:05:44,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:44,889 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] [2019-12-18 14:05:44,889 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:44,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:44,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2113386594, now seen corresponding path program 2 times [2019-12-18 14:05:44,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:44,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9459345] [2019-12-18 14:05:44,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:45,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-18 14:05:45,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9459345] [2019-12-18 14:05:45,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:45,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:05:45,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434173262] [2019-12-18 14:05:45,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:05:45,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:05:45,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:05:45,041 INFO L87 Difference]: Start difference. First operand 390 states and 719 transitions. Second operand 6 states. [2019-12-18 14:05:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:45,329 INFO L93 Difference]: Finished difference Result 585 states and 1068 transitions. [2019-12-18 14:05:45,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:05:45,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 14:05:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:45,331 INFO L225 Difference]: With dead ends: 585 [2019-12-18 14:05:45,331 INFO L226 Difference]: Without dead ends: 585 [2019-12-18 14:05:45,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:05:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-12-18 14:05:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 425. [2019-12-18 14:05:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-12-18 14:05:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 786 transitions. [2019-12-18 14:05:45,342 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 786 transitions. Word has length 52 [2019-12-18 14:05:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:45,344 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 786 transitions. [2019-12-18 14:05:45,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:05:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 786 transitions. [2019-12-18 14:05:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:05:45,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:45,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] [2019-12-18 14:05:45,346 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:45,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:45,347 INFO L82 PathProgramCache]: Analyzing trace with hash 936446688, now seen corresponding path program 3 times [2019-12-18 14:05:45,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:45,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991924680] [2019-12-18 14:05:45,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:45,500 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-18 14:05:45,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991924680] [2019-12-18 14:05:45,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:45,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:05:45,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527857649] [2019-12-18 14:05:45,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:05:45,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:45,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:05:45,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:05:45,503 INFO L87 Difference]: Start difference. First operand 425 states and 786 transitions. Second operand 7 states. [2019-12-18 14:05:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:45,952 INFO L93 Difference]: Finished difference Result 584 states and 1029 transitions. [2019-12-18 14:05:45,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:05:45,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 14:05:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:45,954 INFO L225 Difference]: With dead ends: 584 [2019-12-18 14:05:45,954 INFO L226 Difference]: Without dead ends: 584 [2019-12-18 14:05:45,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:05:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-18 14:05:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 379. [2019-12-18 14:05:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-18 14:05:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 677 transitions. [2019-12-18 14:05:45,965 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 677 transitions. Word has length 52 [2019-12-18 14:05:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:45,965 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 677 transitions. [2019-12-18 14:05:45,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:05:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 677 transitions. [2019-12-18 14:05:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:05:45,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:45,967 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] [2019-12-18 14:05:45,967 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:45,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1416640772, now seen corresponding path program 1 times [2019-12-18 14:05:45,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:45,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307733273] [2019-12-18 14:05:45,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:46,086 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-18 14:05:46,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307733273] [2019-12-18 14:05:46,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:46,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:05:46,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68145735] [2019-12-18 14:05:46,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:05:46,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:05:46,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:05:46,089 INFO L87 Difference]: Start difference. First operand 379 states and 677 transitions. Second operand 6 states. [2019-12-18 14:05:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:46,175 INFO L93 Difference]: Finished difference Result 701 states and 1248 transitions. [2019-12-18 14:05:46,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:05:46,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 14:05:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:46,177 INFO L225 Difference]: With dead ends: 701 [2019-12-18 14:05:46,177 INFO L226 Difference]: Without dead ends: 339 [2019-12-18 14:05:46,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:05:46,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-12-18 14:05:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 307. [2019-12-18 14:05:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-18 14:05:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-18 14:05:46,187 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 53 [2019-12-18 14:05:46,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:46,187 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-18 14:05:46,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:05:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-18 14:05:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:05:46,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:46,189 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] [2019-12-18 14:05:46,189 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1118119919, now seen corresponding path program 1 times [2019-12-18 14:05:46,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:46,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298838577] [2019-12-18 14:05:46,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:46,363 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-18 14:05:46,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298838577] [2019-12-18 14:05:46,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:46,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:05:46,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487383367] [2019-12-18 14:05:46,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:05:46,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:46,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:05:46,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:05:46,366 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 3 states. [2019-12-18 14:05:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:46,399 INFO L93 Difference]: Finished difference Result 268 states and 457 transitions. [2019-12-18 14:05:46,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:05:46,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 14:05:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:46,401 INFO L225 Difference]: With dead ends: 268 [2019-12-18 14:05:46,401 INFO L226 Difference]: Without dead ends: 268 [2019-12-18 14:05:46,401 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-18 14:05:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-18 14:05:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-12-18 14:05:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-12-18 14:05:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 457 transitions. [2019-12-18 14:05:46,407 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 457 transitions. Word has length 53 [2019-12-18 14:05:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:46,408 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 457 transitions. [2019-12-18 14:05:46,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:05:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 457 transitions. [2019-12-18 14:05:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:05:46,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:46,409 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] [2019-12-18 14:05:46,409 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:46,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:46,410 INFO L82 PathProgramCache]: Analyzing trace with hash -167824730, now seen corresponding path program 2 times [2019-12-18 14:05:46,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:46,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351531804] [2019-12-18 14:05:46,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:46,498 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-18 14:05:46,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351531804] [2019-12-18 14:05:46,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:46,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:05:46,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441390881] [2019-12-18 14:05:46,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:05:46,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:46,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:05:46,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:05:46,500 INFO L87 Difference]: Start difference. First operand 268 states and 457 transitions. Second operand 3 states. [2019-12-18 14:05:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:46,538 INFO L93 Difference]: Finished difference Result 267 states and 455 transitions. [2019-12-18 14:05:46,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:05:46,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 14:05:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:46,540 INFO L225 Difference]: With dead ends: 267 [2019-12-18 14:05:46,540 INFO L226 Difference]: Without dead ends: 267 [2019-12-18 14:05:46,540 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-18 14:05:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-12-18 14:05:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 197. [2019-12-18 14:05:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-18 14:05:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 332 transitions. [2019-12-18 14:05:46,545 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 332 transitions. Word has length 53 [2019-12-18 14:05:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:46,545 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 332 transitions. [2019-12-18 14:05:46,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:05:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 332 transitions. [2019-12-18 14:05:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:05:46,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:46,547 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] [2019-12-18 14:05:46,547 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1455781027, now seen corresponding path program 1 times [2019-12-18 14:05:46,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:46,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615272011] [2019-12-18 14:05:46,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:05:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:05:46,707 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:05:46,707 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:05:46,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x~0_169) (= 0 v_~x$read_delayed_var~0.offset_6) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1591~0.base_19|) (= |v_#NULL.offset_7| 0) (= v_~x$r_buff1_thd2~0_98 0) (= |v_ULTIMATE.start_main_~#t1591~0.offset_14| 0) (= 0 v_~__unbuffered_cnt~0_67) (= v_~main$tmp_guard1~0_21 0) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_19| 1)) (= 0 v_~x$w_buff1_used~0_304) (= v_~x$r_buff0_thd0~0_295 0) (= 0 v_~x$r_buff0_thd2~0_162) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$read_delayed~0_6) (= v_~y~0_104 0) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~x$mem_tmp~0_16 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1591~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1591~0.base_19|) |v_ULTIMATE.start_main_~#t1591~0.offset_14| 0)) |v_#memory_int_17|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~weak$$choice2~0_83) (= 0 v_~weak$$choice0~0_11) (= 0 v_~__unbuffered_p1_EAX~0_62) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1~0_172) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1591~0.base_19| 4) |v_#length_17|) (= v_~main$tmp_guard0~0_26 0) (= v_~x$r_buff1_thd1~0_135 0) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~x$w_buff0~0_199) (= v_~x$r_buff1_thd0~0_177 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_19|)) (= 0 v_~x$w_buff0_used~0_556))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_15|, ~x$w_buff1~0=v_~x$w_buff1~0_172, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_98, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x~0=v_~x~0_169, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_19|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_37|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_30|, ULTIMATE.start_main_~#t1591~0.base=|v_ULTIMATE.start_main_~#t1591~0.base_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y~0=v_~y~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_37|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_~#t1591~0.offset=|v_ULTIMATE.start_main_~#t1591~0.offset_14|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_177, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_556, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_23|, ~weak$$choice2~0=v_~weak$$choice2~0_83, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1592~0.base, #length, ULTIMATE.start_main_~#t1592~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1591~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t1591~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:05:46,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L787-1-->L789: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1592~0.base_10| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1592~0.offset_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10|) |v_ULTIMATE.start_main_~#t1592~0.offset_9| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1592~0.offset, #length] because there is no mapped edge [2019-12-18 14:05:46,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L4-->L764: Formula: (and (= ~x$r_buff0_thd2~0_Out-1466170886 1) (= ~x$r_buff1_thd2~0_Out-1466170886 ~x$r_buff0_thd2~0_In-1466170886) (= ~__unbuffered_p1_EBX~0_Out-1466170886 ~y~0_Out-1466170886) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1466170886)) (= ~x$r_buff1_thd0~0_Out-1466170886 ~x$r_buff0_thd0~0_In-1466170886) (= ~__unbuffered_p1_EAX~0_Out-1466170886 ~y~0_Out-1466170886) (= ~x$r_buff0_thd1~0_In-1466170886 ~x$r_buff1_thd1~0_Out-1466170886) (= 1 ~y~0_Out-1466170886)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1466170886, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1466170886, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1466170886, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1466170886} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1466170886, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1466170886, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1466170886, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1466170886, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1466170886, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1466170886, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1466170886, ~y~0=~y~0_Out-1466170886, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1466170886, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1466170886} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 14:05:46,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1767072974 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1767072974 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1767072974 |P0Thread1of1ForFork0_#t~ite3_Out-1767072974|)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1767072974| ~x~0_In-1767072974) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1767072974, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1767072974, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1767072974, ~x~0=~x~0_In-1767072974} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1767072974|, ~x$w_buff1~0=~x$w_buff1~0_In-1767072974, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1767072974, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1767072974, ~x~0=~x~0_In-1767072974} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-18 14:05:46,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_20 |v_P0Thread1of1ForFork0_#t~ite3_16|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_16|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_15|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-18 14:05:46,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-915336701 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-915336701 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-915336701 |P0Thread1of1ForFork0_#t~ite5_Out-915336701|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-915336701| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-915336701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-915336701} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-915336701|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-915336701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-915336701} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:05:46,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In2133992210 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In2133992210 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In2133992210 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2133992210 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out2133992210| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out2133992210| ~x$w_buff1_used~0_In2133992210)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2133992210, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2133992210, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2133992210, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133992210} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2133992210|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2133992210, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2133992210, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2133992210, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133992210} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:05:46,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1012257217 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1012257217 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out1012257217| ~x$r_buff0_thd1~0_In1012257217) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1012257217| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1012257217, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1012257217} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1012257217, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1012257217|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1012257217} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 14:05:46,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-94818472 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-94818472 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-94818472| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-94818472 |P1Thread1of1ForFork1_#t~ite11_Out-94818472|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-94818472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-94818472} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-94818472|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-94818472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-94818472} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:05:46,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1052429774 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1052429774 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1052429774 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1052429774 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out1052429774| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out1052429774| ~x$w_buff1_used~0_In1052429774) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1052429774, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1052429774, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1052429774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1052429774} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1052429774, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1052429774, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1052429774|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1052429774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1052429774} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:05:46,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2069175266 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2069175266 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-2069175266 ~x$r_buff0_thd2~0_Out-2069175266)) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-2069175266) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2069175266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069175266} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2069175266|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2069175266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069175266} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:05:46,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1846215350 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1846215350 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1846215350 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1846215350 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1846215350| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1846215350| ~x$r_buff1_thd2~0_In-1846215350) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1846215350, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1846215350, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1846215350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1846215350} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1846215350, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1846215350, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1846215350, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1846215350|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1846215350} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:05:46,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork1_#t~ite14_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:05:46,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In206984091 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In206984091 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In206984091 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In206984091 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In206984091 |P0Thread1of1ForFork0_#t~ite8_Out206984091|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out206984091|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In206984091, ~x$w_buff1_used~0=~x$w_buff1_used~0_In206984091, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In206984091, ~x$w_buff0_used~0=~x$w_buff0_used~0_In206984091} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In206984091, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out206984091|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In206984091, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In206984091, ~x$w_buff0_used~0=~x$w_buff0_used~0_In206984091} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:05:46,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_94 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 14:05:46,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:05:46,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1995400553 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1995400553 256) 0))) (or (and (= ~x~0_In-1995400553 |ULTIMATE.start_main_#t~ite17_Out-1995400553|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In-1995400553 |ULTIMATE.start_main_#t~ite17_Out-1995400553|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1995400553, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1995400553, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1995400553, ~x~0=~x~0_In-1995400553} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1995400553|, ~x$w_buff1~0=~x$w_buff1~0_In-1995400553, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1995400553, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1995400553, ~x~0=~x~0_In-1995400553} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 14:05:46,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_42 |v_ULTIMATE.start_main_#t~ite17_11|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 14:05:46,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2115563941 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2115563941 256)))) (or (and (= ~x$w_buff0_used~0_In2115563941 |ULTIMATE.start_main_#t~ite19_Out2115563941|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite19_Out2115563941|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2115563941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115563941} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2115563941, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2115563941|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115563941} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 14:05:46,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1062267753 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1062267753 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1062267753 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1062267753 256)))) (or (and (= ~x$w_buff1_used~0_In-1062267753 |ULTIMATE.start_main_#t~ite20_Out-1062267753|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1062267753|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1062267753, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1062267753, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1062267753, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1062267753} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1062267753, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1062267753, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1062267753|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1062267753, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1062267753} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 14:05:46,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1034560357 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1034560357 256)))) (or (and (= ~x$r_buff0_thd0~0_In1034560357 |ULTIMATE.start_main_#t~ite21_Out1034560357|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out1034560357|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1034560357, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1034560357} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1034560357, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1034560357|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1034560357} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 14:05:46,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-869451898 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-869451898 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-869451898 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-869451898 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In-869451898 |ULTIMATE.start_main_#t~ite22_Out-869451898|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out-869451898| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-869451898, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-869451898, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-869451898, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-869451898} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-869451898, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-869451898, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-869451898, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-869451898|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-869451898} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 14:05:46,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~x$r_buff0_thd0~0_150 v_~x$r_buff0_thd0~0_151)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ~weak$$choice2~0=v_~weak$$choice2~0_40} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_150, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~weak$$choice2~0=v_~weak$$choice2~0_40} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 14:05:46,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L814-->L817-1: Formula: (and (= v_~x$mem_tmp~0_10 v_~x~0_111) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_111, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:05:46,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} 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_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:05:46,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:05:46 BasicIcfg [2019-12-18 14:05:46,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:05:46,832 INFO L168 Benchmark]: Toolchain (without parser) took 12899.93 ms. Allocated memory was 136.8 MB in the beginning and 538.4 MB in the end (delta: 401.6 MB). Free memory was 99.8 MB in the beginning and 337.1 MB in the end (delta: -237.4 MB). Peak memory consumption was 164.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:05:46,833 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 14:05:46,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.63 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.3 MB in the beginning and 154.8 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:05:46,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.55 ms. Allocated memory is still 200.3 MB. Free memory was 154.8 MB in the beginning and 151.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:05:46,836 INFO L168 Benchmark]: Boogie Preprocessor took 38.99 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 149.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:05:46,839 INFO L168 Benchmark]: RCFGBuilder took 776.13 ms. Allocated memory is still 200.3 MB. Free memory was 149.3 MB in the beginning and 105.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:05:46,840 INFO L168 Benchmark]: TraceAbstraction took 11277.46 ms. Allocated memory was 200.3 MB in the beginning and 538.4 MB in the end (delta: 338.2 MB). Free memory was 104.4 MB in the beginning and 337.1 MB in the end (delta: -232.8 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:05:46,846 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.53 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 734.63 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.3 MB in the beginning and 154.8 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.55 ms. Allocated memory is still 200.3 MB. Free memory was 154.8 MB in the beginning and 151.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.99 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 149.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 776.13 ms. Allocated memory is still 200.3 MB. Free memory was 149.3 MB in the beginning and 105.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11277.46 ms. Allocated memory was 200.3 MB in the beginning and 538.4 MB in the end (delta: 338.2 MB). Free memory was 104.4 MB in the beginning and 337.1 MB in the end (delta: -232.8 MB). Peak memory consumption was 105.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3783 VarBasedMoverChecksPositive, 170 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 202 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 50487 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L787] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L795] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1230 SDtfs, 705 SDslu, 1753 SDs, 0 SdLazy, 1069 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13038occurred 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: 1.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 1917 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 457 ConstructedInterpolants, 0 QuantifiedInterpolants, 57833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...