./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix045_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix045_rmo.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 e42b6a2a35cef26e55b291e79df7165f23d753e1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 02:27:16,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 02:27:16,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 02:27:16,896 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 02:27:16,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 02:27:16,897 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 02:27:16,898 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 02:27:16,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 02:27:16,913 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 02:27:16,914 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 02:27:16,917 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 02:27:16,917 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 02:27:16,919 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 02:27:16,927 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 02:27:16,928 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 02:27:16,929 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 02:27:16,930 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 02:27:16,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 02:27:16,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 02:27:16,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 02:27:16,944 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 02:27:16,945 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 02:27:16,950 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 02:27:16,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 02:27:16,950 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 02:27:16,951 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 02:27:16,952 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 02:27:16,956 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 02:27:16,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 02:27:16,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 02:27:16,957 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 02:27:16,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 02:27:16,958 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 02:27:16,958 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 02:27:16,959 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 02:27:16,960 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 02:27:16,960 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 02:27:16,975 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 02:27:16,976 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 02:27:16,977 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 02:27:16,977 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 02:27:16,977 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 02:27:16,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 02:27:16,978 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 02:27:16,978 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 02:27:16,978 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 02:27:16,978 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 02:27:16,978 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 02:27:16,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 02:27:16,979 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 02:27:16,979 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 02:27:16,979 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 02:27:16,979 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 02:27:16,979 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 02:27:16,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 02:27:16,980 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 02:27:16,980 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 02:27:16,980 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 02:27:16,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 02:27:16,981 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 02:27:16,981 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 02:27:16,981 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 02:27:16,981 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 02:27:16,981 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 02:27:16,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 02:27:16,982 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 -> e42b6a2a35cef26e55b291e79df7165f23d753e1 [2019-01-13 02:27:17,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 02:27:17,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 02:27:17,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 02:27:17,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 02:27:17,051 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 02:27:17,053 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix045_rmo.opt_false-unreach-call.i [2019-01-13 02:27:17,122 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a056a460f/6477423e33504e02956824cb5ea231fc/FLAG29267a49b [2019-01-13 02:27:17,710 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 02:27:17,711 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix045_rmo.opt_false-unreach-call.i [2019-01-13 02:27:17,735 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a056a460f/6477423e33504e02956824cb5ea231fc/FLAG29267a49b [2019-01-13 02:27:17,912 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a056a460f/6477423e33504e02956824cb5ea231fc [2019-01-13 02:27:17,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 02:27:17,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 02:27:17,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 02:27:17,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 02:27:17,924 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 02:27:17,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:27:17" (1/1) ... [2019-01-13 02:27:17,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae2106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:17, skipping insertion in model container [2019-01-13 02:27:17,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:27:17" (1/1) ... [2019-01-13 02:27:17,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 02:27:17,996 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 02:27:18,508 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:27:18,538 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 02:27:18,679 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:27:18,778 INFO L195 MainTranslator]: Completed translation [2019-01-13 02:27:18,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18 WrapperNode [2019-01-13 02:27:18,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 02:27:18,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 02:27:18,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 02:27:18,781 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 02:27:18,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18" (1/1) ... [2019-01-13 02:27:18,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18" (1/1) ... [2019-01-13 02:27:18,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 02:27:18,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 02:27:18,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 02:27:18,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 02:27:18,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18" (1/1) ... [2019-01-13 02:27:18,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18" (1/1) ... [2019-01-13 02:27:18,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18" (1/1) ... [2019-01-13 02:27:18,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18" (1/1) ... [2019-01-13 02:27:18,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18" (1/1) ... [2019-01-13 02:27:18,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18" (1/1) ... [2019-01-13 02:27:18,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18" (1/1) ... [2019-01-13 02:27:18,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 02:27:18,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 02:27:18,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 02:27:18,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 02:27:18,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 02:27:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 02:27:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 02:27:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 02:27:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 02:27:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 02:27:18,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 02:27:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 02:27:18,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 02:27:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-13 02:27:18,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-13 02:27:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 02:27:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 02:27:18,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 02:27:19,000 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 02:27:20,238 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 02:27:20,238 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 02:27:20,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:27:20 BoogieIcfgContainer [2019-01-13 02:27:20,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 02:27:20,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 02:27:20,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 02:27:20,245 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 02:27:20,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 02:27:17" (1/3) ... [2019-01-13 02:27:20,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af9df08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:27:20, skipping insertion in model container [2019-01-13 02:27:20,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:27:18" (2/3) ... [2019-01-13 02:27:20,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af9df08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:27:20, skipping insertion in model container [2019-01-13 02:27:20,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:27:20" (3/3) ... [2019-01-13 02:27:20,249 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_rmo.opt_false-unreach-call.i [2019-01-13 02:27:20,293 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,294 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,294 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,294 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,295 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,296 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,297 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,297 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,302 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,307 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,307 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,308 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,308 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,308 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,321 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,322 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,323 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,323 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:27:20,377 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 02:27:20,377 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 02:27:20,388 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 02:27:20,406 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 02:27:20,433 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 02:27:20,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 02:27:20,434 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 02:27:20,434 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 02:27:20,434 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 02:27:20,434 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 02:27:20,434 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 02:27:20,434 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 02:27:20,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 02:27:20,449 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2019-01-13 02:27:40,503 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2019-01-13 02:27:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2019-01-13 02:27:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 02:27:40,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:27:40,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:27:40,524 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:27:40,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:27:40,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2019-01-13 02:27:40,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:27:40,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:27:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:27:40,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:27:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:27:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:27:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:27:40,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:27:40,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:27:40,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:27:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:27:40,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:27:40,905 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2019-01-13 02:27:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:27:43,406 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2019-01-13 02:27:43,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:27:43,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-13 02:27:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:27:44,891 INFO L225 Difference]: With dead ends: 233474 [2019-01-13 02:27:44,892 INFO L226 Difference]: Without dead ends: 203724 [2019-01-13 02:27:44,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:27:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2019-01-13 02:27:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2019-01-13 02:27:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2019-01-13 02:27:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2019-01-13 02:27:56,784 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2019-01-13 02:27:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:27:56,786 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2019-01-13 02:27:56,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:27:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2019-01-13 02:27:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 02:27:56,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:27:56,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:27:56,801 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:27:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:27:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2019-01-13 02:27:56,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:27:56,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:27:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:27:56,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:27:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:27:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:27:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:27:56,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:27:56,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:27:56,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:27:56,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:27:56,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:27:56,914 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2019-01-13 02:27:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:27:57,989 INFO L93 Difference]: Finished difference Result 118894 states and 559662 transitions. [2019-01-13 02:27:57,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:27:57,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-13 02:27:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:27:58,463 INFO L225 Difference]: With dead ends: 118894 [2019-01-13 02:27:58,464 INFO L226 Difference]: Without dead ends: 118894 [2019-01-13 02:27:58,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:27:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2019-01-13 02:28:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2019-01-13 02:28:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2019-01-13 02:28:03,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559662 transitions. [2019-01-13 02:28:03,380 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559662 transitions. Word has length 52 [2019-01-13 02:28:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:03,381 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559662 transitions. [2019-01-13 02:28:03,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:28:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559662 transitions. [2019-01-13 02:28:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 02:28:03,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:03,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:03,387 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2019-01-13 02:28:03,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:03,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:03,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:03,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:03,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:03,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:03,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:28:03,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:28:03,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:28:03,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:28:03,546 INFO L87 Difference]: Start difference. First operand 118894 states and 559662 transitions. Second operand 5 states. [2019-01-13 02:28:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:13,710 INFO L93 Difference]: Finished difference Result 325274 states and 1470366 transitions. [2019-01-13 02:28:13,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:28:13,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-01-13 02:28:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:15,192 INFO L225 Difference]: With dead ends: 325274 [2019-01-13 02:28:15,193 INFO L226 Difference]: Without dead ends: 324274 [2019-01-13 02:28:15,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:28:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2019-01-13 02:28:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2019-01-13 02:28:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2019-01-13 02:28:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 842761 transitions. [2019-01-13 02:28:24,467 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 842761 transitions. Word has length 52 [2019-01-13 02:28:24,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:24,468 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 842761 transitions. [2019-01-13 02:28:24,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:28:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 842761 transitions. [2019-01-13 02:28:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 02:28:24,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:24,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:24,482 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:24,482 INFO L82 PathProgramCache]: Analyzing trace with hash -832854916, now seen corresponding path program 1 times [2019-01-13 02:28:24,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:24,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:24,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:24,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:24,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:24,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:24,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:28:24,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:28:24,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:28:24,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:28:24,635 INFO L87 Difference]: Start difference. First operand 186424 states and 842761 transitions. Second operand 4 states. [2019-01-13 02:28:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:25,559 INFO L93 Difference]: Finished difference Result 163600 states and 726962 transitions. [2019-01-13 02:28:25,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:28:25,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-13 02:28:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:26,089 INFO L225 Difference]: With dead ends: 163600 [2019-01-13 02:28:26,090 INFO L226 Difference]: Without dead ends: 160995 [2019-01-13 02:28:26,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:28:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160995 states. [2019-01-13 02:28:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160995 to 160995. [2019-01-13 02:28:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160995 states. [2019-01-13 02:28:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160995 states to 160995 states and 718280 transitions. [2019-01-13 02:28:38,075 INFO L78 Accepts]: Start accepts. Automaton has 160995 states and 718280 transitions. Word has length 53 [2019-01-13 02:28:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:38,075 INFO L480 AbstractCegarLoop]: Abstraction has 160995 states and 718280 transitions. [2019-01-13 02:28:38,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:28:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 160995 states and 718280 transitions. [2019-01-13 02:28:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 02:28:38,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:38,084 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] [2019-01-13 02:28:38,084 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1416535676, now seen corresponding path program 1 times [2019-01-13 02:28:38,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:38,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:38,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:38,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:38,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:38,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:38,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:28:38,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:28:38,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:28:38,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:28:38,202 INFO L87 Difference]: Start difference. First operand 160995 states and 718280 transitions. Second operand 5 states. [2019-01-13 02:28:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:38,535 INFO L93 Difference]: Finished difference Result 51407 states and 209141 transitions. [2019-01-13 02:28:38,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 02:28:38,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-01-13 02:28:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:38,653 INFO L225 Difference]: With dead ends: 51407 [2019-01-13 02:28:38,653 INFO L226 Difference]: Without dead ends: 49095 [2019-01-13 02:28:38,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:28:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49095 states. [2019-01-13 02:28:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49095 to 49095. [2019-01-13 02:28:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49095 states. [2019-01-13 02:28:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49095 states to 49095 states and 200479 transitions. [2019-01-13 02:28:40,874 INFO L78 Accepts]: Start accepts. Automaton has 49095 states and 200479 transitions. Word has length 54 [2019-01-13 02:28:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:40,875 INFO L480 AbstractCegarLoop]: Abstraction has 49095 states and 200479 transitions. [2019-01-13 02:28:40,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:28:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 49095 states and 200479 transitions. [2019-01-13 02:28:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 02:28:40,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:40,890 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] [2019-01-13 02:28:40,890 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash -106888934, now seen corresponding path program 1 times [2019-01-13 02:28:40,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:40,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:40,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:41,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:41,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:28:41,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:28:41,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:28:41,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:28:41,156 INFO L87 Difference]: Start difference. First operand 49095 states and 200479 transitions. Second operand 4 states. [2019-01-13 02:28:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:41,996 INFO L93 Difference]: Finished difference Result 70363 states and 282268 transitions. [2019-01-13 02:28:41,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:28:41,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-01-13 02:28:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:42,164 INFO L225 Difference]: With dead ends: 70363 [2019-01-13 02:28:42,165 INFO L226 Difference]: Without dead ends: 70363 [2019-01-13 02:28:42,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:28:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70363 states. [2019-01-13 02:28:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70363 to 53659. [2019-01-13 02:28:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53659 states. [2019-01-13 02:28:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53659 states to 53659 states and 217420 transitions. [2019-01-13 02:28:43,262 INFO L78 Accepts]: Start accepts. Automaton has 53659 states and 217420 transitions. Word has length 67 [2019-01-13 02:28:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:43,263 INFO L480 AbstractCegarLoop]: Abstraction has 53659 states and 217420 transitions. [2019-01-13 02:28:43,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:28:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 53659 states and 217420 transitions. [2019-01-13 02:28:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 02:28:43,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:43,279 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] [2019-01-13 02:28:43,279 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1635921401, now seen corresponding path program 1 times [2019-01-13 02:28:43,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:43,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:43,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:43,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:43,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:43,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:43,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:28:43,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:28:43,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:28:43,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:28:43,532 INFO L87 Difference]: Start difference. First operand 53659 states and 217420 transitions. Second operand 6 states. [2019-01-13 02:28:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:43,764 INFO L93 Difference]: Finished difference Result 11003 states and 37628 transitions. [2019-01-13 02:28:43,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:28:43,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-13 02:28:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:43,783 INFO L225 Difference]: With dead ends: 11003 [2019-01-13 02:28:43,783 INFO L226 Difference]: Without dead ends: 9291 [2019-01-13 02:28:43,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:28:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9291 states. [2019-01-13 02:28:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9291 to 8776. [2019-01-13 02:28:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8776 states. [2019-01-13 02:28:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8776 states to 8776 states and 29932 transitions. [2019-01-13 02:28:43,900 INFO L78 Accepts]: Start accepts. Automaton has 8776 states and 29932 transitions. Word has length 67 [2019-01-13 02:28:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:43,901 INFO L480 AbstractCegarLoop]: Abstraction has 8776 states and 29932 transitions. [2019-01-13 02:28:43,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:28:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 8776 states and 29932 transitions. [2019-01-13 02:28:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 02:28:43,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:43,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:43,915 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:43,915 INFO L82 PathProgramCache]: Analyzing trace with hash -67419081, now seen corresponding path program 1 times [2019-01-13 02:28:43,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:43,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:43,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:43,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:43,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:44,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:44,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:28:44,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:28:44,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:28:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:28:44,086 INFO L87 Difference]: Start difference. First operand 8776 states and 29932 transitions. Second operand 5 states. [2019-01-13 02:28:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:44,398 INFO L93 Difference]: Finished difference Result 10506 states and 35316 transitions. [2019-01-13 02:28:44,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:28:44,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-01-13 02:28:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:44,416 INFO L225 Difference]: With dead ends: 10506 [2019-01-13 02:28:44,416 INFO L226 Difference]: Without dead ends: 10506 [2019-01-13 02:28:44,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:28:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10506 states. [2019-01-13 02:28:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10506 to 9461. [2019-01-13 02:28:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9461 states. [2019-01-13 02:28:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9461 states to 9461 states and 32100 transitions. [2019-01-13 02:28:44,546 INFO L78 Accepts]: Start accepts. Automaton has 9461 states and 32100 transitions. Word has length 100 [2019-01-13 02:28:44,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:44,546 INFO L480 AbstractCegarLoop]: Abstraction has 9461 states and 32100 transitions. [2019-01-13 02:28:44,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:28:44,547 INFO L276 IsEmpty]: Start isEmpty. Operand 9461 states and 32100 transitions. [2019-01-13 02:28:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 02:28:44,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:44,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:44,562 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash -379441840, now seen corresponding path program 1 times [2019-01-13 02:28:44,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:44,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:44,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:44,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:44,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:44,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:44,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:28:44,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:28:44,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:28:44,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:28:44,824 INFO L87 Difference]: Start difference. First operand 9461 states and 32100 transitions. Second operand 4 states. [2019-01-13 02:28:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:45,412 INFO L93 Difference]: Finished difference Result 11631 states and 38936 transitions. [2019-01-13 02:28:45,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:28:45,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-13 02:28:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:45,431 INFO L225 Difference]: With dead ends: 11631 [2019-01-13 02:28:45,431 INFO L226 Difference]: Without dead ends: 11631 [2019-01-13 02:28:45,431 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-13 02:28:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11631 states. [2019-01-13 02:28:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11631 to 9961. [2019-01-13 02:28:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9961 states. [2019-01-13 02:28:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9961 states to 9961 states and 33635 transitions. [2019-01-13 02:28:46,460 INFO L78 Accepts]: Start accepts. Automaton has 9961 states and 33635 transitions. Word has length 100 [2019-01-13 02:28:46,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:46,460 INFO L480 AbstractCegarLoop]: Abstraction has 9961 states and 33635 transitions. [2019-01-13 02:28:46,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:28:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 9961 states and 33635 transitions. [2019-01-13 02:28:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 02:28:46,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:46,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:46,477 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:46,477 INFO L82 PathProgramCache]: Analyzing trace with hash 590139183, now seen corresponding path program 1 times [2019-01-13 02:28:46,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:46,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:46,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:46,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:46,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:46,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:46,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:28:46,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:28:46,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:28:46,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:28:46,544 INFO L87 Difference]: Start difference. First operand 9961 states and 33635 transitions. Second operand 4 states. [2019-01-13 02:28:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:46,850 INFO L93 Difference]: Finished difference Result 13841 states and 46867 transitions. [2019-01-13 02:28:46,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:28:46,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-13 02:28:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:46,873 INFO L225 Difference]: With dead ends: 13841 [2019-01-13 02:28:46,873 INFO L226 Difference]: Without dead ends: 13841 [2019-01-13 02:28:46,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:28:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13841 states. [2019-01-13 02:28:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13841 to 9596. [2019-01-13 02:28:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9596 states. [2019-01-13 02:28:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9596 states to 9596 states and 32158 transitions. [2019-01-13 02:28:47,027 INFO L78 Accepts]: Start accepts. Automaton has 9596 states and 32158 transitions. Word has length 100 [2019-01-13 02:28:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:47,028 INFO L480 AbstractCegarLoop]: Abstraction has 9596 states and 32158 transitions. [2019-01-13 02:28:47,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:28:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 9596 states and 32158 transitions. [2019-01-13 02:28:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 02:28:47,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:47,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:47,044 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:47,045 INFO L82 PathProgramCache]: Analyzing trace with hash -145703743, now seen corresponding path program 2 times [2019-01-13 02:28:47,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:47,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:47,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:47,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:47,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:47,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:28:47,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:28:47,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:28:47,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:28:47,465 INFO L87 Difference]: Start difference. First operand 9596 states and 32158 transitions. Second operand 5 states. [2019-01-13 02:28:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:47,802 INFO L93 Difference]: Finished difference Result 11051 states and 36777 transitions. [2019-01-13 02:28:47,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:28:47,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-01-13 02:28:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:47,820 INFO L225 Difference]: With dead ends: 11051 [2019-01-13 02:28:47,820 INFO L226 Difference]: Without dead ends: 11051 [2019-01-13 02:28:47,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:28:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11051 states. [2019-01-13 02:28:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11051 to 9086. [2019-01-13 02:28:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9086 states. [2019-01-13 02:28:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 30570 transitions. [2019-01-13 02:28:47,948 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 30570 transitions. Word has length 100 [2019-01-13 02:28:47,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:47,948 INFO L480 AbstractCegarLoop]: Abstraction has 9086 states and 30570 transitions. [2019-01-13 02:28:47,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:28:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 30570 transitions. [2019-01-13 02:28:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 02:28:47,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:47,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:47,963 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:47,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:47,963 INFO L82 PathProgramCache]: Analyzing trace with hash -410466765, now seen corresponding path program 1 times [2019-01-13 02:28:47,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:47,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:47,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:47,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 02:28:47,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:48,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:48,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:28:48,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:28:48,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:28:48,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:28:48,143 INFO L87 Difference]: Start difference. First operand 9086 states and 30570 transitions. Second operand 6 states. [2019-01-13 02:28:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:48,855 INFO L93 Difference]: Finished difference Result 10486 states and 34540 transitions. [2019-01-13 02:28:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:28:48,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-01-13 02:28:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:48,872 INFO L225 Difference]: With dead ends: 10486 [2019-01-13 02:28:48,872 INFO L226 Difference]: Without dead ends: 10136 [2019-01-13 02:28:48,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:28:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10136 states. [2019-01-13 02:28:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10136 to 9811. [2019-01-13 02:28:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9811 states. [2019-01-13 02:28:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9811 states to 9811 states and 32665 transitions. [2019-01-13 02:28:49,000 INFO L78 Accepts]: Start accepts. Automaton has 9811 states and 32665 transitions. Word has length 102 [2019-01-13 02:28:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:49,001 INFO L480 AbstractCegarLoop]: Abstraction has 9811 states and 32665 transitions. [2019-01-13 02:28:49,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:28:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 9811 states and 32665 transitions. [2019-01-13 02:28:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 02:28:49,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:49,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:49,015 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:49,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1290273714, now seen corresponding path program 1 times [2019-01-13 02:28:49,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:49,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:49,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:49,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:49,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:49,871 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-13 02:28:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:49,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:49,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:28:49,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:28:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:28:49,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:28:49,891 INFO L87 Difference]: Start difference. First operand 9811 states and 32665 transitions. Second operand 7 states. [2019-01-13 02:28:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:50,624 INFO L93 Difference]: Finished difference Result 11014 states and 36498 transitions. [2019-01-13 02:28:50,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:28:50,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-01-13 02:28:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:50,643 INFO L225 Difference]: With dead ends: 11014 [2019-01-13 02:28:50,643 INFO L226 Difference]: Without dead ends: 11014 [2019-01-13 02:28:50,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:28:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11014 states. [2019-01-13 02:28:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11014 to 9786. [2019-01-13 02:28:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9786 states. [2019-01-13 02:28:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9786 states to 9786 states and 32605 transitions. [2019-01-13 02:28:50,779 INFO L78 Accepts]: Start accepts. Automaton has 9786 states and 32605 transitions. Word has length 102 [2019-01-13 02:28:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:50,779 INFO L480 AbstractCegarLoop]: Abstraction has 9786 states and 32605 transitions. [2019-01-13 02:28:50,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:28:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 9786 states and 32605 transitions. [2019-01-13 02:28:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 02:28:50,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:50,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:50,792 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1593814062, now seen corresponding path program 1 times [2019-01-13 02:28:50,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:50,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:50,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:50,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:50,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:51,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:51,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:28:51,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:28:51,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:28:51,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:28:51,158 INFO L87 Difference]: Start difference. First operand 9786 states and 32605 transitions. Second operand 5 states. [2019-01-13 02:28:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:51,347 INFO L93 Difference]: Finished difference Result 8579 states and 28241 transitions. [2019-01-13 02:28:51,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:28:51,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-01-13 02:28:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:51,361 INFO L225 Difference]: With dead ends: 8579 [2019-01-13 02:28:51,361 INFO L226 Difference]: Without dead ends: 8579 [2019-01-13 02:28:51,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:28:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8579 states. [2019-01-13 02:28:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8579 to 8544. [2019-01-13 02:28:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8544 states. [2019-01-13 02:28:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8544 states to 8544 states and 28143 transitions. [2019-01-13 02:28:51,477 INFO L78 Accepts]: Start accepts. Automaton has 8544 states and 28143 transitions. Word has length 102 [2019-01-13 02:28:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:51,477 INFO L480 AbstractCegarLoop]: Abstraction has 8544 states and 28143 transitions. [2019-01-13 02:28:51,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:28:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8544 states and 28143 transitions. [2019-01-13 02:28:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 02:28:51,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:51,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:51,488 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2042510701, now seen corresponding path program 1 times [2019-01-13 02:28:51,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:51,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:51,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:51,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:51,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:51,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:28:51,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:28:51,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:28:51,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:28:51,757 INFO L87 Difference]: Start difference. First operand 8544 states and 28143 transitions. Second operand 4 states. [2019-01-13 02:28:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:51,973 INFO L93 Difference]: Finished difference Result 9888 states and 32831 transitions. [2019-01-13 02:28:51,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:28:51,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-01-13 02:28:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:51,989 INFO L225 Difference]: With dead ends: 9888 [2019-01-13 02:28:51,989 INFO L226 Difference]: Without dead ends: 9888 [2019-01-13 02:28:51,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:28:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9888 states. [2019-01-13 02:28:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9888 to 9760. [2019-01-13 02:28:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9760 states. [2019-01-13 02:28:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9760 states to 9760 states and 32415 transitions. [2019-01-13 02:28:52,117 INFO L78 Accepts]: Start accepts. Automaton has 9760 states and 32415 transitions. Word has length 102 [2019-01-13 02:28:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:52,117 INFO L480 AbstractCegarLoop]: Abstraction has 9760 states and 32415 transitions. [2019-01-13 02:28:52,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:28:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 9760 states and 32415 transitions. [2019-01-13 02:28:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-13 02:28:52,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:52,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:52,132 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:52,132 INFO L82 PathProgramCache]: Analyzing trace with hash 175247252, now seen corresponding path program 1 times [2019-01-13 02:28:52,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:52,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:52,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:52,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:52,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:52,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:52,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:28:52,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:28:52,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:28:52,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:28:52,368 INFO L87 Difference]: Start difference. First operand 9760 states and 32415 transitions. Second operand 6 states. [2019-01-13 02:28:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:52,597 INFO L93 Difference]: Finished difference Result 8608 states and 27967 transitions. [2019-01-13 02:28:52,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 02:28:52,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-01-13 02:28:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:52,611 INFO L225 Difference]: With dead ends: 8608 [2019-01-13 02:28:52,612 INFO L226 Difference]: Without dead ends: 8608 [2019-01-13 02:28:52,612 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-13 02:28:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8608 states. [2019-01-13 02:28:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8608 to 7183. [2019-01-13 02:28:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7183 states. [2019-01-13 02:28:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 23561 transitions. [2019-01-13 02:28:52,711 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 23561 transitions. Word has length 102 [2019-01-13 02:28:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:52,711 INFO L480 AbstractCegarLoop]: Abstraction has 7183 states and 23561 transitions. [2019-01-13 02:28:52,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:28:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 23561 transitions. [2019-01-13 02:28:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-13 02:28:52,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:52,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:52,721 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:52,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:52,721 INFO L82 PathProgramCache]: Analyzing trace with hash -427821553, now seen corresponding path program 1 times [2019-01-13 02:28:52,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:52,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:52,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:52,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:52,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:52,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:52,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:28:52,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:28:52,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:28:52,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:28:52,923 INFO L87 Difference]: Start difference. First operand 7183 states and 23561 transitions. Second operand 7 states. [2019-01-13 02:28:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:53,822 INFO L93 Difference]: Finished difference Result 13310 states and 43019 transitions. [2019-01-13 02:28:53,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 02:28:53,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-01-13 02:28:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:53,843 INFO L225 Difference]: With dead ends: 13310 [2019-01-13 02:28:53,843 INFO L226 Difference]: Without dead ends: 13310 [2019-01-13 02:28:53,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 02:28:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2019-01-13 02:28:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 10245. [2019-01-13 02:28:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10245 states. [2019-01-13 02:28:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 33633 transitions. [2019-01-13 02:28:53,997 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 33633 transitions. Word has length 104 [2019-01-13 02:28:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:53,997 INFO L480 AbstractCegarLoop]: Abstraction has 10245 states and 33633 transitions. [2019-01-13 02:28:53,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:28:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 33633 transitions. [2019-01-13 02:28:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-13 02:28:54,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:54,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:54,011 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:54,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash 816942928, now seen corresponding path program 1 times [2019-01-13 02:28:54,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:54,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:54,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:54,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:54,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:54,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:54,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:28:54,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:28:54,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:28:54,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:28:54,198 INFO L87 Difference]: Start difference. First operand 10245 states and 33633 transitions. Second operand 6 states. [2019-01-13 02:28:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:54,450 INFO L93 Difference]: Finished difference Result 10435 states and 33930 transitions. [2019-01-13 02:28:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:28:54,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-01-13 02:28:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:54,467 INFO L225 Difference]: With dead ends: 10435 [2019-01-13 02:28:54,467 INFO L226 Difference]: Without dead ends: 10435 [2019-01-13 02:28:54,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:28:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10435 states. [2019-01-13 02:28:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10435 to 10170. [2019-01-13 02:28:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10170 states. [2019-01-13 02:28:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 33203 transitions. [2019-01-13 02:28:54,690 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 33203 transitions. Word has length 104 [2019-01-13 02:28:54,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:54,691 INFO L480 AbstractCegarLoop]: Abstraction has 10170 states and 33203 transitions. [2019-01-13 02:28:54,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:28:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 33203 transitions. [2019-01-13 02:28:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-13 02:28:54,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:54,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:54,703 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash -98055792, now seen corresponding path program 1 times [2019-01-13 02:28:54,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:54,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:54,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:54,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:54,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:55,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:55,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:28:55,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:28:55,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:28:55,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:28:55,089 INFO L87 Difference]: Start difference. First operand 10170 states and 33203 transitions. Second operand 6 states. [2019-01-13 02:28:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:55,445 INFO L93 Difference]: Finished difference Result 12714 states and 40853 transitions. [2019-01-13 02:28:55,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:28:55,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-01-13 02:28:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:55,465 INFO L225 Difference]: With dead ends: 12714 [2019-01-13 02:28:55,465 INFO L226 Difference]: Without dead ends: 12714 [2019-01-13 02:28:55,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:28:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12714 states. [2019-01-13 02:28:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12714 to 10420. [2019-01-13 02:28:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10420 states. [2019-01-13 02:28:55,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10420 states to 10420 states and 33823 transitions. [2019-01-13 02:28:55,614 INFO L78 Accepts]: Start accepts. Automaton has 10420 states and 33823 transitions. Word has length 104 [2019-01-13 02:28:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:55,615 INFO L480 AbstractCegarLoop]: Abstraction has 10420 states and 33823 transitions. [2019-01-13 02:28:55,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:28:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 10420 states and 33823 transitions. [2019-01-13 02:28:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-13 02:28:55,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:55,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:55,628 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:55,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:55,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2023589103, now seen corresponding path program 1 times [2019-01-13 02:28:55,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:55,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:55,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:55,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:55,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:55,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:55,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:28:55,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:28:55,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:28:55,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:28:55,964 INFO L87 Difference]: Start difference. First operand 10420 states and 33823 transitions. Second operand 5 states. [2019-01-13 02:28:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:56,224 INFO L93 Difference]: Finished difference Result 11700 states and 37983 transitions. [2019-01-13 02:28:56,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:28:56,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-01-13 02:28:56,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:56,244 INFO L225 Difference]: With dead ends: 11700 [2019-01-13 02:28:56,244 INFO L226 Difference]: Without dead ends: 11700 [2019-01-13 02:28:56,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:28:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11700 states. [2019-01-13 02:28:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11700 to 9252. [2019-01-13 02:28:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9252 states. [2019-01-13 02:28:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9252 states to 9252 states and 30134 transitions. [2019-01-13 02:28:56,379 INFO L78 Accepts]: Start accepts. Automaton has 9252 states and 30134 transitions. Word has length 104 [2019-01-13 02:28:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:56,380 INFO L480 AbstractCegarLoop]: Abstraction has 9252 states and 30134 transitions. [2019-01-13 02:28:56,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:28:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 9252 states and 30134 transitions. [2019-01-13 02:28:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-13 02:28:56,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:56,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:56,391 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:56,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:56,391 INFO L82 PathProgramCache]: Analyzing trace with hash -778824622, now seen corresponding path program 1 times [2019-01-13 02:28:56,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:56,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:56,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:56,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:56,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:56,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:56,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 02:28:56,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 02:28:56,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 02:28:56,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 02:28:56,657 INFO L87 Difference]: Start difference. First operand 9252 states and 30134 transitions. Second operand 10 states. [2019-01-13 02:28:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:57,323 INFO L93 Difference]: Finished difference Result 17320 states and 56845 transitions. [2019-01-13 02:28:57,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:28:57,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-01-13 02:28:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:57,339 INFO L225 Difference]: With dead ends: 17320 [2019-01-13 02:28:57,339 INFO L226 Difference]: Without dead ends: 8528 [2019-01-13 02:28:57,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-13 02:28:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8528 states. [2019-01-13 02:28:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8528 to 8528. [2019-01-13 02:28:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8528 states. [2019-01-13 02:28:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8528 states to 8528 states and 28006 transitions. [2019-01-13 02:28:57,448 INFO L78 Accepts]: Start accepts. Automaton has 8528 states and 28006 transitions. Word has length 104 [2019-01-13 02:28:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:57,448 INFO L480 AbstractCegarLoop]: Abstraction has 8528 states and 28006 transitions. [2019-01-13 02:28:57,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 02:28:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 8528 states and 28006 transitions. [2019-01-13 02:28:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-13 02:28:57,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:57,459 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:57,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:57,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1989616522, now seen corresponding path program 2 times [2019-01-13 02:28:57,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:57,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:57,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:57,723 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 02:28:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:58,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:58,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:28:58,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:28:58,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:28:58,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:28:58,092 INFO L87 Difference]: Start difference. First operand 8528 states and 28006 transitions. Second operand 7 states. [2019-01-13 02:28:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:58,507 INFO L93 Difference]: Finished difference Result 15478 states and 51687 transitions. [2019-01-13 02:28:58,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:28:58,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-01-13 02:28:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:58,520 INFO L225 Difference]: With dead ends: 15478 [2019-01-13 02:28:58,521 INFO L226 Difference]: Without dead ends: 7183 [2019-01-13 02:28:58,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 02:28:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2019-01-13 02:28:58,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 7183. [2019-01-13 02:28:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7183 states. [2019-01-13 02:28:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 24291 transitions. [2019-01-13 02:28:58,630 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 24291 transitions. Word has length 104 [2019-01-13 02:28:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:58,631 INFO L480 AbstractCegarLoop]: Abstraction has 7183 states and 24291 transitions. [2019-01-13 02:28:58,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:28:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 24291 transitions. [2019-01-13 02:28:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-13 02:28:58,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:58,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:58,640 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2012827780, now seen corresponding path program 1 times [2019-01-13 02:28:58,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:58,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:58,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:58,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 02:28:58,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:58,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:58,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:28:58,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:28:58,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:28:58,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:28:58,851 INFO L87 Difference]: Start difference. First operand 7183 states and 24291 transitions. Second operand 6 states. [2019-01-13 02:28:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:28:59,312 INFO L93 Difference]: Finished difference Result 8103 states and 26833 transitions. [2019-01-13 02:28:59,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:28:59,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-01-13 02:28:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:28:59,327 INFO L225 Difference]: With dead ends: 8103 [2019-01-13 02:28:59,327 INFO L226 Difference]: Without dead ends: 8103 [2019-01-13 02:28:59,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:28:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8103 states. [2019-01-13 02:28:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8103 to 7363. [2019-01-13 02:28:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7363 states. [2019-01-13 02:28:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7363 states to 7363 states and 24774 transitions. [2019-01-13 02:28:59,429 INFO L78 Accepts]: Start accepts. Automaton has 7363 states and 24774 transitions. Word has length 104 [2019-01-13 02:28:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:28:59,430 INFO L480 AbstractCegarLoop]: Abstraction has 7363 states and 24774 transitions. [2019-01-13 02:28:59,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:28:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 7363 states and 24774 transitions. [2019-01-13 02:28:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-13 02:28:59,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:28:59,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:28:59,440 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:28:59,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:28:59,440 INFO L82 PathProgramCache]: Analyzing trace with hash -380023781, now seen corresponding path program 1 times [2019-01-13 02:28:59,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:28:59,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:28:59,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:59,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:28:59,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:28:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:28:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:28:59,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:28:59,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:28:59,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:28:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:28:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:28:59,734 INFO L87 Difference]: Start difference. First operand 7363 states and 24774 transitions. Second operand 6 states. [2019-01-13 02:29:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:29:00,074 INFO L93 Difference]: Finished difference Result 7423 states and 24911 transitions. [2019-01-13 02:29:00,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:29:00,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-01-13 02:29:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:29:00,087 INFO L225 Difference]: With dead ends: 7423 [2019-01-13 02:29:00,087 INFO L226 Difference]: Without dead ends: 7343 [2019-01-13 02:29:00,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:29:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7343 states. [2019-01-13 02:29:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7343 to 7151. [2019-01-13 02:29:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-01-13 02:29:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 24187 transitions. [2019-01-13 02:29:00,182 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 24187 transitions. Word has length 104 [2019-01-13 02:29:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:29:00,183 INFO L480 AbstractCegarLoop]: Abstraction has 7151 states and 24187 transitions. [2019-01-13 02:29:00,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:29:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 24187 transitions. [2019-01-13 02:29:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-13 02:29:00,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:29:00,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:29:00,193 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:29:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:29:00,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1098792219, now seen corresponding path program 1 times [2019-01-13 02:29:00,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:29:00,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:29:00,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:29:00,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:29:00,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:29:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:29:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:29:00,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:29:00,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:29:00,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:29:00,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:29:00,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:29:00,496 INFO L87 Difference]: Start difference. First operand 7151 states and 24187 transitions. Second operand 6 states. [2019-01-13 02:29:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:29:00,709 INFO L93 Difference]: Finished difference Result 7319 states and 24597 transitions. [2019-01-13 02:29:00,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 02:29:00,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-01-13 02:29:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:29:00,722 INFO L225 Difference]: With dead ends: 7319 [2019-01-13 02:29:00,723 INFO L226 Difference]: Without dead ends: 7319 [2019-01-13 02:29:00,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-13 02:29:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2019-01-13 02:29:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 7291. [2019-01-13 02:29:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7291 states. [2019-01-13 02:29:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7291 states to 7291 states and 24524 transitions. [2019-01-13 02:29:00,818 INFO L78 Accepts]: Start accepts. Automaton has 7291 states and 24524 transitions. Word has length 104 [2019-01-13 02:29:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:29:00,818 INFO L480 AbstractCegarLoop]: Abstraction has 7291 states and 24524 transitions. [2019-01-13 02:29:00,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:29:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7291 states and 24524 transitions. [2019-01-13 02:29:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-13 02:29:00,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:29:00,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:29:00,827 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:29:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:29:00,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 3 times [2019-01-13 02:29:00,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:29:00,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:29:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:29:00,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:29:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:29:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:29:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:29:00,922 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 02:29:01,140 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 02:29:01,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 02:29:01 BasicIcfg [2019-01-13 02:29:01,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 02:29:01,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 02:29:01,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 02:29:01,143 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 02:29:01,146 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:27:20" (3/4) ... [2019-01-13 02:29:01,148 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 02:29:01,325 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 02:29:01,328 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 02:29:01,329 INFO L168 Benchmark]: Toolchain (without parser) took 103412.05 ms. Allocated memory was 1.0 GB in the beginning and 7.0 GB in the end (delta: 5.9 GB). Free memory was 951.3 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-01-13 02:29:01,330 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 02:29:01,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-13 02:29:01,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.17 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-01-13 02:29:01,331 INFO L168 Benchmark]: Boogie Preprocessor took 45.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 02:29:01,332 INFO L168 Benchmark]: RCFGBuilder took 1321.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-01-13 02:29:01,332 INFO L168 Benchmark]: TraceAbstraction took 100901.89 ms. Allocated memory was 1.2 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-01-13 02:29:01,335 INFO L168 Benchmark]: Witness Printer took 185.32 ms. Allocated memory is still 7.0 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-01-13 02:29:01,338 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 859.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.17 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.60 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 1321.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100901.89 ms. Allocated memory was 1.2 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 185.32 ms. Allocated memory is still 7.0 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L786] -1 pthread_t t1210; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L787] FCALL, FORK -1 pthread_create(&t1210, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L788] -1 pthread_t t1211; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L789] FCALL, FORK -1 pthread_create(&t1211, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L790] -1 pthread_t t1212; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L791] FCALL, FORK -1 pthread_create(&t1212, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 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) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] 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=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 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 [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] 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=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 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 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -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) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 200 locations, 3 error locations. UNSAFE Result, 100.7s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 28.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5453 SDtfs, 5500 SDslu, 10788 SDs, 0 SdLazy, 4000 SolverSat, 280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 67 SyntacticMatches, 17 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186424occurred in iteration=3, 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: 44.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 260997 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2340 NumberOfCodeBlocks, 2340 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2211 ConstructedInterpolants, 0 QuantifiedInterpolants, 496430 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...