./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe034_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_power.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 db4a16c4986c75df8f6a17811333c8e3362ce3a1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-2e94e6a [2019-01-01 00:45:03,724 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:45:03,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:45:03,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:45:03,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:45:03,746 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:45:03,751 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:45:03,754 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:45:03,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:45:03,758 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:45:03,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:45:03,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:45:03,761 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:45:03,763 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:45:03,766 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:45:03,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:45:03,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:45:03,778 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:45:03,780 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:45:03,785 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:45:03,786 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:45:03,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:45:03,795 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:45:03,795 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:45:03,795 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:45:03,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:45:03,800 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:45:03,801 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:45:03,801 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:45:03,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:45:03,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:45:03,806 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:45:03,806 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:45:03,807 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:45:03,808 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:45:03,810 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:45:03,811 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:45:03,829 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:45:03,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:45:03,831 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:45:03,831 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:45:03,831 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:45:03,831 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:45:03,832 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:45:03,832 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:45:03,832 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:45:03,832 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:45:03,832 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:45:03,832 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:45:03,834 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:45:03,834 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:45:03,834 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:45:03,834 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:45:03,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:45:03,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:45:03,835 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:45:03,835 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:45:03,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:45:03,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:45:03,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:45:03,837 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:45:03,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:45:03,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:45:03,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:45:03,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:45:03,838 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 -> db4a16c4986c75df8f6a17811333c8e3362ce3a1 [2019-01-01 00:45:03,905 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:45:03,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:45:03,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:45:03,934 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:45:03,934 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:45:03,935 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe034_power.opt_false-unreach-call.i [2019-01-01 00:45:03,995 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd1aa79b/f0210e3e54d74d16857a7263b738d625/FLAGc123fc3df [2019-01-01 00:45:04,515 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:45:04,516 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe034_power.opt_false-unreach-call.i [2019-01-01 00:45:04,539 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd1aa79b/f0210e3e54d74d16857a7263b738d625/FLAGc123fc3df [2019-01-01 00:45:04,789 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd1aa79b/f0210e3e54d74d16857a7263b738d625 [2019-01-01 00:45:04,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:45:04,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:45:04,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:45:04,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:45:04,799 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:45:04,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:45:04" (1/1) ... [2019-01-01 00:45:04,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b20f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:04, skipping insertion in model container [2019-01-01 00:45:04,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:45:04" (1/1) ... [2019-01-01 00:45:04,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:45:04,874 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:45:05,382 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:45:05,405 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:45:05,570 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:45:05,695 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:45:05,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05 WrapperNode [2019-01-01 00:45:05,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:45:05,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:45:05,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:45:05,699 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:45:05,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05" (1/1) ... [2019-01-01 00:45:05,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05" (1/1) ... [2019-01-01 00:45:05,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:45:05,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:45:05,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:45:05,817 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:45:05,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05" (1/1) ... [2019-01-01 00:45:05,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05" (1/1) ... [2019-01-01 00:45:05,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05" (1/1) ... [2019-01-01 00:45:05,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05" (1/1) ... [2019-01-01 00:45:05,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05" (1/1) ... [2019-01-01 00:45:05,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05" (1/1) ... [2019-01-01 00:45:05,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05" (1/1) ... [2019-01-01 00:45:05,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:45:05,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:45:05,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:45:05,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:45:05,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05" (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-01 00:45:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:45:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:45:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:45:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:45:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:45:05,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:45:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:45:05,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:45:05,985 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-01 00:45:05,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-01 00:45:05,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:45:05,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:45:05,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:45:05,987 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:45:07,098 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:45:07,099 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 00:45:07,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:45:07 BoogieIcfgContainer [2019-01-01 00:45:07,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:45:07,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:45:07,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:45:07,107 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:45:07,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:45:04" (1/3) ... [2019-01-01 00:45:07,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532aee29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:45:07, skipping insertion in model container [2019-01-01 00:45:07,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:05" (2/3) ... [2019-01-01 00:45:07,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532aee29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:45:07, skipping insertion in model container [2019-01-01 00:45:07,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:45:07" (3/3) ... [2019-01-01 00:45:07,116 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.opt_false-unreach-call.i [2019-01-01 00:45:07,171 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,172 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,172 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,177 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,177 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,178 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,179 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,180 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,190 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,203 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,203 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,203 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,203 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,204 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,204 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,204 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,204 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,207 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,207 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,207 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,207 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,208 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,208 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,208 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,208 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,209 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,209 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,209 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,209 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,209 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,210 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,210 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,210 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,210 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,211 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,211 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,211 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,211 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,211 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,215 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,215 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,215 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,216 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,216 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,216 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,216 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,216 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:07,252 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:45:07,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:45:07,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-01 00:45:07,280 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-01 00:45:07,310 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:45:07,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:45:07,311 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:45:07,311 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:45:07,311 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:45:07,311 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:45:07,311 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:45:07,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:45:07,312 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:45:07,326 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 175 transitions [2019-01-01 00:45:39,438 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149043 states. [2019-01-01 00:45:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 149043 states. [2019-01-01 00:45:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 00:45:39,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:45:39,459 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-01 00:45:39,462 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:45:39,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:45:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1284724798, now seen corresponding path program 1 times [2019-01-01 00:45:39,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:45:39,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:45:39,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:45:39,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:45:39,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:45:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:45:39,935 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-01 00:45:39,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:45:39,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:45:39,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:45:39,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:45:39,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:45:39,964 INFO L87 Difference]: Start difference. First operand 149043 states. Second operand 4 states. [2019-01-01 00:45:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:45:42,351 INFO L93 Difference]: Finished difference Result 257063 states and 1188602 transitions. [2019-01-01 00:45:42,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:45:42,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-01 00:45:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:45:50,771 INFO L225 Difference]: With dead ends: 257063 [2019-01-01 00:45:50,771 INFO L226 Difference]: Without dead ends: 174813 [2019-01-01 00:45:50,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:45:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174813 states. [2019-01-01 00:45:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174813 to 110553. [2019-01-01 00:45:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2019-01-01 00:45:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511484 transitions. [2019-01-01 00:45:57,999 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511484 transitions. Word has length 44 [2019-01-01 00:45:58,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:45:58,002 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511484 transitions. [2019-01-01 00:45:58,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:45:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511484 transitions. [2019-01-01 00:45:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 00:45:58,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:45:58,038 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-01 00:45:58,039 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:45:58,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:45:58,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1885719038, now seen corresponding path program 1 times [2019-01-01 00:45:58,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:45:58,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:45:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:45:58,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:45:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:45:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:45:58,214 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-01 00:45:58,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:45:58,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:45:58,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:45:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:45:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:45:58,218 INFO L87 Difference]: Start difference. First operand 110553 states and 511484 transitions. Second operand 3 states. [2019-01-01 00:45:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:45:59,561 INFO L93 Difference]: Finished difference Result 110553 states and 511379 transitions. [2019-01-01 00:45:59,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:45:59,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-01 00:45:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:00,056 INFO L225 Difference]: With dead ends: 110553 [2019-01-01 00:46:00,056 INFO L226 Difference]: Without dead ends: 110553 [2019-01-01 00:46:00,057 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-01 00:46:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110553 states. [2019-01-01 00:46:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110553 to 110553. [2019-01-01 00:46:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2019-01-01 00:46:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511379 transitions. [2019-01-01 00:46:05,355 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511379 transitions. Word has length 52 [2019-01-01 00:46:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:05,356 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511379 transitions. [2019-01-01 00:46:05,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:46:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511379 transitions. [2019-01-01 00:46:05,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 00:46:05,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:05,373 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-01 00:46:05,374 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:05,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:05,374 INFO L82 PathProgramCache]: Analyzing trace with hash -142908703, now seen corresponding path program 1 times [2019-01-01 00:46:05,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:05,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:05,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:05,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:05,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:05,518 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-01 00:46:05,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:05,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:46:05,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:46:05,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:46:05,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:46:05,519 INFO L87 Difference]: Start difference. First operand 110553 states and 511379 transitions. Second operand 4 states. [2019-01-01 00:46:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:06,294 INFO L93 Difference]: Finished difference Result 99451 states and 448604 transitions. [2019-01-01 00:46:06,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:46:06,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-01-01 00:46:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:06,822 INFO L225 Difference]: With dead ends: 99451 [2019-01-01 00:46:06,823 INFO L226 Difference]: Without dead ends: 95221 [2019-01-01 00:46:06,823 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-01 00:46:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95221 states. [2019-01-01 00:46:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95221 to 95221. [2019-01-01 00:46:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95221 states. [2019-01-01 00:46:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95221 states to 95221 states and 432988 transitions. [2019-01-01 00:46:09,915 INFO L78 Accepts]: Start accepts. Automaton has 95221 states and 432988 transitions. Word has length 52 [2019-01-01 00:46:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:09,916 INFO L480 AbstractCegarLoop]: Abstraction has 95221 states and 432988 transitions. [2019-01-01 00:46:09,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:46:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 95221 states and 432988 transitions. [2019-01-01 00:46:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-01 00:46:09,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:09,929 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-01 00:46:09,929 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash -805360345, now seen corresponding path program 1 times [2019-01-01 00:46:09,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:09,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:09,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:09,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:09,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:10,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-01 00:46:10,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:10,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:46:10,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:46:10,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:46:10,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:46:10,217 INFO L87 Difference]: Start difference. First operand 95221 states and 432988 transitions. Second operand 5 states. [2019-01-01 00:46:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:10,610 INFO L93 Difference]: Finished difference Result 30965 states and 124168 transitions. [2019-01-01 00:46:10,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:46:10,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-01-01 00:46:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:10,714 INFO L225 Difference]: With dead ends: 30965 [2019-01-01 00:46:10,714 INFO L226 Difference]: Without dead ends: 27337 [2019-01-01 00:46:10,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27337 states. [2019-01-01 00:46:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27337 to 26877. [2019-01-01 00:46:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26877 states. [2019-01-01 00:46:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26877 states to 26877 states and 107650 transitions. [2019-01-01 00:46:12,418 INFO L78 Accepts]: Start accepts. Automaton has 26877 states and 107650 transitions. Word has length 53 [2019-01-01 00:46:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:12,418 INFO L480 AbstractCegarLoop]: Abstraction has 26877 states and 107650 transitions. [2019-01-01 00:46:12,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:46:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 26877 states and 107650 transitions. [2019-01-01 00:46:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-01 00:46:12,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:12,423 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-01 00:46:12,423 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:12,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1570820033, now seen corresponding path program 1 times [2019-01-01 00:46:12,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:12,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:12,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:12,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:12,589 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-01 00:46:12,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:12,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:12,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:12,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:12,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:12,591 INFO L87 Difference]: Start difference. First operand 26877 states and 107650 transitions. Second operand 6 states. [2019-01-01 00:46:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:13,416 INFO L93 Difference]: Finished difference Result 37429 states and 146187 transitions. [2019-01-01 00:46:13,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:46:13,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-01 00:46:13,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:13,528 INFO L225 Difference]: With dead ends: 37429 [2019-01-01 00:46:13,528 INFO L226 Difference]: Without dead ends: 37054 [2019-01-01 00:46:13,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:46:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37054 states. [2019-01-01 00:46:14,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37054 to 35270. [2019-01-01 00:46:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35270 states. [2019-01-01 00:46:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35270 states to 35270 states and 138745 transitions. [2019-01-01 00:46:14,407 INFO L78 Accepts]: Start accepts. Automaton has 35270 states and 138745 transitions. Word has length 53 [2019-01-01 00:46:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:14,407 INFO L480 AbstractCegarLoop]: Abstraction has 35270 states and 138745 transitions. [2019-01-01 00:46:14,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 35270 states and 138745 transitions. [2019-01-01 00:46:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 00:46:14,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:14,413 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-01 00:46:14,414 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2068992963, now seen corresponding path program 1 times [2019-01-01 00:46:14,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:14,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:14,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:14,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:14,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:14,499 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-01 00:46:14,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:14,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:46:14,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:46:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:46:14,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:46:14,500 INFO L87 Difference]: Start difference. First operand 35270 states and 138745 transitions. Second operand 3 states. [2019-01-01 00:46:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:14,907 INFO L93 Difference]: Finished difference Result 46810 states and 182037 transitions. [2019-01-01 00:46:14,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:46:14,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-01-01 00:46:14,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:15,034 INFO L225 Difference]: With dead ends: 46810 [2019-01-01 00:46:15,034 INFO L226 Difference]: Without dead ends: 46790 [2019-01-01 00:46:15,035 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-01 00:46:15,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46790 states. [2019-01-01 00:46:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46790 to 36252. [2019-01-01 00:46:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36252 states. [2019-01-01 00:46:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36252 states to 36252 states and 141452 transitions. [2019-01-01 00:46:15,856 INFO L78 Accepts]: Start accepts. Automaton has 36252 states and 141452 transitions. Word has length 55 [2019-01-01 00:46:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:15,857 INFO L480 AbstractCegarLoop]: Abstraction has 36252 states and 141452 transitions. [2019-01-01 00:46:15,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:46:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 36252 states and 141452 transitions. [2019-01-01 00:46:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-01 00:46:15,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:15,864 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-01 00:46:15,864 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:15,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:15,865 INFO L82 PathProgramCache]: Analyzing trace with hash -43565154, now seen corresponding path program 1 times [2019-01-01 00:46:15,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:15,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:15,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:15,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:15,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:16,071 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-01 00:46:16,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:16,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:16,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:16,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:16,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:16,072 INFO L87 Difference]: Start difference. First operand 36252 states and 141452 transitions. Second operand 6 states. [2019-01-01 00:46:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:17,096 INFO L93 Difference]: Finished difference Result 50344 states and 193874 transitions. [2019-01-01 00:46:17,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:46:17,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-01-01 00:46:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:17,262 INFO L225 Difference]: With dead ends: 50344 [2019-01-01 00:46:17,262 INFO L226 Difference]: Without dead ends: 49859 [2019-01-01 00:46:17,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-01 00:46:17,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49859 states. [2019-01-01 00:46:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49859 to 39286. [2019-01-01 00:46:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39286 states. [2019-01-01 00:46:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39286 states to 39286 states and 153273 transitions. [2019-01-01 00:46:18,126 INFO L78 Accepts]: Start accepts. Automaton has 39286 states and 153273 transitions. Word has length 59 [2019-01-01 00:46:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:18,126 INFO L480 AbstractCegarLoop]: Abstraction has 39286 states and 153273 transitions. [2019-01-01 00:46:18,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 39286 states and 153273 transitions. [2019-01-01 00:46:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:46:18,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:18,152 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-01 00:46:18,152 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:18,152 INFO L82 PathProgramCache]: Analyzing trace with hash -41019099, now seen corresponding path program 1 times [2019-01-01 00:46:18,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:18,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:18,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:18,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:18,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:18,277 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-01 00:46:18,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:18,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:46:18,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:46:18,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:46:18,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:46:18,279 INFO L87 Difference]: Start difference. First operand 39286 states and 153273 transitions. Second operand 4 states. [2019-01-01 00:46:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:19,073 INFO L93 Difference]: Finished difference Result 46149 states and 179276 transitions. [2019-01-01 00:46:19,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:46:19,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-01-01 00:46:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:19,218 INFO L225 Difference]: With dead ends: 46149 [2019-01-01 00:46:19,218 INFO L226 Difference]: Without dead ends: 46149 [2019-01-01 00:46:19,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:46:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46149 states. [2019-01-01 00:46:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46149 to 42181. [2019-01-01 00:46:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42181 states. [2019-01-01 00:46:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42181 states to 42181 states and 164108 transitions. [2019-01-01 00:46:20,116 INFO L78 Accepts]: Start accepts. Automaton has 42181 states and 164108 transitions. Word has length 70 [2019-01-01 00:46:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:20,116 INFO L480 AbstractCegarLoop]: Abstraction has 42181 states and 164108 transitions. [2019-01-01 00:46:20,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:46:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 42181 states and 164108 transitions. [2019-01-01 00:46:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:46:20,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:20,148 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-01 00:46:20,149 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:20,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:20,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1701791236, now seen corresponding path program 1 times [2019-01-01 00:46:20,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:20,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:20,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:20,321 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-01 00:46:20,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:20,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:20,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:20,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:20,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:20,323 INFO L87 Difference]: Start difference. First operand 42181 states and 164108 transitions. Second operand 6 states. [2019-01-01 00:46:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:20,492 INFO L93 Difference]: Finished difference Result 13861 states and 46332 transitions. [2019-01-01 00:46:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:46:20,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-01-01 00:46:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:20,517 INFO L225 Difference]: With dead ends: 13861 [2019-01-01 00:46:20,517 INFO L226 Difference]: Without dead ends: 11605 [2019-01-01 00:46:20,518 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-01 00:46:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11605 states. [2019-01-01 00:46:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11605 to 11015. [2019-01-01 00:46:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11015 states. [2019-01-01 00:46:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11015 states to 11015 states and 36284 transitions. [2019-01-01 00:46:20,712 INFO L78 Accepts]: Start accepts. Automaton has 11015 states and 36284 transitions. Word has length 70 [2019-01-01 00:46:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:20,712 INFO L480 AbstractCegarLoop]: Abstraction has 11015 states and 36284 transitions. [2019-01-01 00:46:20,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 11015 states and 36284 transitions. [2019-01-01 00:46:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:20,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:20,735 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-01 00:46:20,735 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:20,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:20,736 INFO L82 PathProgramCache]: Analyzing trace with hash 577239524, now seen corresponding path program 1 times [2019-01-01 00:46:20,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:20,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:20,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:20,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:20,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:20,843 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-01 00:46:20,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:20,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:46:20,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:46:20,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:46:20,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:46:20,844 INFO L87 Difference]: Start difference. First operand 11015 states and 36284 transitions. Second operand 4 states. [2019-01-01 00:46:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:21,140 INFO L93 Difference]: Finished difference Result 16578 states and 54918 transitions. [2019-01-01 00:46:21,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:46:21,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-01 00:46:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:21,173 INFO L225 Difference]: With dead ends: 16578 [2019-01-01 00:46:21,173 INFO L226 Difference]: Without dead ends: 16578 [2019-01-01 00:46:21,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:46:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16578 states. [2019-01-01 00:46:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16578 to 11143. [2019-01-01 00:46:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11143 states. [2019-01-01 00:46:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11143 states to 11143 states and 36700 transitions. [2019-01-01 00:46:21,386 INFO L78 Accepts]: Start accepts. Automaton has 11143 states and 36700 transitions. Word has length 89 [2019-01-01 00:46:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:21,387 INFO L480 AbstractCegarLoop]: Abstraction has 11143 states and 36700 transitions. [2019-01-01 00:46:21,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:46:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 11143 states and 36700 transitions. [2019-01-01 00:46:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:21,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:21,409 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-01 00:46:21,409 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash 870642531, now seen corresponding path program 1 times [2019-01-01 00:46:21,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:21,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:21,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:21,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:21,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:21,600 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-01 00:46:21,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:21,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:46:21,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:46:21,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:46:21,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:46:21,602 INFO L87 Difference]: Start difference. First operand 11143 states and 36700 transitions. Second operand 5 states. [2019-01-01 00:46:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:22,142 INFO L93 Difference]: Finished difference Result 17352 states and 55701 transitions. [2019-01-01 00:46:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:46:22,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-01 00:46:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:22,174 INFO L225 Difference]: With dead ends: 17352 [2019-01-01 00:46:22,174 INFO L226 Difference]: Without dead ends: 17352 [2019-01-01 00:46:22,175 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-01 00:46:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17352 states. [2019-01-01 00:46:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17352 to 14130. [2019-01-01 00:46:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14130 states. [2019-01-01 00:46:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14130 states to 14130 states and 45724 transitions. [2019-01-01 00:46:22,420 INFO L78 Accepts]: Start accepts. Automaton has 14130 states and 45724 transitions. Word has length 89 [2019-01-01 00:46:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:22,420 INFO L480 AbstractCegarLoop]: Abstraction has 14130 states and 45724 transitions. [2019-01-01 00:46:22,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:46:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 14130 states and 45724 transitions. [2019-01-01 00:46:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:22,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:46:22,442 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:22,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash 480272677, now seen corresponding path program 2 times [2019-01-01 00:46:22,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:22,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:22,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:22,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:22,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:22,561 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-01 00:46:22,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:22,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:46:22,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:46:22,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:46:22,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:46:22,562 INFO L87 Difference]: Start difference. First operand 14130 states and 45724 transitions. Second operand 3 states. [2019-01-01 00:46:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:22,813 INFO L93 Difference]: Finished difference Result 15240 states and 49177 transitions. [2019-01-01 00:46:22,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:46:22,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-01 00:46:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:22,847 INFO L225 Difference]: With dead ends: 15240 [2019-01-01 00:46:22,848 INFO L226 Difference]: Without dead ends: 15240 [2019-01-01 00:46:22,848 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-01 00:46:22,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15240 states. [2019-01-01 00:46:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 14740. [2019-01-01 00:46:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14740 states. [2019-01-01 00:46:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14740 states to 14740 states and 47632 transitions. [2019-01-01 00:46:23,103 INFO L78 Accepts]: Start accepts. Automaton has 14740 states and 47632 transitions. Word has length 89 [2019-01-01 00:46:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:23,103 INFO L480 AbstractCegarLoop]: Abstraction has 14740 states and 47632 transitions. [2019-01-01 00:46:23,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:46:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 14740 states and 47632 transitions. [2019-01-01 00:46:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:23,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:23,125 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-01 00:46:23,125 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash -795426203, now seen corresponding path program 3 times [2019-01-01 00:46:23,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:23,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:23,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:46:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:23,380 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-01 00:46:23,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:23,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:46:23,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:46:23,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:46:23,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:46:23,382 INFO L87 Difference]: Start difference. First operand 14740 states and 47632 transitions. Second operand 4 states. [2019-01-01 00:46:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:24,018 INFO L93 Difference]: Finished difference Result 15572 states and 50400 transitions. [2019-01-01 00:46:24,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:46:24,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-01 00:46:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:24,049 INFO L225 Difference]: With dead ends: 15572 [2019-01-01 00:46:24,049 INFO L226 Difference]: Without dead ends: 15572 [2019-01-01 00:46:24,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:46:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15572 states. [2019-01-01 00:46:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15572 to 14996. [2019-01-01 00:46:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14996 states. [2019-01-01 00:46:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14996 states to 14996 states and 48528 transitions. [2019-01-01 00:46:24,298 INFO L78 Accepts]: Start accepts. Automaton has 14996 states and 48528 transitions. Word has length 89 [2019-01-01 00:46:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:24,298 INFO L480 AbstractCegarLoop]: Abstraction has 14996 states and 48528 transitions. [2019-01-01 00:46:24,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:46:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14996 states and 48528 transitions. [2019-01-01 00:46:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:24,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:46:24,324 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:24,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1692086630, now seen corresponding path program 1 times [2019-01-01 00:46:24,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:24,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:24,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:24,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:46:24,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:24,814 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2019-01-01 00:46:24,988 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-01 00:46:24,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:24,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:24,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:24,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:24,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:24,992 INFO L87 Difference]: Start difference. First operand 14996 states and 48528 transitions. Second operand 6 states. [2019-01-01 00:46:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:25,967 INFO L93 Difference]: Finished difference Result 21841 states and 70209 transitions. [2019-01-01 00:46:25,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:46:25,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-01 00:46:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:26,024 INFO L225 Difference]: With dead ends: 21841 [2019-01-01 00:46:26,024 INFO L226 Difference]: Without dead ends: 21713 [2019-01-01 00:46:26,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21713 states. [2019-01-01 00:46:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21713 to 18566. [2019-01-01 00:46:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18566 states. [2019-01-01 00:46:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18566 states to 18566 states and 59975 transitions. [2019-01-01 00:46:26,482 INFO L78 Accepts]: Start accepts. Automaton has 18566 states and 59975 transitions. Word has length 89 [2019-01-01 00:46:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:26,483 INFO L480 AbstractCegarLoop]: Abstraction has 18566 states and 59975 transitions. [2019-01-01 00:46:26,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 18566 states and 59975 transitions. [2019-01-01 00:46:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:26,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:26,525 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-01 00:46:26,525 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:26,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash -104864729, now seen corresponding path program 1 times [2019-01-01 00:46:26,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:26,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:26,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:26,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:26,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:26,957 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-01 00:46:26,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:26,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:46:26,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:46:26,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:46:26,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:26,959 INFO L87 Difference]: Start difference. First operand 18566 states and 59975 transitions. Second operand 7 states. [2019-01-01 00:46:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:28,124 INFO L93 Difference]: Finished difference Result 36185 states and 117444 transitions. [2019-01-01 00:46:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 00:46:28,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-01-01 00:46:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:28,200 INFO L225 Difference]: With dead ends: 36185 [2019-01-01 00:46:28,200 INFO L226 Difference]: Without dead ends: 36185 [2019-01-01 00:46:28,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:46:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36185 states. [2019-01-01 00:46:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36185 to 22484. [2019-01-01 00:46:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22484 states. [2019-01-01 00:46:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22484 states to 22484 states and 73108 transitions. [2019-01-01 00:46:28,874 INFO L78 Accepts]: Start accepts. Automaton has 22484 states and 73108 transitions. Word has length 89 [2019-01-01 00:46:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:28,874 INFO L480 AbstractCegarLoop]: Abstraction has 22484 states and 73108 transitions. [2019-01-01 00:46:28,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:46:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 22484 states and 73108 transitions. [2019-01-01 00:46:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:28,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:28,916 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-01 00:46:28,916 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:28,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:28,917 INFO L82 PathProgramCache]: Analyzing trace with hash 782638952, now seen corresponding path program 1 times [2019-01-01 00:46:28,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:28,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:28,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:28,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:29,767 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-01 00:46:29,780 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-01 00:46:29,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:29,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:29,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:29,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:29,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:29,786 INFO L87 Difference]: Start difference. First operand 22484 states and 73108 transitions. Second operand 6 states. [2019-01-01 00:46:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:30,484 INFO L93 Difference]: Finished difference Result 23682 states and 76189 transitions. [2019-01-01 00:46:30,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:46:30,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-01 00:46:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:30,531 INFO L225 Difference]: With dead ends: 23682 [2019-01-01 00:46:30,531 INFO L226 Difference]: Without dead ends: 23682 [2019-01-01 00:46:30,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:46:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23682 states. [2019-01-01 00:46:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23682 to 19210. [2019-01-01 00:46:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19210 states. [2019-01-01 00:46:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19210 states to 19210 states and 61587 transitions. [2019-01-01 00:46:30,880 INFO L78 Accepts]: Start accepts. Automaton has 19210 states and 61587 transitions. Word has length 89 [2019-01-01 00:46:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:30,880 INFO L480 AbstractCegarLoop]: Abstraction has 19210 states and 61587 transitions. [2019-01-01 00:46:30,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 19210 states and 61587 transitions. [2019-01-01 00:46:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:30,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:30,908 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-01 00:46:30,908 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:30,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:30,908 INFO L82 PathProgramCache]: Analyzing trace with hash 241225720, now seen corresponding path program 1 times [2019-01-01 00:46:30,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:30,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:30,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:30,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:30,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:31,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-01 00:46:31,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:31,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:31,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:31,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:31,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:31,312 INFO L87 Difference]: Start difference. First operand 19210 states and 61587 transitions. Second operand 6 states. [2019-01-01 00:46:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:32,089 INFO L93 Difference]: Finished difference Result 22660 states and 71757 transitions. [2019-01-01 00:46:32,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:46:32,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-01 00:46:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:32,133 INFO L225 Difference]: With dead ends: 22660 [2019-01-01 00:46:32,133 INFO L226 Difference]: Without dead ends: 22140 [2019-01-01 00:46:32,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22140 states. [2019-01-01 00:46:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22140 to 20895. [2019-01-01 00:46:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20895 states. [2019-01-01 00:46:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20895 states to 20895 states and 66740 transitions. [2019-01-01 00:46:32,494 INFO L78 Accepts]: Start accepts. Automaton has 20895 states and 66740 transitions. Word has length 89 [2019-01-01 00:46:32,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:32,494 INFO L480 AbstractCegarLoop]: Abstraction has 20895 states and 66740 transitions. [2019-01-01 00:46:32,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 20895 states and 66740 transitions. [2019-01-01 00:46:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:32,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:32,528 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-01 00:46:32,528 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:32,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:32,529 INFO L82 PathProgramCache]: Analyzing trace with hash -167762221, now seen corresponding path program 1 times [2019-01-01 00:46:32,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:32,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:32,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:32,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:32,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:32,878 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-01 00:46:32,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:32,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:46:32,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:46:32,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:46:32,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:32,880 INFO L87 Difference]: Start difference. First operand 20895 states and 66740 transitions. Second operand 7 states. [2019-01-01 00:46:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:33,547 INFO L93 Difference]: Finished difference Result 23643 states and 75439 transitions. [2019-01-01 00:46:33,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:46:33,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-01-01 00:46:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:33,595 INFO L225 Difference]: With dead ends: 23643 [2019-01-01 00:46:33,595 INFO L226 Difference]: Without dead ends: 23643 [2019-01-01 00:46:33,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23643 states. [2019-01-01 00:46:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23643 to 21045. [2019-01-01 00:46:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21045 states. [2019-01-01 00:46:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21045 states to 21045 states and 67380 transitions. [2019-01-01 00:46:33,972 INFO L78 Accepts]: Start accepts. Automaton has 21045 states and 67380 transitions. Word has length 89 [2019-01-01 00:46:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:33,973 INFO L480 AbstractCegarLoop]: Abstraction has 21045 states and 67380 transitions. [2019-01-01 00:46:33,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:46:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 21045 states and 67380 transitions. [2019-01-01 00:46:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:34,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:34,007 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-01 00:46:34,008 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1768878121, now seen corresponding path program 1 times [2019-01-01 00:46:34,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:34,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:34,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:34,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:34,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:34,401 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-01 00:46:34,777 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2019-01-01 00:46:34,787 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-01 00:46:34,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:34,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:34,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:34,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:34,790 INFO L87 Difference]: Start difference. First operand 21045 states and 67380 transitions. Second operand 6 states. [2019-01-01 00:46:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:36,057 INFO L93 Difference]: Finished difference Result 23210 states and 72642 transitions. [2019-01-01 00:46:36,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:46:36,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-01 00:46:36,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:36,102 INFO L225 Difference]: With dead ends: 23210 [2019-01-01 00:46:36,102 INFO L226 Difference]: Without dead ends: 23210 [2019-01-01 00:46:36,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:46:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23210 states. [2019-01-01 00:46:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23210 to 21470. [2019-01-01 00:46:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21470 states. [2019-01-01 00:46:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 67540 transitions. [2019-01-01 00:46:36,477 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 67540 transitions. Word has length 89 [2019-01-01 00:46:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:36,478 INFO L480 AbstractCegarLoop]: Abstraction has 21470 states and 67540 transitions. [2019-01-01 00:46:36,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 67540 transitions. [2019-01-01 00:46:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:36,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:36,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:36,514 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:36,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:36,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2023614666, now seen corresponding path program 1 times [2019-01-01 00:46:36,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:36,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:36,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:36,757 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-01 00:46:36,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:36,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:36,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:36,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:36,759 INFO L87 Difference]: Start difference. First operand 21470 states and 67540 transitions. Second operand 6 states. [2019-01-01 00:46:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:37,027 INFO L93 Difference]: Finished difference Result 19998 states and 61732 transitions. [2019-01-01 00:46:37,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:46:37,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-01 00:46:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:37,066 INFO L225 Difference]: With dead ends: 19998 [2019-01-01 00:46:37,066 INFO L226 Difference]: Without dead ends: 19998 [2019-01-01 00:46:37,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19998 states. [2019-01-01 00:46:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19998 to 12659. [2019-01-01 00:46:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12659 states. [2019-01-01 00:46:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 39042 transitions. [2019-01-01 00:46:37,347 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 39042 transitions. Word has length 89 [2019-01-01 00:46:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:37,347 INFO L480 AbstractCegarLoop]: Abstraction has 12659 states and 39042 transitions. [2019-01-01 00:46:37,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 39042 transitions. [2019-01-01 00:46:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:37,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:37,368 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-01 00:46:37,369 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash 368979928, now seen corresponding path program 1 times [2019-01-01 00:46:37,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:37,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:37,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:37,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:37,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:38,088 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-01-01 00:46:38,110 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-01 00:46:38,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:38,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:38,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:38,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:38,112 INFO L87 Difference]: Start difference. First operand 12659 states and 39042 transitions. Second operand 6 states. [2019-01-01 00:46:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:39,248 INFO L93 Difference]: Finished difference Result 14589 states and 44651 transitions. [2019-01-01 00:46:39,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:46:39,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:46:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:39,274 INFO L225 Difference]: With dead ends: 14589 [2019-01-01 00:46:39,275 INFO L226 Difference]: Without dead ends: 14299 [2019-01-01 00:46:39,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14299 states. [2019-01-01 00:46:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14299 to 11174. [2019-01-01 00:46:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11174 states. [2019-01-01 00:46:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11174 states to 11174 states and 34174 transitions. [2019-01-01 00:46:39,471 INFO L78 Accepts]: Start accepts. Automaton has 11174 states and 34174 transitions. Word has length 91 [2019-01-01 00:46:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:39,471 INFO L480 AbstractCegarLoop]: Abstraction has 11174 states and 34174 transitions. [2019-01-01 00:46:39,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 11174 states and 34174 transitions. [2019-01-01 00:46:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:39,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:39,486 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-01 00:46:39,486 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:39,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:39,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1708229415, now seen corresponding path program 1 times [2019-01-01 00:46:39,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:39,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:39,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:39,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:39,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:39,719 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-01 00:46:39,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:39,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 00:46:39,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 00:46:39,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 00:46:39,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:46:39,720 INFO L87 Difference]: Start difference. First operand 11174 states and 34174 transitions. Second operand 9 states. [2019-01-01 00:46:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:40,134 INFO L93 Difference]: Finished difference Result 13111 states and 40031 transitions. [2019-01-01 00:46:40,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:46:40,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-01-01 00:46:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:40,159 INFO L225 Difference]: With dead ends: 13111 [2019-01-01 00:46:40,159 INFO L226 Difference]: Without dead ends: 13111 [2019-01-01 00:46:40,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-01-01 00:46:40,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13111 states. [2019-01-01 00:46:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13111 to 12772. [2019-01-01 00:46:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12772 states. [2019-01-01 00:46:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 39053 transitions. [2019-01-01 00:46:40,363 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 39053 transitions. Word has length 91 [2019-01-01 00:46:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:40,364 INFO L480 AbstractCegarLoop]: Abstraction has 12772 states and 39053 transitions. [2019-01-01 00:46:40,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 00:46:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 39053 transitions. [2019-01-01 00:46:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:40,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:40,390 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-01 00:46:40,390 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash -820725734, now seen corresponding path program 1 times [2019-01-01 00:46:40,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:40,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:40,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:40,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:40,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:40,782 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-01 00:46:40,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:40,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 00:46:40,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 00:46:40,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 00:46:40,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:46:40,783 INFO L87 Difference]: Start difference. First operand 12772 states and 39053 transitions. Second operand 8 states. [2019-01-01 00:46:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:41,395 INFO L93 Difference]: Finished difference Result 22526 states and 68777 transitions. [2019-01-01 00:46:41,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:46:41,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2019-01-01 00:46:41,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:41,418 INFO L225 Difference]: With dead ends: 22526 [2019-01-01 00:46:41,418 INFO L226 Difference]: Without dead ends: 11514 [2019-01-01 00:46:41,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-01 00:46:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2019-01-01 00:46:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 10920. [2019-01-01 00:46:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2019-01-01 00:46:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 33137 transitions. [2019-01-01 00:46:41,604 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 33137 transitions. Word has length 91 [2019-01-01 00:46:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:41,604 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 33137 transitions. [2019-01-01 00:46:41,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 00:46:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 33137 transitions. [2019-01-01 00:46:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:41,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:41,619 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-01 00:46:41,619 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:41,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:41,620 INFO L82 PathProgramCache]: Analyzing trace with hash -148260104, now seen corresponding path program 2 times [2019-01-01 00:46:41,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:41,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:41,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:41,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:41,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:41,903 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 00:46:41,963 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-01 00:46:41,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:41,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 00:46:41,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 00:46:41,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 00:46:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 00:46:41,964 INFO L87 Difference]: Start difference. First operand 10920 states and 33137 transitions. Second operand 10 states. [2019-01-01 00:46:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:42,859 INFO L93 Difference]: Finished difference Result 18376 states and 56010 transitions. [2019-01-01 00:46:42,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:46:42,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-01-01 00:46:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:42,872 INFO L225 Difference]: With dead ends: 18376 [2019-01-01 00:46:42,872 INFO L226 Difference]: Without dead ends: 6510 [2019-01-01 00:46:42,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-01-01 00:46:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-01-01 00:46:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6510. [2019-01-01 00:46:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6510 states. [2019-01-01 00:46:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 19834 transitions. [2019-01-01 00:46:42,975 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 19834 transitions. Word has length 91 [2019-01-01 00:46:42,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:42,975 INFO L480 AbstractCegarLoop]: Abstraction has 6510 states and 19834 transitions. [2019-01-01 00:46:42,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 00:46:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 19834 transitions. [2019-01-01 00:46:42,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:42,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:42,984 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-01 00:46:42,985 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:42,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:42,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1100497526, now seen corresponding path program 1 times [2019-01-01 00:46:42,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:42,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:42,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:42,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:46:42,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:43,332 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-01 00:46:43,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:43,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:46:43,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:46:43,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:46:43,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:43,333 INFO L87 Difference]: Start difference. First operand 6510 states and 19834 transitions. Second operand 7 states. [2019-01-01 00:46:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:43,643 INFO L93 Difference]: Finished difference Result 7878 states and 24020 transitions. [2019-01-01 00:46:43,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:46:43,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-01 00:46:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:43,658 INFO L225 Difference]: With dead ends: 7878 [2019-01-01 00:46:43,658 INFO L226 Difference]: Without dead ends: 7878 [2019-01-01 00:46:43,658 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-01 00:46:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2019-01-01 00:46:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 7814. [2019-01-01 00:46:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7814 states. [2019-01-01 00:46:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 23812 transitions. [2019-01-01 00:46:43,785 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 23812 transitions. Word has length 91 [2019-01-01 00:46:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:43,786 INFO L480 AbstractCegarLoop]: Abstraction has 7814 states and 23812 transitions. [2019-01-01 00:46:43,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:46:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 23812 transitions. [2019-01-01 00:46:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:43,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:43,797 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-01 00:46:43,797 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:43,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1988001207, now seen corresponding path program 1 times [2019-01-01 00:46:43,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:43,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:43,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:43,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:46:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:46:43,894 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 00:46:44,144 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:46:44,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:46:44 BasicIcfg [2019-01-01 00:46:44,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:46:44,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:46:44,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:46:44,150 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:46:44,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:45:07" (3/4) ... [2019-01-01 00:46:44,156 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 00:46:44,402 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:46:44,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:46:44,406 INFO L168 Benchmark]: Toolchain (without parser) took 99612.57 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.6 GB). Free memory was 946.0 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-01-01 00:46:44,407 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-01 00:46:44,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 901.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:46:44,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.70 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-01 00:46:44,408 INFO L168 Benchmark]: Boogie Preprocessor took 84.48 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-01 00:46:44,409 INFO L168 Benchmark]: RCFGBuilder took 1198.65 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.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:46:44,411 INFO L168 Benchmark]: TraceAbstraction took 97048.80 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-01-01 00:46:44,411 INFO L168 Benchmark]: Witness Printer took 254.13 ms. Allocated memory is still 5.6 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-01-01 00:46:44,415 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 901.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.70 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 84.48 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 1198.65 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.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 97048.80 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 254.13 ms. Allocated memory is still 5.6 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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 t2582; 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(&t2582, ((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 t2583; 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(&t2583, ((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 t2584; 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(&t2584, ((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] [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 : (!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] [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, 96.8s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 29.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6056 SDtfs, 8130 SDslu, 13152 SDs, 0 SdLazy, 4840 SolverSat, 286 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 63 SyntacticMatches, 15 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 7.8s 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: 25.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 140270 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 2033 NumberOfCodeBlocks, 2033 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1917 ConstructedInterpolants, 0 QuantifiedInterpolants, 407891 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...