./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix048_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix048_tso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0c8faded955830cd36120935919c3f9dab9bfdd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 02:44:07,594 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 02:44:07,596 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 02:44:07,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 02:44:07,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 02:44:07,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 02:44:07,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 02:44:07,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 02:44:07,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 02:44:07,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 02:44:07,617 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 02:44:07,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 02:44:07,618 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 02:44:07,619 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 02:44:07,621 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 02:44:07,622 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 02:44:07,623 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 02:44:07,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 02:44:07,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 02:44:07,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 02:44:07,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 02:44:07,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 02:44:07,635 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 02:44:07,635 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 02:44:07,635 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 02:44:07,636 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 02:44:07,637 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 02:44:07,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 02:44:07,639 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 02:44:07,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 02:44:07,641 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 02:44:07,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 02:44:07,642 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 02:44:07,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 02:44:07,644 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 02:44:07,644 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 02:44:07,645 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 02:44:07,660 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 02:44:07,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 02:44:07,662 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 02:44:07,662 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 02:44:07,662 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 02:44:07,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 02:44:07,663 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 02:44:07,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 02:44:07,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 02:44:07,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 02:44:07,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 02:44:07,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 02:44:07,664 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 02:44:07,664 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 02:44:07,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 02:44:07,664 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 02:44:07,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 02:44:07,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 02:44:07,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 02:44:07,666 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 02:44:07,667 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 02:44:07,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 02:44:07,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 02:44:07,667 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 02:44:07,667 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 02:44:07,668 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 02:44:07,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 02:44:07,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 02:44:07,669 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0c8faded955830cd36120935919c3f9dab9bfdd [2019-01-13 02:44:07,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 02:44:07,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 02:44:07,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 02:44:07,726 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 02:44:07,726 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 02:44:07,727 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix048_tso.opt_false-unreach-call.i [2019-01-13 02:44:07,780 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822308c0a/39fcdef820c64caa9921dabd36251ddb/FLAG9e8044cea [2019-01-13 02:44:08,271 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 02:44:08,275 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix048_tso.opt_false-unreach-call.i [2019-01-13 02:44:08,297 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822308c0a/39fcdef820c64caa9921dabd36251ddb/FLAG9e8044cea [2019-01-13 02:44:08,542 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822308c0a/39fcdef820c64caa9921dabd36251ddb [2019-01-13 02:44:08,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 02:44:08,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 02:44:08,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 02:44:08,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 02:44:08,555 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 02:44:08,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:44:08" (1/1) ... [2019-01-13 02:44:08,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66baefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:08, skipping insertion in model container [2019-01-13 02:44:08,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:44:08" (1/1) ... [2019-01-13 02:44:08,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 02:44:08,633 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 02:44:09,205 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:44:09,220 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 02:44:09,423 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:44:09,517 INFO L195 MainTranslator]: Completed translation [2019-01-13 02:44:09,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09 WrapperNode [2019-01-13 02:44:09,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 02:44:09,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 02:44:09,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 02:44:09,519 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 02:44:09,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09" (1/1) ... [2019-01-13 02:44:09,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09" (1/1) ... [2019-01-13 02:44:09,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 02:44:09,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 02:44:09,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 02:44:09,588 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 02:44:09,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09" (1/1) ... [2019-01-13 02:44:09,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09" (1/1) ... [2019-01-13 02:44:09,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09" (1/1) ... [2019-01-13 02:44:09,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09" (1/1) ... [2019-01-13 02:44:09,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09" (1/1) ... [2019-01-13 02:44:09,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09" (1/1) ... [2019-01-13 02:44:09,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09" (1/1) ... [2019-01-13 02:44:09,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 02:44:09,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 02:44:09,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 02:44:09,641 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 02:44:09,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09" (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-01-13 02:44:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 02:44:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 02:44:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 02:44:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 02:44:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 02:44:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 02:44:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 02:44:09,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 02:44:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 02:44:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 02:44:09,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 02:44:09,709 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 02:44:10,787 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 02:44:10,787 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 02:44:10,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:44:10 BoogieIcfgContainer [2019-01-13 02:44:10,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 02:44:10,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 02:44:10,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 02:44:10,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 02:44:10,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 02:44:08" (1/3) ... [2019-01-13 02:44:10,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162d8372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:44:10, skipping insertion in model container [2019-01-13 02:44:10,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:44:09" (2/3) ... [2019-01-13 02:44:10,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162d8372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:44:10, skipping insertion in model container [2019-01-13 02:44:10,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:44:10" (3/3) ... [2019-01-13 02:44:10,797 INFO L112 eAbstractionObserver]: Analyzing ICFG mix048_tso.opt_false-unreach-call.i [2019-01-13 02:44:10,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,844 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,844 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,844 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,845 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,846 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,847 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,847 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,847 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,848 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,849 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,850 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,850 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,850 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,851 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,851 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,858 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,862 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,863 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,900 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,901 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,902 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,907 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,907 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,907 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,908 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,908 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,908 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,908 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,908 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,908 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,909 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,909 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,909 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,909 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,909 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,912 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,912 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,912 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,913 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,913 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,914 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,914 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,915 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,915 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,915 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,915 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,915 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:44:10,946 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 02:44:10,946 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 02:44:10,957 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 02:44:10,974 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 02:44:11,000 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 02:44:11,000 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 02:44:11,000 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 02:44:11,001 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 02:44:11,001 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 02:44:11,001 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 02:44:11,001 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 02:44:11,001 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 02:44:11,001 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 02:44:11,020 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2019-01-13 02:44:13,307 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2019-01-13 02:44:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2019-01-13 02:44:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-13 02:44:13,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:13,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:13,320 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:13,326 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2019-01-13 02:44:13,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:13,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:13,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:13,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:13,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:13,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:13,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:13,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:13,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:13,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:13,697 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2019-01-13 02:44:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:15,211 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2019-01-13 02:44:15,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:44:15,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-13 02:44:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:15,600 INFO L225 Difference]: With dead ends: 60790 [2019-01-13 02:44:15,601 INFO L226 Difference]: Without dead ends: 44270 [2019-01-13 02:44:15,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2019-01-13 02:44:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2019-01-13 02:44:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2019-01-13 02:44:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2019-01-13 02:44:17,338 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2019-01-13 02:44:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:17,339 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2019-01-13 02:44:17,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2019-01-13 02:44:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 02:44:17,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:17,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:17,350 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:17,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:17,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2019-01-13 02:44:17,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:17,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:17,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:17,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:17,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:17,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:17,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:17,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:17,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:17,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:17,602 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2019-01-13 02:44:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:17,975 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2019-01-13 02:44:17,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:44:17,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-13 02:44:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:18,016 INFO L225 Difference]: With dead ends: 8528 [2019-01-13 02:44:18,016 INFO L226 Difference]: Without dead ends: 7466 [2019-01-13 02:44:18,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2019-01-13 02:44:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2019-01-13 02:44:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2019-01-13 02:44:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2019-01-13 02:44:18,235 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2019-01-13 02:44:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:18,236 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2019-01-13 02:44:18,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2019-01-13 02:44:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 02:44:18,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:18,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:18,242 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2019-01-13 02:44:18,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:18,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:18,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:18,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:18,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:18,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:18,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:18,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:18,587 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2019-01-13 02:44:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:20,922 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2019-01-13 02:44:20,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:20,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-13 02:44:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:20,975 INFO L225 Difference]: With dead ends: 13998 [2019-01-13 02:44:20,976 INFO L226 Difference]: Without dead ends: 13930 [2019-01-13 02:44:20,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:44:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2019-01-13 02:44:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2019-01-13 02:44:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2019-01-13 02:44:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2019-01-13 02:44:21,443 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2019-01-13 02:44:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:21,444 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2019-01-13 02:44:21,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2019-01-13 02:44:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 02:44:21,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:21,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:21,448 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:21,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:21,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2019-01-13 02:44:21,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:21,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:21,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:21,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:21,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:21,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:21,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:44:21,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:44:21,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:44:21,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:44:21,553 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2019-01-13 02:44:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:21,688 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2019-01-13 02:44:21,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:44:21,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-01-13 02:44:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:21,731 INFO L225 Difference]: With dead ends: 13279 [2019-01-13 02:44:21,731 INFO L226 Difference]: Without dead ends: 13279 [2019-01-13 02:44:21,731 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-01-13 02:44:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2019-01-13 02:44:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2019-01-13 02:44:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2019-01-13 02:44:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2019-01-13 02:44:21,986 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2019-01-13 02:44:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:21,986 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2019-01-13 02:44:21,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:44:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2019-01-13 02:44:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 02:44:21,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:21,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:21,990 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:21,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:21,990 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2019-01-13 02:44:21,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:21,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:21,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:21,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:22,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:22,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:44:22,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:44:22,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:44:22,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:22,298 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2019-01-13 02:44:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:23,268 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2019-01-13 02:44:23,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 02:44:23,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-01-13 02:44:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:23,303 INFO L225 Difference]: With dead ends: 12285 [2019-01-13 02:44:23,304 INFO L226 Difference]: Without dead ends: 12213 [2019-01-13 02:44:23,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-13 02:44:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2019-01-13 02:44:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2019-01-13 02:44:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2019-01-13 02:44:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2019-01-13 02:44:23,568 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2019-01-13 02:44:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:23,568 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2019-01-13 02:44:23,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:44:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2019-01-13 02:44:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 02:44:23,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:23,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:23,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2019-01-13 02:44:23,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:23,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:23,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:23,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:23,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:23,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:23,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:23,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:23,718 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2019-01-13 02:44:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:23,882 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2019-01-13 02:44:23,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:44:23,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-01-13 02:44:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:23,909 INFO L225 Difference]: With dead ends: 12396 [2019-01-13 02:44:23,910 INFO L226 Difference]: Without dead ends: 12396 [2019-01-13 02:44:23,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2019-01-13 02:44:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2019-01-13 02:44:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2019-01-13 02:44:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2019-01-13 02:44:24,231 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2019-01-13 02:44:24,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:24,232 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2019-01-13 02:44:24,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2019-01-13 02:44:24,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 02:44:24,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:24,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:24,240 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:24,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2019-01-13 02:44:24,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:24,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:24,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:24,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:24,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:24,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:24,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:24,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:24,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:24,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:24,475 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2019-01-13 02:44:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:25,211 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2019-01-13 02:44:25,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 02:44:25,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-01-13 02:44:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:25,250 INFO L225 Difference]: With dead ends: 20969 [2019-01-13 02:44:25,251 INFO L226 Difference]: Without dead ends: 20898 [2019-01-13 02:44:25,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 02:44:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2019-01-13 02:44:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2019-01-13 02:44:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2019-01-13 02:44:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2019-01-13 02:44:25,782 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2019-01-13 02:44:25,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:25,783 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2019-01-13 02:44:25,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2019-01-13 02:44:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 02:44:25,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:25,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:25,792 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:25,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1699576415, now seen corresponding path program 1 times [2019-01-13 02:44:25,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:25,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:25,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:25,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:25,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:26,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:26,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:26,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:26,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:26,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:26,038 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2019-01-13 02:44:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:26,572 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2019-01-13 02:44:26,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:44:26,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-13 02:44:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:26,604 INFO L225 Difference]: With dead ends: 17635 [2019-01-13 02:44:26,604 INFO L226 Difference]: Without dead ends: 17635 [2019-01-13 02:44:26,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2019-01-13 02:44:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2019-01-13 02:44:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2019-01-13 02:44:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2019-01-13 02:44:26,894 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2019-01-13 02:44:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:26,894 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2019-01-13 02:44:26,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2019-01-13 02:44:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 02:44:26,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:26,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:26,905 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -377632928, now seen corresponding path program 1 times [2019-01-13 02:44:26,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:26,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:26,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:26,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:26,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:27,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:27,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:44:27,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:44:27,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:44:27,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:44:27,038 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2019-01-13 02:44:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:27,479 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2019-01-13 02:44:27,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:44:27,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-13 02:44:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:27,505 INFO L225 Difference]: With dead ends: 16385 [2019-01-13 02:44:27,506 INFO L226 Difference]: Without dead ends: 16385 [2019-01-13 02:44:27,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:44:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2019-01-13 02:44:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2019-01-13 02:44:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2019-01-13 02:44:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2019-01-13 02:44:27,737 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2019-01-13 02:44:27,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:27,737 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2019-01-13 02:44:27,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:44:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2019-01-13 02:44:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 02:44:27,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:27,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:27,750 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:27,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1938632710, now seen corresponding path program 1 times [2019-01-13 02:44:27,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:27,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:27,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:28,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:28,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:28,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:28,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:28,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:28,209 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2019-01-13 02:44:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:29,886 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2019-01-13 02:44:29,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:29,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-13 02:44:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:29,920 INFO L225 Difference]: With dead ends: 19821 [2019-01-13 02:44:29,920 INFO L226 Difference]: Without dead ends: 19821 [2019-01-13 02:44:29,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2019-01-13 02:44:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2019-01-13 02:44:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2019-01-13 02:44:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2019-01-13 02:44:30,241 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2019-01-13 02:44:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:30,241 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2019-01-13 02:44:30,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2019-01-13 02:44:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 02:44:30,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:30,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:30,254 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:30,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash -138576633, now seen corresponding path program 1 times [2019-01-13 02:44:30,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:30,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:30,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:30,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:30,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:30,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:30,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:30,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:30,645 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2019-01-13 02:44:31,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:31,387 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2019-01-13 02:44:31,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:44:31,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-13 02:44:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:31,423 INFO L225 Difference]: With dead ends: 21449 [2019-01-13 02:44:31,423 INFO L226 Difference]: Without dead ends: 21449 [2019-01-13 02:44:31,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:44:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2019-01-13 02:44:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2019-01-13 02:44:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2019-01-13 02:44:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2019-01-13 02:44:31,715 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2019-01-13 02:44:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:31,715 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2019-01-13 02:44:31,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2019-01-13 02:44:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 02:44:31,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:31,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:31,727 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:31,727 INFO L82 PathProgramCache]: Analyzing trace with hash 72774280, now seen corresponding path program 1 times [2019-01-13 02:44:31,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:31,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:31,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:31,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:31,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:31,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:31,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:31,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:31,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:31,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:31,895 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2019-01-13 02:44:32,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:32,809 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2019-01-13 02:44:32,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:32,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 02:44:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:32,857 INFO L225 Difference]: With dead ends: 25024 [2019-01-13 02:44:32,858 INFO L226 Difference]: Without dead ends: 25024 [2019-01-13 02:44:32,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2019-01-13 02:44:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2019-01-13 02:44:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2019-01-13 02:44:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2019-01-13 02:44:33,257 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2019-01-13 02:44:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:33,257 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2019-01-13 02:44:33,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2019-01-13 02:44:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 02:44:33,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:33,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:33,272 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:33,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:33,273 INFO L82 PathProgramCache]: Analyzing trace with hash -437759897, now seen corresponding path program 1 times [2019-01-13 02:44:33,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:33,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:33,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:33,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:33,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:33,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:33,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:33,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:33,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:33,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:33,453 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 5 states. [2019-01-13 02:44:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:33,517 INFO L93 Difference]: Finished difference Result 7837 states and 18946 transitions. [2019-01-13 02:44:33,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 02:44:33,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 02:44:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:33,528 INFO L225 Difference]: With dead ends: 7837 [2019-01-13 02:44:33,528 INFO L226 Difference]: Without dead ends: 6355 [2019-01-13 02:44:33,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-01-13 02:44:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5703. [2019-01-13 02:44:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5703 states. [2019-01-13 02:44:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 13364 transitions. [2019-01-13 02:44:33,599 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 13364 transitions. Word has length 66 [2019-01-13 02:44:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:33,600 INFO L480 AbstractCegarLoop]: Abstraction has 5703 states and 13364 transitions. [2019-01-13 02:44:33,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 13364 transitions. [2019-01-13 02:44:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 02:44:33,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:33,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:33,607 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2019-01-13 02:44:33,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:33,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:33,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:33,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:33,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:33,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:33,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:44:33,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:44:33,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:44:33,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:44:33,694 INFO L87 Difference]: Start difference. First operand 5703 states and 13364 transitions. Second operand 3 states. [2019-01-13 02:44:33,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:33,945 INFO L93 Difference]: Finished difference Result 7505 states and 17450 transitions. [2019-01-13 02:44:33,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:44:33,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-13 02:44:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:33,959 INFO L225 Difference]: With dead ends: 7505 [2019-01-13 02:44:33,959 INFO L226 Difference]: Without dead ends: 7505 [2019-01-13 02:44:33,959 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-01-13 02:44:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2019-01-13 02:44:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 5642. [2019-01-13 02:44:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-01-13 02:44:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 12904 transitions. [2019-01-13 02:44:34,095 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 12904 transitions. Word has length 66 [2019-01-13 02:44:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:34,096 INFO L480 AbstractCegarLoop]: Abstraction has 5642 states and 12904 transitions. [2019-01-13 02:44:34,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:44:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 12904 transitions. [2019-01-13 02:44:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 02:44:34,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:34,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:34,111 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2019-01-13 02:44:34,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:34,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:34,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:34,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:34,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:34,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:34,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:34,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:34,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:34,287 INFO L87 Difference]: Start difference. First operand 5642 states and 12904 transitions. Second operand 5 states. [2019-01-13 02:44:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:34,510 INFO L93 Difference]: Finished difference Result 6806 states and 15528 transitions. [2019-01-13 02:44:34,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:44:34,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-01-13 02:44:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:34,521 INFO L225 Difference]: With dead ends: 6806 [2019-01-13 02:44:34,522 INFO L226 Difference]: Without dead ends: 6806 [2019-01-13 02:44:34,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:44:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6806 states. [2019-01-13 02:44:34,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6806 to 6086. [2019-01-13 02:44:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6086 states. [2019-01-13 02:44:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 13908 transitions. [2019-01-13 02:44:34,758 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 13908 transitions. Word has length 72 [2019-01-13 02:44:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:34,759 INFO L480 AbstractCegarLoop]: Abstraction has 6086 states and 13908 transitions. [2019-01-13 02:44:34,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 13908 transitions. [2019-01-13 02:44:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 02:44:34,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:34,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:34,767 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:34,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:34,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2019-01-13 02:44:34,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:34,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:34,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:34,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:34,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:35,021 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-13 02:44:35,317 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 6 [2019-01-13 02:44:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:35,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:35,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 02:44:35,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 02:44:35,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 02:44:35,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:44:35,469 INFO L87 Difference]: Start difference. First operand 6086 states and 13908 transitions. Second operand 9 states. [2019-01-13 02:44:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:36,397 INFO L93 Difference]: Finished difference Result 8112 states and 18389 transitions. [2019-01-13 02:44:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 02:44:36,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-01-13 02:44:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:36,408 INFO L225 Difference]: With dead ends: 8112 [2019-01-13 02:44:36,409 INFO L226 Difference]: Without dead ends: 7993 [2019-01-13 02:44:36,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-01-13 02:44:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states. [2019-01-13 02:44:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 6183. [2019-01-13 02:44:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6183 states. [2019-01-13 02:44:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 14001 transitions. [2019-01-13 02:44:36,480 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 14001 transitions. Word has length 72 [2019-01-13 02:44:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:36,480 INFO L480 AbstractCegarLoop]: Abstraction has 6183 states and 14001 transitions. [2019-01-13 02:44:36,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 02:44:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 14001 transitions. [2019-01-13 02:44:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 02:44:36,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:36,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:36,490 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:36,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash 641730713, now seen corresponding path program 1 times [2019-01-13 02:44:36,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:36,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:36,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:36,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:36,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:36,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:36,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:36,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:36,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:36,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:36,605 INFO L87 Difference]: Start difference. First operand 6183 states and 14001 transitions. Second operand 4 states. [2019-01-13 02:44:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:36,988 INFO L93 Difference]: Finished difference Result 9854 states and 22232 transitions. [2019-01-13 02:44:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:44:36,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 02:44:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:37,001 INFO L225 Difference]: With dead ends: 9854 [2019-01-13 02:44:37,001 INFO L226 Difference]: Without dead ends: 9854 [2019-01-13 02:44:37,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-13 02:44:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9854 states. [2019-01-13 02:44:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9854 to 7303. [2019-01-13 02:44:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2019-01-13 02:44:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 16335 transitions. [2019-01-13 02:44:37,088 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 16335 transitions. Word has length 91 [2019-01-13 02:44:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:37,088 INFO L480 AbstractCegarLoop]: Abstraction has 7303 states and 16335 transitions. [2019-01-13 02:44:37,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 16335 transitions. [2019-01-13 02:44:37,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 02:44:37,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:37,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:37,098 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:37,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:37,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1490266353, now seen corresponding path program 1 times [2019-01-13 02:44:37,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:37,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:37,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:37,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:37,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:37,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:37,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:37,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:37,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:37,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:37,347 INFO L87 Difference]: Start difference. First operand 7303 states and 16335 transitions. Second operand 4 states. [2019-01-13 02:44:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:37,768 INFO L93 Difference]: Finished difference Result 7805 states and 17493 transitions. [2019-01-13 02:44:37,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:44:37,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 02:44:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:37,777 INFO L225 Difference]: With dead ends: 7805 [2019-01-13 02:44:37,777 INFO L226 Difference]: Without dead ends: 7805 [2019-01-13 02:44:37,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7805 states. [2019-01-13 02:44:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7805 to 7209. [2019-01-13 02:44:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-01-13 02:44:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 16230 transitions. [2019-01-13 02:44:37,852 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 16230 transitions. Word has length 91 [2019-01-13 02:44:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:37,852 INFO L480 AbstractCegarLoop]: Abstraction has 7209 states and 16230 transitions. [2019-01-13 02:44:37,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 16230 transitions. [2019-01-13 02:44:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:37,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:37,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:37,860 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:37,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:37,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1849503775, now seen corresponding path program 1 times [2019-01-13 02:44:37,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:37,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:37,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:37,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:37,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:38,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:38,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:44:38,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:44:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:44:38,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:38,118 INFO L87 Difference]: Start difference. First operand 7209 states and 16230 transitions. Second operand 7 states. [2019-01-13 02:44:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:38,970 INFO L93 Difference]: Finished difference Result 8986 states and 20184 transitions. [2019-01-13 02:44:38,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:38,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 02:44:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:38,983 INFO L225 Difference]: With dead ends: 8986 [2019-01-13 02:44:38,983 INFO L226 Difference]: Without dead ends: 8986 [2019-01-13 02:44:38,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8986 states. [2019-01-13 02:44:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8986 to 7321. [2019-01-13 02:44:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-01-13 02:44:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 16550 transitions. [2019-01-13 02:44:39,066 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 16550 transitions. Word has length 93 [2019-01-13 02:44:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:39,067 INFO L480 AbstractCegarLoop]: Abstraction has 7321 states and 16550 transitions. [2019-01-13 02:44:39,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:44:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 16550 transitions. [2019-01-13 02:44:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:39,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:39,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:39,075 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:39,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:39,075 INFO L82 PathProgramCache]: Analyzing trace with hash 286007970, now seen corresponding path program 1 times [2019-01-13 02:44:39,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:39,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:39,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:39,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:39,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:39,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:39,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:39,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:39,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:39,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:39,185 INFO L87 Difference]: Start difference. First operand 7321 states and 16550 transitions. Second operand 5 states. [2019-01-13 02:44:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:39,322 INFO L93 Difference]: Finished difference Result 8130 states and 18286 transitions. [2019-01-13 02:44:39,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:39,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 02:44:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:39,332 INFO L225 Difference]: With dead ends: 8130 [2019-01-13 02:44:39,332 INFO L226 Difference]: Without dead ends: 8130 [2019-01-13 02:44:39,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2019-01-13 02:44:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 6217. [2019-01-13 02:44:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2019-01-13 02:44:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 14069 transitions. [2019-01-13 02:44:39,404 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 14069 transitions. Word has length 93 [2019-01-13 02:44:39,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:39,404 INFO L480 AbstractCegarLoop]: Abstraction has 6217 states and 14069 transitions. [2019-01-13 02:44:39,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 14069 transitions. [2019-01-13 02:44:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:39,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:39,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:39,411 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:39,412 INFO L82 PathProgramCache]: Analyzing trace with hash 31271425, now seen corresponding path program 1 times [2019-01-13 02:44:39,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:39,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:39,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:39,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:39,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:39,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:39,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:39,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:39,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:39,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:39,735 INFO L87 Difference]: Start difference. First operand 6217 states and 14069 transitions. Second operand 5 states. [2019-01-13 02:44:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:40,421 INFO L93 Difference]: Finished difference Result 9852 states and 22424 transitions. [2019-01-13 02:44:40,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:44:40,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 02:44:40,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:40,434 INFO L225 Difference]: With dead ends: 9852 [2019-01-13 02:44:40,434 INFO L226 Difference]: Without dead ends: 9774 [2019-01-13 02:44:40,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:44:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2019-01-13 02:44:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 7358. [2019-01-13 02:44:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7358 states. [2019-01-13 02:44:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7358 states to 7358 states and 16716 transitions. [2019-01-13 02:44:40,530 INFO L78 Accepts]: Start accepts. Automaton has 7358 states and 16716 transitions. Word has length 93 [2019-01-13 02:44:40,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:40,530 INFO L480 AbstractCegarLoop]: Abstraction has 7358 states and 16716 transitions. [2019-01-13 02:44:40,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 7358 states and 16716 transitions. [2019-01-13 02:44:40,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:40,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:40,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:40,540 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:40,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1276035906, now seen corresponding path program 1 times [2019-01-13 02:44:40,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:40,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:40,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:40,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:40,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:40,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:40,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:40,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:40,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:40,766 INFO L87 Difference]: Start difference. First operand 7358 states and 16716 transitions. Second operand 6 states. [2019-01-13 02:44:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:42,766 INFO L93 Difference]: Finished difference Result 9349 states and 21078 transitions. [2019-01-13 02:44:42,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 02:44:42,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 02:44:42,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:42,780 INFO L225 Difference]: With dead ends: 9349 [2019-01-13 02:44:42,780 INFO L226 Difference]: Without dead ends: 9270 [2019-01-13 02:44:42,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 02:44:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9270 states. [2019-01-13 02:44:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9270 to 6928. [2019-01-13 02:44:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6928 states. [2019-01-13 02:44:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6928 states to 6928 states and 15763 transitions. [2019-01-13 02:44:42,863 INFO L78 Accepts]: Start accepts. Automaton has 6928 states and 15763 transitions. Word has length 93 [2019-01-13 02:44:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:42,863 INFO L480 AbstractCegarLoop]: Abstraction has 6928 states and 15763 transitions. [2019-01-13 02:44:42,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6928 states and 15763 transitions. [2019-01-13 02:44:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:42,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:42,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:42,873 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash 659591573, now seen corresponding path program 1 times [2019-01-13 02:44:42,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:42,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:42,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:42,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:42,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:43,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:43,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 02:44:43,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 02:44:43,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 02:44:43,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:44:43,093 INFO L87 Difference]: Start difference. First operand 6928 states and 15763 transitions. Second operand 9 states. [2019-01-13 02:44:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:43,853 INFO L93 Difference]: Finished difference Result 9639 states and 21910 transitions. [2019-01-13 02:44:43,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 02:44:43,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-01-13 02:44:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:43,865 INFO L225 Difference]: With dead ends: 9639 [2019-01-13 02:44:43,865 INFO L226 Difference]: Without dead ends: 9639 [2019-01-13 02:44:43,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-01-13 02:44:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2019-01-13 02:44:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 8631. [2019-01-13 02:44:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8631 states. [2019-01-13 02:44:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8631 states to 8631 states and 19631 transitions. [2019-01-13 02:44:43,955 INFO L78 Accepts]: Start accepts. Automaton has 8631 states and 19631 transitions. Word has length 93 [2019-01-13 02:44:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:43,956 INFO L480 AbstractCegarLoop]: Abstraction has 8631 states and 19631 transitions. [2019-01-13 02:44:43,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 02:44:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand 8631 states and 19631 transitions. [2019-01-13 02:44:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:43,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:43,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:43,967 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1827921260, now seen corresponding path program 1 times [2019-01-13 02:44:43,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:43,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:43,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:43,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:43,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:44,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:44,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:44,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:44,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:44,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:44,070 INFO L87 Difference]: Start difference. First operand 8631 states and 19631 transitions. Second operand 4 states. [2019-01-13 02:44:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:44,193 INFO L93 Difference]: Finished difference Result 8903 states and 20327 transitions. [2019-01-13 02:44:44,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:44:44,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-13 02:44:44,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:44,206 INFO L225 Difference]: With dead ends: 8903 [2019-01-13 02:44:44,206 INFO L226 Difference]: Without dead ends: 8871 [2019-01-13 02:44:44,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8871 states. [2019-01-13 02:44:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8871 to 8727. [2019-01-13 02:44:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8727 states. [2019-01-13 02:44:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8727 states to 8727 states and 19887 transitions. [2019-01-13 02:44:44,297 INFO L78 Accepts]: Start accepts. Automaton has 8727 states and 19887 transitions. Word has length 93 [2019-01-13 02:44:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:44,298 INFO L480 AbstractCegarLoop]: Abstraction has 8727 states and 19887 transitions. [2019-01-13 02:44:44,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 8727 states and 19887 transitions. [2019-01-13 02:44:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:44,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:44,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:44,308 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1137359786, now seen corresponding path program 1 times [2019-01-13 02:44:44,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:44,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:44,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:44,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:44,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:44,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:44,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 02:44:44,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 02:44:44,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 02:44:44,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:44:44,495 INFO L87 Difference]: Start difference. First operand 8727 states and 19887 transitions. Second operand 8 states. [2019-01-13 02:44:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:45,017 INFO L93 Difference]: Finished difference Result 13198 states and 30502 transitions. [2019-01-13 02:44:45,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 02:44:45,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-01-13 02:44:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:45,035 INFO L225 Difference]: With dead ends: 13198 [2019-01-13 02:44:45,035 INFO L226 Difference]: Without dead ends: 13198 [2019-01-13 02:44:45,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 02:44:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13198 states. [2019-01-13 02:44:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13198 to 9365. [2019-01-13 02:44:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-01-13 02:44:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 21554 transitions. [2019-01-13 02:44:45,160 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 21554 transitions. Word has length 93 [2019-01-13 02:44:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:45,160 INFO L480 AbstractCegarLoop]: Abstraction has 9365 states and 21554 transitions. [2019-01-13 02:44:45,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 02:44:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 21554 transitions. [2019-01-13 02:44:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:45,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:45,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:45,171 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:45,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:45,172 INFO L82 PathProgramCache]: Analyzing trace with hash -249856105, now seen corresponding path program 1 times [2019-01-13 02:44:45,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:45,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:45,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:45,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:45,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:45,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 02:44:45,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 02:44:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 02:44:45,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-13 02:44:45,421 INFO L87 Difference]: Start difference. First operand 9365 states and 21554 transitions. Second operand 10 states. [2019-01-13 02:44:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:46,351 INFO L93 Difference]: Finished difference Result 12545 states and 28910 transitions. [2019-01-13 02:44:46,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 02:44:46,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-01-13 02:44:46,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:46,368 INFO L225 Difference]: With dead ends: 12545 [2019-01-13 02:44:46,368 INFO L226 Difference]: Without dead ends: 12545 [2019-01-13 02:44:46,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-01-13 02:44:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12545 states. [2019-01-13 02:44:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12545 to 10501. [2019-01-13 02:44:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10501 states. [2019-01-13 02:44:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 24012 transitions. [2019-01-13 02:44:46,501 INFO L78 Accepts]: Start accepts. Automaton has 10501 states and 24012 transitions. Word has length 93 [2019-01-13 02:44:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:46,501 INFO L480 AbstractCegarLoop]: Abstraction has 10501 states and 24012 transitions. [2019-01-13 02:44:46,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 02:44:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 10501 states and 24012 transitions. [2019-01-13 02:44:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:46,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:46,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:46,514 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:46,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1981831657, now seen corresponding path program 1 times [2019-01-13 02:44:46,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:46,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:46,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:46,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:46,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:46,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:46,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:46,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:46,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:46,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:46,689 INFO L87 Difference]: Start difference. First operand 10501 states and 24012 transitions. Second operand 6 states. [2019-01-13 02:44:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:46,848 INFO L93 Difference]: Finished difference Result 10133 states and 22836 transitions. [2019-01-13 02:44:46,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:46,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 02:44:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:46,861 INFO L225 Difference]: With dead ends: 10133 [2019-01-13 02:44:46,861 INFO L226 Difference]: Without dead ends: 10133 [2019-01-13 02:44:46,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:44:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10133 states. [2019-01-13 02:44:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10133 to 7136. [2019-01-13 02:44:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2019-01-13 02:44:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 16093 transitions. [2019-01-13 02:44:46,972 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 16093 transitions. Word has length 93 [2019-01-13 02:44:46,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:46,972 INFO L480 AbstractCegarLoop]: Abstraction has 7136 states and 16093 transitions. [2019-01-13 02:44:46,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 16093 transitions. [2019-01-13 02:44:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 02:44:46,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:46,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:46,980 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:46,980 INFO L82 PathProgramCache]: Analyzing trace with hash -402802423, now seen corresponding path program 1 times [2019-01-13 02:44:46,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:46,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:46,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:46,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:46,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:47,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:47,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:47,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:47,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:47,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:47,183 INFO L87 Difference]: Start difference. First operand 7136 states and 16093 transitions. Second operand 5 states. [2019-01-13 02:44:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:47,231 INFO L93 Difference]: Finished difference Result 7136 states and 16077 transitions. [2019-01-13 02:44:47,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:44:47,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-01-13 02:44:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:47,242 INFO L225 Difference]: With dead ends: 7136 [2019-01-13 02:44:47,242 INFO L226 Difference]: Without dead ends: 7136 [2019-01-13 02:44:47,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7136 states. [2019-01-13 02:44:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7136 to 7136. [2019-01-13 02:44:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2019-01-13 02:44:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 16077 transitions. [2019-01-13 02:44:47,311 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 16077 transitions. Word has length 95 [2019-01-13 02:44:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:47,312 INFO L480 AbstractCegarLoop]: Abstraction has 7136 states and 16077 transitions. [2019-01-13 02:44:47,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 16077 transitions. [2019-01-13 02:44:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 02:44:47,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:47,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:47,320 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:47,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:47,320 INFO L82 PathProgramCache]: Analyzing trace with hash 484701258, now seen corresponding path program 1 times [2019-01-13 02:44:47,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:47,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:47,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:47,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:47,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:47,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:47,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 02:44:47,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 02:44:47,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 02:44:47,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 02:44:47,553 INFO L87 Difference]: Start difference. First operand 7136 states and 16077 transitions. Second operand 11 states. [2019-01-13 02:44:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:49,262 INFO L93 Difference]: Finished difference Result 13009 states and 29370 transitions. [2019-01-13 02:44:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 02:44:49,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-01-13 02:44:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:49,277 INFO L225 Difference]: With dead ends: 13009 [2019-01-13 02:44:49,277 INFO L226 Difference]: Without dead ends: 9288 [2019-01-13 02:44:49,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-13 02:44:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2019-01-13 02:44:49,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 6975. [2019-01-13 02:44:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6975 states. [2019-01-13 02:44:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6975 states to 6975 states and 15659 transitions. [2019-01-13 02:44:49,364 INFO L78 Accepts]: Start accepts. Automaton has 6975 states and 15659 transitions. Word has length 95 [2019-01-13 02:44:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:49,364 INFO L480 AbstractCegarLoop]: Abstraction has 6975 states and 15659 transitions. [2019-01-13 02:44:49,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 02:44:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 6975 states and 15659 transitions. [2019-01-13 02:44:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 02:44:49,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:49,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:49,372 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:49,372 INFO L82 PathProgramCache]: Analyzing trace with hash -860395469, now seen corresponding path program 1 times [2019-01-13 02:44:49,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:49,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:49,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:49,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:49,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:49,776 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 02:44:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:49,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:49,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:49,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:49,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:49,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:49,925 INFO L87 Difference]: Start difference. First operand 6975 states and 15659 transitions. Second operand 6 states. [2019-01-13 02:44:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:50,128 INFO L93 Difference]: Finished difference Result 7816 states and 17333 transitions. [2019-01-13 02:44:50,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:50,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-13 02:44:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:50,139 INFO L225 Difference]: With dead ends: 7816 [2019-01-13 02:44:50,139 INFO L226 Difference]: Without dead ends: 7783 [2019-01-13 02:44:50,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7783 states. [2019-01-13 02:44:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7783 to 6922. [2019-01-13 02:44:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6922 states. [2019-01-13 02:44:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6922 states to 6922 states and 15422 transitions. [2019-01-13 02:44:50,239 INFO L78 Accepts]: Start accepts. Automaton has 6922 states and 15422 transitions. Word has length 95 [2019-01-13 02:44:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:50,240 INFO L480 AbstractCegarLoop]: Abstraction has 6922 states and 15422 transitions. [2019-01-13 02:44:50,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6922 states and 15422 transitions. [2019-01-13 02:44:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 02:44:50,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:50,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:50,249 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:50,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1196866221, now seen corresponding path program 2 times [2019-01-13 02:44:50,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:50,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:50,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:50,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:50,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:50,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:50,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:50,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:50,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:50,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:50,623 INFO L87 Difference]: Start difference. First operand 6922 states and 15422 transitions. Second operand 6 states. [2019-01-13 02:44:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:50,851 INFO L93 Difference]: Finished difference Result 7419 states and 16444 transitions. [2019-01-13 02:44:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:44:50,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-13 02:44:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:50,862 INFO L225 Difference]: With dead ends: 7419 [2019-01-13 02:44:50,862 INFO L226 Difference]: Without dead ends: 7419 [2019-01-13 02:44:50,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:44:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2019-01-13 02:44:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 6900. [2019-01-13 02:44:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6900 states. [2019-01-13 02:44:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 15351 transitions. [2019-01-13 02:44:50,955 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 15351 transitions. Word has length 95 [2019-01-13 02:44:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:50,955 INFO L480 AbstractCegarLoop]: Abstraction has 6900 states and 15351 transitions. [2019-01-13 02:44:50,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 15351 transitions. [2019-01-13 02:44:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 02:44:50,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:50,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 02:44:50,965 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:50,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:50,965 INFO L82 PathProgramCache]: Analyzing trace with hash -530629708, now seen corresponding path program 2 times [2019-01-13 02:44:50,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:50,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:50,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:50,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 02:44:50,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:44:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:44:51,060 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 02:44:51,282 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 02:44:51,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 02:44:51 BasicIcfg [2019-01-13 02:44:51,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 02:44:51,285 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 02:44:51,285 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 02:44:51,286 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 02:44:51,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:44:10" (3/4) ... [2019-01-13 02:44:51,292 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 02:44:51,561 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 02:44:51,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 02:44:51,565 INFO L168 Benchmark]: Toolchain (without parser) took 43017.25 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 947.3 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-01-13 02:44:51,567 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 02:44:51,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 968.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-13 02:44:51,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-13 02:44:51,569 INFO L168 Benchmark]: Boogie Preprocessor took 52.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 02:44:51,569 INFO L168 Benchmark]: RCFGBuilder took 1147.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-01-13 02:44:51,570 INFO L168 Benchmark]: TraceAbstraction took 40494.99 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 701.1 MB in the end (delta: 388.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-13 02:44:51,570 INFO L168 Benchmark]: Witness Printer took 278.21 ms. Allocated memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 48.8 MB). Free memory was 701.1 MB in the beginning and 2.3 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2019-01-13 02:44:51,578 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 968.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1147.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40494.99 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 701.1 MB in the end (delta: 388.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 278.21 ms. Allocated memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 48.8 MB). Free memory was 701.1 MB in the beginning and 2.3 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1297; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1297, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] -1 pthread_t t1298; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t1298, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 40.2s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 22.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7804 SDtfs, 8703 SDslu, 18890 SDs, 0 SdLazy, 8468 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 83 SyntacticMatches, 30 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34806occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 72589 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2440 NumberOfCodeBlocks, 2440 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2314 ConstructedInterpolants, 0 QuantifiedInterpolants, 518971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...