./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe034_pso.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/safe034_pso.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 5773853da13f4c03c8f7fa9f07c3d53ddc3caa5b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:39:38,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:39:38,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:39:38,599 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:39:38,599 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:39:38,600 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:39:38,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:39:38,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:39:38,605 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:39:38,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:39:38,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:39:38,608 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:39:38,609 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:39:38,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:39:38,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:39:38,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:39:38,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:39:38,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:39:38,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:39:38,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:39:38,633 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:39:38,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:39:38,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:39:38,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:39:38,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:39:38,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:39:38,648 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:39:38,649 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:39:38,649 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:39:38,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:39:38,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:39:38,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:39:38,656 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:39:38,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:39:38,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:39:38,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:39:38,659 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:39:38,689 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:39:38,690 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:39:38,692 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:39:38,693 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:39:38,694 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:39:38,694 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:39:38,694 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:39:38,694 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:39:38,694 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:39:38,694 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:39:38,696 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:39:38,696 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:39:38,696 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:39:38,696 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:39:38,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:39:38,697 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:39:38,697 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:39:38,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:39:38,698 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:39:38,698 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:39:38,698 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:39:38,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:39:38,699 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:39:38,699 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:39:38,699 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:39:38,699 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:39:38,699 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:39:38,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:39:38,703 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 -> 5773853da13f4c03c8f7fa9f07c3d53ddc3caa5b [2019-01-13 05:39:38,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:39:38,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:39:38,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:39:38,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:39:38,784 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:39:38,785 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe034_pso.opt_false-unreach-call.i [2019-01-13 05:39:38,851 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c6c7d6c/a954194ef5a64bcdab6034153c2d557b/FLAG3e9ee51e7 [2019-01-13 05:39:39,450 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:39:39,451 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe034_pso.opt_false-unreach-call.i [2019-01-13 05:39:39,466 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c6c7d6c/a954194ef5a64bcdab6034153c2d557b/FLAG3e9ee51e7 [2019-01-13 05:39:39,709 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c6c7d6c/a954194ef5a64bcdab6034153c2d557b [2019-01-13 05:39:39,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:39:39,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:39:39,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:39:39,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:39:39,719 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:39:39,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:39:39" (1/1) ... [2019-01-13 05:39:39,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c433c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:39, skipping insertion in model container [2019-01-13 05:39:39,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:39:39" (1/1) ... [2019-01-13 05:39:39,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:39:39,797 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:39:40,339 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:39:40,372 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:39:40,537 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:39:40,626 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:39:40,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40 WrapperNode [2019-01-13 05:39:40,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:39:40,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:39:40,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:39:40,629 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:39:40,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40" (1/1) ... [2019-01-13 05:39:40,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40" (1/1) ... [2019-01-13 05:39:40,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:39:40,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:39:40,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:39:40,691 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:39:40,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40" (1/1) ... [2019-01-13 05:39:40,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40" (1/1) ... [2019-01-13 05:39:40,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40" (1/1) ... [2019-01-13 05:39:40,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40" (1/1) ... [2019-01-13 05:39:40,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40" (1/1) ... [2019-01-13 05:39:40,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40" (1/1) ... [2019-01-13 05:39:40,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40" (1/1) ... [2019-01-13 05:39:40,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:39:40,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:39:40,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:39:40,732 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:39:40,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40" (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 05:39:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:39:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 05:39:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:39:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:39:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 05:39:40,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 05:39:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 05:39:40,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 05:39:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-13 05:39:40,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-13 05:39:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 05:39:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:39:40,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:39:40,816 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 05:39:41,877 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:39:41,878 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 05:39:41,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:39:41 BoogieIcfgContainer [2019-01-13 05:39:41,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:39:41,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:39:41,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:39:41,884 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:39:41,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:39:39" (1/3) ... [2019-01-13 05:39:41,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a2408b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:39:41, skipping insertion in model container [2019-01-13 05:39:41,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:39:40" (2/3) ... [2019-01-13 05:39:41,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a2408b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:39:41, skipping insertion in model container [2019-01-13 05:39:41,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:39:41" (3/3) ... [2019-01-13 05:39:41,889 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_pso.opt_false-unreach-call.i [2019-01-13 05:39:41,936 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,936 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,937 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,937 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,940 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,940 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,988 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,988 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,988 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,988 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,989 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,991 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,991 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,991 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,992 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,992 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,992 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,992 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,992 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,993 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,993 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,993 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,993 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,993 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,997 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,997 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,997 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,997 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:41,997 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:39:42,038 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:39:42,039 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:39:42,048 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 05:39:42,065 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 05:39:42,090 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:39:42,091 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:39:42,091 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:39:42,092 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:39:42,092 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:39:42,092 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:39:42,092 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:39:42,092 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:39:42,092 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:39:42,106 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 175 transitions [2019-01-13 05:40:10,303 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149043 states. [2019-01-13 05:40:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 149043 states. [2019-01-13 05:40:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 05:40:10,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:10,326 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] [2019-01-13 05:40:10,328 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1284724798, now seen corresponding path program 1 times [2019-01-13 05:40:10,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:10,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:10,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:10,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:10,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:10,735 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 05:40:10,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:10,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:40:10,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:40:10,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:40:10,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:40:10,764 INFO L87 Difference]: Start difference. First operand 149043 states. Second operand 4 states. [2019-01-13 05:40:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:12,904 INFO L93 Difference]: Finished difference Result 257063 states and 1188602 transitions. [2019-01-13 05:40:12,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:40:12,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-13 05:40:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:14,035 INFO L225 Difference]: With dead ends: 257063 [2019-01-13 05:40:14,036 INFO L226 Difference]: Without dead ends: 174813 [2019-01-13 05:40:14,038 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 05:40:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174813 states. [2019-01-13 05:40:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174813 to 110553. [2019-01-13 05:40:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2019-01-13 05:40:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511484 transitions. [2019-01-13 05:40:25,538 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511484 transitions. Word has length 44 [2019-01-13 05:40:25,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:25,539 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511484 transitions. [2019-01-13 05:40:25,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:40:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511484 transitions. [2019-01-13 05:40:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 05:40:25,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:25,564 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 05:40:25,564 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:25,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:25,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1885719038, now seen corresponding path program 1 times [2019-01-13 05:40:25,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:25,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:25,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:25,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:25,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:25,696 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 05:40:25,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:25,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:40:25,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:40:25,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:40:25,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:40:25,700 INFO L87 Difference]: Start difference. First operand 110553 states and 511484 transitions. Second operand 3 states. [2019-01-13 05:40:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:28,787 INFO L93 Difference]: Finished difference Result 110553 states and 511379 transitions. [2019-01-13 05:40:28,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:40:28,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-13 05:40:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:29,334 INFO L225 Difference]: With dead ends: 110553 [2019-01-13 05:40:29,335 INFO L226 Difference]: Without dead ends: 110553 [2019-01-13 05:40:29,337 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 05:40:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110553 states. [2019-01-13 05:40:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110553 to 110553. [2019-01-13 05:40:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2019-01-13 05:40:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511379 transitions. [2019-01-13 05:40:32,326 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511379 transitions. Word has length 52 [2019-01-13 05:40:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:32,327 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511379 transitions. [2019-01-13 05:40:32,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:40:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511379 transitions. [2019-01-13 05:40:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 05:40:32,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:32,342 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 05:40:32,342 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash -142908703, now seen corresponding path program 1 times [2019-01-13 05:40:32,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:32,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:32,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:32,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:32,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:32,522 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 05:40:32,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:32,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:40:32,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:40:32,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:40:32,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:40:32,524 INFO L87 Difference]: Start difference. First operand 110553 states and 511379 transitions. Second operand 4 states. [2019-01-13 05:40:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:34,729 INFO L93 Difference]: Finished difference Result 99451 states and 448604 transitions. [2019-01-13 05:40:34,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:40:34,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-01-13 05:40:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:35,028 INFO L225 Difference]: With dead ends: 99451 [2019-01-13 05:40:35,028 INFO L226 Difference]: Without dead ends: 95221 [2019-01-13 05:40:35,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:40:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95221 states. [2019-01-13 05:40:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95221 to 95221. [2019-01-13 05:40:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95221 states. [2019-01-13 05:40:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95221 states to 95221 states and 432988 transitions. [2019-01-13 05:40:37,307 INFO L78 Accepts]: Start accepts. Automaton has 95221 states and 432988 transitions. Word has length 52 [2019-01-13 05:40:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:37,308 INFO L480 AbstractCegarLoop]: Abstraction has 95221 states and 432988 transitions. [2019-01-13 05:40:37,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:40:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 95221 states and 432988 transitions. [2019-01-13 05:40:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 05:40:37,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:37,323 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] [2019-01-13 05:40:37,323 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:37,323 INFO L82 PathProgramCache]: Analyzing trace with hash -805360345, now seen corresponding path program 1 times [2019-01-13 05:40:37,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:37,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:37,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:37,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:37,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:37,486 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 05:40:37,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:37,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:40:37,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:40:37,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:40:37,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:40:37,487 INFO L87 Difference]: Start difference. First operand 95221 states and 432988 transitions. Second operand 5 states. [2019-01-13 05:40:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:37,795 INFO L93 Difference]: Finished difference Result 30965 states and 124168 transitions. [2019-01-13 05:40:37,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:40:37,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-01-13 05:40:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:37,857 INFO L225 Difference]: With dead ends: 30965 [2019-01-13 05:40:37,857 INFO L226 Difference]: Without dead ends: 27337 [2019-01-13 05:40:37,858 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 05:40:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27337 states. [2019-01-13 05:40:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27337 to 26877. [2019-01-13 05:40:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26877 states. [2019-01-13 05:40:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26877 states to 26877 states and 107650 transitions. [2019-01-13 05:40:38,309 INFO L78 Accepts]: Start accepts. Automaton has 26877 states and 107650 transitions. Word has length 53 [2019-01-13 05:40:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:38,310 INFO L480 AbstractCegarLoop]: Abstraction has 26877 states and 107650 transitions. [2019-01-13 05:40:38,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:40:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 26877 states and 107650 transitions. [2019-01-13 05:40:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 05:40:38,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:38,314 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] [2019-01-13 05:40:38,314 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1570820033, now seen corresponding path program 1 times [2019-01-13 05:40:38,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:38,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:38,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:38,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:38,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:38,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 05:40:38,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:38,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:40:38,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:40:38,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:40:38,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:40:38,467 INFO L87 Difference]: Start difference. First operand 26877 states and 107650 transitions. Second operand 5 states. [2019-01-13 05:40:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:39,498 INFO L93 Difference]: Finished difference Result 51021 states and 201904 transitions. [2019-01-13 05:40:39,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:40:39,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-01-13 05:40:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:39,630 INFO L225 Difference]: With dead ends: 51021 [2019-01-13 05:40:39,630 INFO L226 Difference]: Without dead ends: 50646 [2019-01-13 05:40:39,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:40:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50646 states. [2019-01-13 05:40:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50646 to 35270. [2019-01-13 05:40:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35270 states. [2019-01-13 05:40:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35270 states to 35270 states and 138745 transitions. [2019-01-13 05:40:40,436 INFO L78 Accepts]: Start accepts. Automaton has 35270 states and 138745 transitions. Word has length 53 [2019-01-13 05:40:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:40,436 INFO L480 AbstractCegarLoop]: Abstraction has 35270 states and 138745 transitions. [2019-01-13 05:40:40,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:40:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 35270 states and 138745 transitions. [2019-01-13 05:40:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-13 05:40:40,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:40,441 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] [2019-01-13 05:40:40,441 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:40,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:40,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2068992963, now seen corresponding path program 1 times [2019-01-13 05:40:40,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:40,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:40,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:40,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:40,533 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 05:40:40,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:40,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:40:40,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:40:40,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:40:40,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:40:40,534 INFO L87 Difference]: Start difference. First operand 35270 states and 138745 transitions. Second operand 3 states. [2019-01-13 05:40:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:40,883 INFO L93 Difference]: Finished difference Result 46810 states and 182037 transitions. [2019-01-13 05:40:40,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:40:40,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-01-13 05:40:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:40,990 INFO L225 Difference]: With dead ends: 46810 [2019-01-13 05:40:40,990 INFO L226 Difference]: Without dead ends: 46790 [2019-01-13 05:40:40,992 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 05:40:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46790 states. [2019-01-13 05:40:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46790 to 36252. [2019-01-13 05:40:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36252 states. [2019-01-13 05:40:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36252 states to 36252 states and 141452 transitions. [2019-01-13 05:40:41,690 INFO L78 Accepts]: Start accepts. Automaton has 36252 states and 141452 transitions. Word has length 55 [2019-01-13 05:40:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:41,691 INFO L480 AbstractCegarLoop]: Abstraction has 36252 states and 141452 transitions. [2019-01-13 05:40:41,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:40:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 36252 states and 141452 transitions. [2019-01-13 05:40:41,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-13 05:40:41,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:41,698 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] [2019-01-13 05:40:41,698 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:41,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:41,699 INFO L82 PathProgramCache]: Analyzing trace with hash -43565154, now seen corresponding path program 1 times [2019-01-13 05:40:41,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:41,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:41,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:41,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:41,972 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-13 05:40:42,057 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 05:40:42,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:42,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:40:42,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:40:42,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:40:42,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:40:42,059 INFO L87 Difference]: Start difference. First operand 36252 states and 141452 transitions. Second operand 8 states. [2019-01-13 05:40:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:43,285 INFO L93 Difference]: Finished difference Result 46960 states and 180450 transitions. [2019-01-13 05:40:43,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:40:43,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-01-13 05:40:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:43,393 INFO L225 Difference]: With dead ends: 46960 [2019-01-13 05:40:43,393 INFO L226 Difference]: Without dead ends: 46495 [2019-01-13 05:40:43,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-01-13 05:40:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46495 states. [2019-01-13 05:40:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46495 to 39286. [2019-01-13 05:40:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39286 states. [2019-01-13 05:40:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39286 states to 39286 states and 153148 transitions. [2019-01-13 05:40:44,112 INFO L78 Accepts]: Start accepts. Automaton has 39286 states and 153148 transitions. Word has length 59 [2019-01-13 05:40:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:44,113 INFO L480 AbstractCegarLoop]: Abstraction has 39286 states and 153148 transitions. [2019-01-13 05:40:44,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:40:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 39286 states and 153148 transitions. [2019-01-13 05:40:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 05:40:44,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:44,136 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] [2019-01-13 05:40:44,137 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:44,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:44,137 INFO L82 PathProgramCache]: Analyzing trace with hash -41019099, now seen corresponding path program 1 times [2019-01-13 05:40:44,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:44,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:44,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:44,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:44,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:44,311 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 05:40:44,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:44,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:40:44,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:40:44,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:40:44,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:40:44,312 INFO L87 Difference]: Start difference. First operand 39286 states and 153148 transitions. Second operand 4 states. [2019-01-13 05:40:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:44,782 INFO L93 Difference]: Finished difference Result 46099 states and 179011 transitions. [2019-01-13 05:40:44,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:40:44,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-01-13 05:40:44,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:44,886 INFO L225 Difference]: With dead ends: 46099 [2019-01-13 05:40:44,886 INFO L226 Difference]: Without dead ends: 46099 [2019-01-13 05:40:44,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 05:40:45,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46099 states. [2019-01-13 05:40:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46099 to 42131. [2019-01-13 05:40:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42131 states. [2019-01-13 05:40:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42131 states to 42131 states and 163843 transitions. [2019-01-13 05:40:46,133 INFO L78 Accepts]: Start accepts. Automaton has 42131 states and 163843 transitions. Word has length 70 [2019-01-13 05:40:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:46,134 INFO L480 AbstractCegarLoop]: Abstraction has 42131 states and 163843 transitions. [2019-01-13 05:40:46,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:40:46,134 INFO L276 IsEmpty]: Start isEmpty. Operand 42131 states and 163843 transitions. [2019-01-13 05:40:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 05:40:46,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:46,160 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] [2019-01-13 05:40:46,160 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:46,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1701791236, now seen corresponding path program 1 times [2019-01-13 05:40:46,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:46,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:46,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:46,379 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 05:40:46,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:46,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:40:46,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:40:46,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:40:46,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:40:46,380 INFO L87 Difference]: Start difference. First operand 42131 states and 163843 transitions. Second operand 6 states. [2019-01-13 05:40:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:46,513 INFO L93 Difference]: Finished difference Result 13811 states and 46067 transitions. [2019-01-13 05:40:46,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:40:46,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-01-13 05:40:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:46,538 INFO L225 Difference]: With dead ends: 13811 [2019-01-13 05:40:46,539 INFO L226 Difference]: Without dead ends: 11555 [2019-01-13 05:40:46,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:40:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11555 states. [2019-01-13 05:40:46,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11555 to 11015. [2019-01-13 05:40:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11015 states. [2019-01-13 05:40:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11015 states to 11015 states and 36159 transitions. [2019-01-13 05:40:46,693 INFO L78 Accepts]: Start accepts. Automaton has 11015 states and 36159 transitions. Word has length 70 [2019-01-13 05:40:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:46,693 INFO L480 AbstractCegarLoop]: Abstraction has 11015 states and 36159 transitions. [2019-01-13 05:40:46,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:40:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 11015 states and 36159 transitions. [2019-01-13 05:40:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:40:46,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:46,712 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] [2019-01-13 05:40:46,712 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:46,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:46,713 INFO L82 PathProgramCache]: Analyzing trace with hash 577239524, now seen corresponding path program 1 times [2019-01-13 05:40:46,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:46,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:46,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:46,934 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 05:40:46,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:46,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:40:46,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:40:46,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:40:46,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:40:46,936 INFO L87 Difference]: Start difference. First operand 11015 states and 36159 transitions. Second operand 4 states. [2019-01-13 05:40:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:47,461 INFO L93 Difference]: Finished difference Result 16578 states and 54793 transitions. [2019-01-13 05:40:47,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:40:47,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-13 05:40:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:47,489 INFO L225 Difference]: With dead ends: 16578 [2019-01-13 05:40:47,489 INFO L226 Difference]: Without dead ends: 16578 [2019-01-13 05:40:47,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:40:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16578 states. [2019-01-13 05:40:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16578 to 11143. [2019-01-13 05:40:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11143 states. [2019-01-13 05:40:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11143 states to 11143 states and 36575 transitions. [2019-01-13 05:40:47,669 INFO L78 Accepts]: Start accepts. Automaton has 11143 states and 36575 transitions. Word has length 89 [2019-01-13 05:40:47,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:47,670 INFO L480 AbstractCegarLoop]: Abstraction has 11143 states and 36575 transitions. [2019-01-13 05:40:47,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:40:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 11143 states and 36575 transitions. [2019-01-13 05:40:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:40:47,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:47,688 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] [2019-01-13 05:40:47,688 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:47,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:47,688 INFO L82 PathProgramCache]: Analyzing trace with hash 870642531, now seen corresponding path program 1 times [2019-01-13 05:40:47,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:47,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:47,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:47,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:47,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:40:47,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:47,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:40:47,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:40:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:40:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:40:47,887 INFO L87 Difference]: Start difference. First operand 11143 states and 36575 transitions. Second operand 5 states. [2019-01-13 05:40:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:48,611 INFO L93 Difference]: Finished difference Result 17252 states and 55296 transitions. [2019-01-13 05:40:48,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:40:48,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-13 05:40:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:48,638 INFO L225 Difference]: With dead ends: 17252 [2019-01-13 05:40:48,638 INFO L226 Difference]: Without dead ends: 17252 [2019-01-13 05:40:48,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:40:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17252 states. [2019-01-13 05:40:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17252 to 14130. [2019-01-13 05:40:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14130 states. [2019-01-13 05:40:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14130 states to 14130 states and 45599 transitions. [2019-01-13 05:40:48,858 INFO L78 Accepts]: Start accepts. Automaton has 14130 states and 45599 transitions. Word has length 89 [2019-01-13 05:40:48,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:48,859 INFO L480 AbstractCegarLoop]: Abstraction has 14130 states and 45599 transitions. [2019-01-13 05:40:48,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:40:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 14130 states and 45599 transitions. [2019-01-13 05:40:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:40:48,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:48,878 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] [2019-01-13 05:40:48,878 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:48,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1718399175, now seen corresponding path program 2 times [2019-01-13 05:40:48,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:48,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:48,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:48,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:48,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:49,013 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 05:40:49,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:49,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:40:49,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:40:49,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:40:49,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:40:49,015 INFO L87 Difference]: Start difference. First operand 14130 states and 45599 transitions. Second operand 3 states. [2019-01-13 05:40:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:49,398 INFO L93 Difference]: Finished difference Result 15240 states and 49052 transitions. [2019-01-13 05:40:49,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:40:49,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-13 05:40:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:49,424 INFO L225 Difference]: With dead ends: 15240 [2019-01-13 05:40:49,424 INFO L226 Difference]: Without dead ends: 15240 [2019-01-13 05:40:49,425 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 05:40:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15240 states. [2019-01-13 05:40:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 14740. [2019-01-13 05:40:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14740 states. [2019-01-13 05:40:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14740 states to 14740 states and 47507 transitions. [2019-01-13 05:40:49,654 INFO L78 Accepts]: Start accepts. Automaton has 14740 states and 47507 transitions. Word has length 89 [2019-01-13 05:40:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:49,654 INFO L480 AbstractCegarLoop]: Abstraction has 14740 states and 47507 transitions. [2019-01-13 05:40:49,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:40:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 14740 states and 47507 transitions. [2019-01-13 05:40:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:40:49,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:49,673 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] [2019-01-13 05:40:49,673 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash -795426203, now seen corresponding path program 3 times [2019-01-13 05:40:49,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:49,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:49,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:49,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:40:49,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:49,805 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 05:40:49,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:49,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:40:49,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:40:49,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:40:49,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:40:49,806 INFO L87 Difference]: Start difference. First operand 14740 states and 47507 transitions. Second operand 4 states. [2019-01-13 05:40:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:50,003 INFO L93 Difference]: Finished difference Result 15572 states and 50275 transitions. [2019-01-13 05:40:50,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:40:50,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-13 05:40:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:50,029 INFO L225 Difference]: With dead ends: 15572 [2019-01-13 05:40:50,029 INFO L226 Difference]: Without dead ends: 15572 [2019-01-13 05:40:50,029 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 05:40:50,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15572 states. [2019-01-13 05:40:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15572 to 14996. [2019-01-13 05:40:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14996 states. [2019-01-13 05:40:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14996 states to 14996 states and 48403 transitions. [2019-01-13 05:40:50,235 INFO L78 Accepts]: Start accepts. Automaton has 14996 states and 48403 transitions. Word has length 89 [2019-01-13 05:40:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:50,235 INFO L480 AbstractCegarLoop]: Abstraction has 14996 states and 48403 transitions. [2019-01-13 05:40:50,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:40:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 14996 states and 48403 transitions. [2019-01-13 05:40:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:40:50,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:50,255 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] [2019-01-13 05:40:50,256 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:50,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1692086630, now seen corresponding path program 1 times [2019-01-13 05:40:50,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:50,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:50,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:50,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:40:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:50,555 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 05:40:50,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:50,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:40:50,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:40:50,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:40:50,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:40:50,557 INFO L87 Difference]: Start difference. First operand 14996 states and 48403 transitions. Second operand 6 states. [2019-01-13 05:40:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:51,287 INFO L93 Difference]: Finished difference Result 21841 states and 70084 transitions. [2019-01-13 05:40:51,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:40:51,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-13 05:40:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:51,321 INFO L225 Difference]: With dead ends: 21841 [2019-01-13 05:40:51,321 INFO L226 Difference]: Without dead ends: 21713 [2019-01-13 05:40:51,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:40:51,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21713 states. [2019-01-13 05:40:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21713 to 18566. [2019-01-13 05:40:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18566 states. [2019-01-13 05:40:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18566 states to 18566 states and 59850 transitions. [2019-01-13 05:40:51,609 INFO L78 Accepts]: Start accepts. Automaton has 18566 states and 59850 transitions. Word has length 89 [2019-01-13 05:40:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:51,610 INFO L480 AbstractCegarLoop]: Abstraction has 18566 states and 59850 transitions. [2019-01-13 05:40:51,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:40:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 18566 states and 59850 transitions. [2019-01-13 05:40:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:40:51,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:51,640 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] [2019-01-13 05:40:51,640 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:51,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:51,641 INFO L82 PathProgramCache]: Analyzing trace with hash -104864729, now seen corresponding path program 1 times [2019-01-13 05:40:51,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:51,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:51,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:51,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:51,883 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 05:40:51,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:51,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:40:51,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:40:51,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:40:51,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:40:51,885 INFO L87 Difference]: Start difference. First operand 18566 states and 59850 transitions. Second operand 7 states. [2019-01-13 05:40:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:52,804 INFO L93 Difference]: Finished difference Result 36185 states and 117319 transitions. [2019-01-13 05:40:52,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 05:40:52,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-01-13 05:40:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:52,874 INFO L225 Difference]: With dead ends: 36185 [2019-01-13 05:40:52,874 INFO L226 Difference]: Without dead ends: 36185 [2019-01-13 05:40:52,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:40:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36185 states. [2019-01-13 05:40:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36185 to 22484. [2019-01-13 05:40:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22484 states. [2019-01-13 05:40:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22484 states to 22484 states and 72983 transitions. [2019-01-13 05:40:53,275 INFO L78 Accepts]: Start accepts. Automaton has 22484 states and 72983 transitions. Word has length 89 [2019-01-13 05:40:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:53,275 INFO L480 AbstractCegarLoop]: Abstraction has 22484 states and 72983 transitions. [2019-01-13 05:40:53,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:40:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 22484 states and 72983 transitions. [2019-01-13 05:40:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:40:53,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:53,301 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] [2019-01-13 05:40:53,301 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:53,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash 782638952, now seen corresponding path program 1 times [2019-01-13 05:40:53,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:53,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:53,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:53,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:53,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:53,756 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-13 05:40:54,047 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-13 05:40:54,056 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 05:40:54,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:54,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:40:54,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:40:54,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:40:54,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:40:54,057 INFO L87 Difference]: Start difference. First operand 22484 states and 72983 transitions. Second operand 6 states. [2019-01-13 05:40:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:54,652 INFO L93 Difference]: Finished difference Result 23682 states and 76064 transitions. [2019-01-13 05:40:54,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:40:54,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-13 05:40:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:54,689 INFO L225 Difference]: With dead ends: 23682 [2019-01-13 05:40:54,689 INFO L226 Difference]: Without dead ends: 23682 [2019-01-13 05:40:54,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:40:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23682 states. [2019-01-13 05:40:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23682 to 19210. [2019-01-13 05:40:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19210 states. [2019-01-13 05:40:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19210 states to 19210 states and 61462 transitions. [2019-01-13 05:40:54,968 INFO L78 Accepts]: Start accepts. Automaton has 19210 states and 61462 transitions. Word has length 89 [2019-01-13 05:40:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:54,968 INFO L480 AbstractCegarLoop]: Abstraction has 19210 states and 61462 transitions. [2019-01-13 05:40:54,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:40:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 19210 states and 61462 transitions. [2019-01-13 05:40:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:40:54,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:54,990 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] [2019-01-13 05:40:54,990 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:54,991 INFO L82 PathProgramCache]: Analyzing trace with hash -412334768, now seen corresponding path program 1 times [2019-01-13 05:40:54,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:54,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:54,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:54,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:55,215 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 05:40:55,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:55,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:40:55,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:40:55,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:40:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:40:55,217 INFO L87 Difference]: Start difference. First operand 19210 states and 61462 transitions. Second operand 6 states. [2019-01-13 05:40:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:55,944 INFO L93 Difference]: Finished difference Result 22660 states and 71632 transitions. [2019-01-13 05:40:55,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:40:55,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-13 05:40:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:55,979 INFO L225 Difference]: With dead ends: 22660 [2019-01-13 05:40:55,979 INFO L226 Difference]: Without dead ends: 22140 [2019-01-13 05:40:55,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 05:40:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22140 states. [2019-01-13 05:40:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22140 to 20895. [2019-01-13 05:40:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20895 states. [2019-01-13 05:40:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20895 states to 20895 states and 66615 transitions. [2019-01-13 05:40:56,396 INFO L78 Accepts]: Start accepts. Automaton has 20895 states and 66615 transitions. Word has length 89 [2019-01-13 05:40:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:56,396 INFO L480 AbstractCegarLoop]: Abstraction has 20895 states and 66615 transitions. [2019-01-13 05:40:56,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:40:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 20895 states and 66615 transitions. [2019-01-13 05:40:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:40:56,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:56,420 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] [2019-01-13 05:40:56,420 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:56,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1928533223, now seen corresponding path program 1 times [2019-01-13 05:40:56,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:56,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:56,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:57,318 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-13 05:40:57,325 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 05:40:57,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:57,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:40:57,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:40:57,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:40:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:40:57,328 INFO L87 Difference]: Start difference. First operand 20895 states and 66615 transitions. Second operand 7 states. [2019-01-13 05:40:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:58,471 INFO L93 Difference]: Finished difference Result 23643 states and 75314 transitions. [2019-01-13 05:40:58,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:40:58,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-01-13 05:40:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:58,509 INFO L225 Difference]: With dead ends: 23643 [2019-01-13 05:40:58,509 INFO L226 Difference]: Without dead ends: 23643 [2019-01-13 05:40:58,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:40:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23643 states. [2019-01-13 05:40:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23643 to 21045. [2019-01-13 05:40:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21045 states. [2019-01-13 05:40:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21045 states to 21045 states and 67255 transitions. [2019-01-13 05:40:58,800 INFO L78 Accepts]: Start accepts. Automaton has 21045 states and 67255 transitions. Word has length 89 [2019-01-13 05:40:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:58,800 INFO L480 AbstractCegarLoop]: Abstraction has 21045 states and 67255 transitions. [2019-01-13 05:40:58,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:40:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 21045 states and 67255 transitions. [2019-01-13 05:40:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:40:58,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:58,823 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] [2019-01-13 05:40:58,824 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:58,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:58,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1872528687, now seen corresponding path program 1 times [2019-01-13 05:40:58,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:58,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:58,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:58,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:58,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:40:59,002 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 05:40:59,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:40:59,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:40:59,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:40:59,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:40:59,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:40:59,003 INFO L87 Difference]: Start difference. First operand 21045 states and 67255 transitions. Second operand 6 states. [2019-01-13 05:40:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:40:59,372 INFO L93 Difference]: Finished difference Result 23210 states and 72517 transitions. [2019-01-13 05:40:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:40:59,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-13 05:40:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:40:59,406 INFO L225 Difference]: With dead ends: 23210 [2019-01-13 05:40:59,407 INFO L226 Difference]: Without dead ends: 23210 [2019-01-13 05:40:59,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:40:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23210 states. [2019-01-13 05:40:59,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23210 to 21470. [2019-01-13 05:40:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21470 states. [2019-01-13 05:40:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 67415 transitions. [2019-01-13 05:40:59,695 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 67415 transitions. Word has length 89 [2019-01-13 05:40:59,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:40:59,695 INFO L480 AbstractCegarLoop]: Abstraction has 21470 states and 67415 transitions. [2019-01-13 05:40:59,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:40:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 67415 transitions. [2019-01-13 05:40:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:40:59,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:40:59,719 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] [2019-01-13 05:40:59,719 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:40:59,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:40:59,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1617792142, now seen corresponding path program 1 times [2019-01-13 05:40:59,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:40:59,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:40:59,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:59,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:40:59,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:40:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:41:00,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 05:41:00,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:41:00,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:41:00,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:41:00,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:41:00,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:41:00,118 INFO L87 Difference]: Start difference. First operand 21470 states and 67415 transitions. Second operand 6 states. [2019-01-13 05:41:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:41:00,311 INFO L93 Difference]: Finished difference Result 19998 states and 61607 transitions. [2019-01-13 05:41:00,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:41:00,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-13 05:41:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:41:00,341 INFO L225 Difference]: With dead ends: 19998 [2019-01-13 05:41:00,341 INFO L226 Difference]: Without dead ends: 19998 [2019-01-13 05:41:00,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:41:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19998 states. [2019-01-13 05:41:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19998 to 12659. [2019-01-13 05:41:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12659 states. [2019-01-13 05:41:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 38917 transitions. [2019-01-13 05:41:00,563 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 38917 transitions. Word has length 89 [2019-01-13 05:41:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:41:00,563 INFO L480 AbstractCegarLoop]: Abstraction has 12659 states and 38917 transitions. [2019-01-13 05:41:00,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:41:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 38917 transitions. [2019-01-13 05:41:00,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:41:00,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:41:00,578 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 05:41:00,579 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:41:00,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:41:00,579 INFO L82 PathProgramCache]: Analyzing trace with hash 368979928, now seen corresponding path program 1 times [2019-01-13 05:41:00,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:41:00,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:41:00,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:00,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:41:00,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:41:00,851 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 05:41:00,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:41:00,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:41:00,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:41:00,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:41:00,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:41:00,852 INFO L87 Difference]: Start difference. First operand 12659 states and 38917 transitions. Second operand 6 states. [2019-01-13 05:41:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:41:01,184 INFO L93 Difference]: Finished difference Result 14589 states and 44526 transitions. [2019-01-13 05:41:01,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:41:01,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:41:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:41:01,205 INFO L225 Difference]: With dead ends: 14589 [2019-01-13 05:41:01,205 INFO L226 Difference]: Without dead ends: 14299 [2019-01-13 05:41:01,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:41:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14299 states. [2019-01-13 05:41:01,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14299 to 11174. [2019-01-13 05:41:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11174 states. [2019-01-13 05:41:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11174 states to 11174 states and 34049 transitions. [2019-01-13 05:41:01,368 INFO L78 Accepts]: Start accepts. Automaton has 11174 states and 34049 transitions. Word has length 91 [2019-01-13 05:41:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:41:01,368 INFO L480 AbstractCegarLoop]: Abstraction has 11174 states and 34049 transitions. [2019-01-13 05:41:01,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:41:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11174 states and 34049 transitions. [2019-01-13 05:41:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:41:01,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:41:01,381 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 05:41:01,382 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:41:01,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:41:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1708229415, now seen corresponding path program 1 times [2019-01-13 05:41:01,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:41:01,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:41:01,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:01,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:41:01,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:41:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:41:01,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:41:01,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 05:41:01,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 05:41:01,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 05:41:01,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:41:01,773 INFO L87 Difference]: Start difference. First operand 11174 states and 34049 transitions. Second operand 9 states. [2019-01-13 05:41:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:41:02,170 INFO L93 Difference]: Finished difference Result 13011 states and 39626 transitions. [2019-01-13 05:41:02,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:41:02,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-01-13 05:41:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:41:02,191 INFO L225 Difference]: With dead ends: 13011 [2019-01-13 05:41:02,191 INFO L226 Difference]: Without dead ends: 13011 [2019-01-13 05:41:02,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-01-13 05:41:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13011 states. [2019-01-13 05:41:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13011 to 12772. [2019-01-13 05:41:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12772 states. [2019-01-13 05:41:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 38928 transitions. [2019-01-13 05:41:02,356 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 38928 transitions. Word has length 91 [2019-01-13 05:41:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:41:02,356 INFO L480 AbstractCegarLoop]: Abstraction has 12772 states and 38928 transitions. [2019-01-13 05:41:02,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 05:41:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 38928 transitions. [2019-01-13 05:41:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:41:02,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:41:02,371 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 05:41:02,371 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:41:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:41:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash -820725734, now seen corresponding path program 1 times [2019-01-13 05:41:02,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:41:02,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:41:02,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:02,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:41:02,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:41:02,677 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 05:41:02,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:41:02,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:41:02,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:41:02,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:41:02,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:41:02,678 INFO L87 Difference]: Start difference. First operand 12772 states and 38928 transitions. Second operand 8 states. [2019-01-13 05:41:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:41:03,379 INFO L93 Difference]: Finished difference Result 22526 states and 68652 transitions. [2019-01-13 05:41:03,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:41:03,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2019-01-13 05:41:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:41:03,398 INFO L225 Difference]: With dead ends: 22526 [2019-01-13 05:41:03,398 INFO L226 Difference]: Without dead ends: 11514 [2019-01-13 05:41:03,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-13 05:41:03,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2019-01-13 05:41:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 10920. [2019-01-13 05:41:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2019-01-13 05:41:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 33112 transitions. [2019-01-13 05:41:03,544 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 33112 transitions. Word has length 91 [2019-01-13 05:41:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:41:03,544 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 33112 transitions. [2019-01-13 05:41:03,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:41:03,544 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 33112 transitions. [2019-01-13 05:41:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:41:03,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:41:03,557 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 05:41:03,557 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:41:03,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:41:03,558 INFO L82 PathProgramCache]: Analyzing trace with hash -148260104, now seen corresponding path program 2 times [2019-01-13 05:41:03,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:41:03,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:41:03,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:03,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:41:03,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:41:03,775 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 05:41:03,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:41:03,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 05:41:03,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 05:41:03,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 05:41:03,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 05:41:03,776 INFO L87 Difference]: Start difference. First operand 10920 states and 33112 transitions. Second operand 10 states. [2019-01-13 05:41:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:41:04,644 INFO L93 Difference]: Finished difference Result 18376 states and 55985 transitions. [2019-01-13 05:41:04,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 05:41:04,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-01-13 05:41:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:41:04,655 INFO L225 Difference]: With dead ends: 18376 [2019-01-13 05:41:04,655 INFO L226 Difference]: Without dead ends: 6510 [2019-01-13 05:41:04,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-01-13 05:41:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-01-13 05:41:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6510. [2019-01-13 05:41:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6510 states. [2019-01-13 05:41:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 19834 transitions. [2019-01-13 05:41:04,737 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 19834 transitions. Word has length 91 [2019-01-13 05:41:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:41:04,737 INFO L480 AbstractCegarLoop]: Abstraction has 6510 states and 19834 transitions. [2019-01-13 05:41:04,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 05:41:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 19834 transitions. [2019-01-13 05:41:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:41:04,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:41:04,745 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 05:41:04,746 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:41:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:41:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1433608860, now seen corresponding path program 1 times [2019-01-13 05:41:04,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:41:04,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:41:04,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:04,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:41:04,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:41:04,909 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 05:41:04,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:41:04,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:41:04,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:41:04,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:41:04,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:41:04,911 INFO L87 Difference]: Start difference. First operand 6510 states and 19834 transitions. Second operand 7 states. [2019-01-13 05:41:05,379 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-13 05:41:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:41:05,741 INFO L93 Difference]: Finished difference Result 7878 states and 24020 transitions. [2019-01-13 05:41:05,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:41:05,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-13 05:41:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:41:05,764 INFO L225 Difference]: With dead ends: 7878 [2019-01-13 05:41:05,764 INFO L226 Difference]: Without dead ends: 7878 [2019-01-13 05:41:05,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:41:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2019-01-13 05:41:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 7814. [2019-01-13 05:41:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7814 states. [2019-01-13 05:41:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 23812 transitions. [2019-01-13 05:41:05,970 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 23812 transitions. Word has length 91 [2019-01-13 05:41:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:41:05,971 INFO L480 AbstractCegarLoop]: Abstraction has 7814 states and 23812 transitions. [2019-01-13 05:41:05,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:41:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 23812 transitions. [2019-01-13 05:41:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:41:05,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:41:05,990 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 05:41:05,990 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:41:05,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:41:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash -546105179, now seen corresponding path program 1 times [2019-01-13 05:41:05,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:41:05,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:41:05,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:05,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:41:05,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:41:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:41:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:41:06,107 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 05:41:06,372 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:41:06,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:41:06 BasicIcfg [2019-01-13 05:41:06,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:41:06,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:41:06,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:41:06,378 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:41:06,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:39:41" (3/4) ... [2019-01-13 05:41:06,386 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 05:41:06,714 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:41:06,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:41:06,718 INFO L168 Benchmark]: Toolchain (without parser) took 87005.36 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 943.3 MB in the beginning and 1.4 GB in the end (delta: -504.8 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-01-13 05:41:06,719 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:41:06,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 912.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-13 05:41:06,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.51 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 05:41:06,722 INFO L168 Benchmark]: Boogie Preprocessor took 40.65 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 05:41:06,722 INFO L168 Benchmark]: RCFGBuilder took 1147.43 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: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2019-01-13 05:41:06,722 INFO L168 Benchmark]: TraceAbstraction took 84496.75 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -383.9 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-01-13 05:41:06,723 INFO L168 Benchmark]: Witness Printer took 339.34 ms. Allocated memory is still 5.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-13 05:41:06,729 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 912.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.51 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.65 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.43 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: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 84496.75 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -383.9 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 339.34 ms. Allocated memory is still 5.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L678] -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] [L680] -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] [L682] -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] [L683] -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] [L684] -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] [L685] -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] [L686] -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] [L687] -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] [L688] -1 _Bool y$r_buff0_thd3; 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_buff0_thd3=0] [L689] -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_buff0_thd3=0, y$r_buff1_thd0=0] [L690] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$r_buff1_thd3; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L693] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L694] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t2588; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t2588, ((void *)0), P0, ((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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t2589; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t2589, ((void *)0), P1, ((void *)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=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] -1 pthread_t t2590; 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=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] FCALL, FORK -1 pthread_create(&t2590, ((void *)0), P2, ((void *)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=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 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=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 z = 2 [L711] 1 __unbuffered_p0_EAX = x [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] 2 x = 1 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L732] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L732] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L733] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L733] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L734] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L734] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L735] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L735] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L736] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 2 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L737] 2 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)) [L738] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L738] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L769] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L772] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L772] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L775] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -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) [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L803] -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 [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] -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 [L808] -1 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 217 locations, 3 error locations. UNSAFE Result, 84.2s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 23.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6063 SDtfs, 8022 SDslu, 13803 SDs, 0 SdLazy, 5109 SolverSat, 296 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 63 SyntacticMatches, 15 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149043occurred 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: 24.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 150248 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2033 NumberOfCodeBlocks, 2033 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1917 ConstructedInterpolants, 0 QuantifiedInterpolants, 409897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...