./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe010_power.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/safe010_power.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1d9124df5aff3d93132caeaebf2b71e0ed41a1f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:30:51,054 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 04:30:51,056 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 04:30:51,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 04:30:51,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 04:30:51,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 04:30:51,070 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 04:30:51,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 04:30:51,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 04:30:51,075 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 04:30:51,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 04:30:51,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 04:30:51,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 04:30:51,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 04:30:51,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 04:30:51,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 04:30:51,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 04:30:51,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 04:30:51,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 04:30:51,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 04:30:51,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 04:30:51,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 04:30:51,094 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 04:30:51,095 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 04:30:51,095 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 04:30:51,096 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 04:30:51,097 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 04:30:51,098 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 04:30:51,099 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 04:30:51,100 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 04:30:51,101 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 04:30:51,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 04:30:51,102 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 04:30:51,102 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 04:30:51,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 04:30:51,104 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 04:30:51,104 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 04:30:51,129 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 04:30:51,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 04:30:51,132 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 04:30:51,132 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 04:30:51,133 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 04:30:51,134 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 04:30:51,134 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 04:30:51,134 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 04:30:51,134 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 04:30:51,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 04:30:51,135 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 04:30:51,135 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 04:30:51,135 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 04:30:51,135 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 04:30:51,135 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 04:30:51,135 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 04:30:51,136 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 04:30:51,138 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 04:30:51,139 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 04:30:51,139 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 04:30:51,139 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 04:30:51,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 04:30:51,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 04:30:51,139 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 04:30:51,140 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 04:30:51,140 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 04:30:51,140 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 04:30:51,140 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 04:30:51,140 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 -> f1d9124df5aff3d93132caeaebf2b71e0ed41a1f [2019-01-13 04:30:51,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 04:30:51,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 04:30:51,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 04:30:51,210 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 04:30:51,211 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 04:30:51,212 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe010_power.opt_false-unreach-call.i [2019-01-13 04:30:51,282 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f7db7d5/f7091984ed7b400bbe0e91860035b67e/FLAG150c8322e [2019-01-13 04:30:51,872 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 04:30:51,873 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe010_power.opt_false-unreach-call.i [2019-01-13 04:30:51,890 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f7db7d5/f7091984ed7b400bbe0e91860035b67e/FLAG150c8322e [2019-01-13 04:30:52,116 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f7db7d5/f7091984ed7b400bbe0e91860035b67e [2019-01-13 04:30:52,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 04:30:52,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 04:30:52,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 04:30:52,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 04:30:52,125 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 04:30:52,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 04:30:52" (1/1) ... [2019-01-13 04:30:52,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d33055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52, skipping insertion in model container [2019-01-13 04:30:52,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 04:30:52" (1/1) ... [2019-01-13 04:30:52,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 04:30:52,182 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 04:30:52,677 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 04:30:52,698 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 04:30:52,888 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 04:30:52,988 INFO L195 MainTranslator]: Completed translation [2019-01-13 04:30:52,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52 WrapperNode [2019-01-13 04:30:52,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 04:30:52,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 04:30:52,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 04:30:52,992 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 04:30:53,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52" (1/1) ... [2019-01-13 04:30:53,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52" (1/1) ... [2019-01-13 04:30:53,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 04:30:53,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 04:30:53,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 04:30:53,071 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 04:30:53,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52" (1/1) ... [2019-01-13 04:30:53,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52" (1/1) ... [2019-01-13 04:30:53,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52" (1/1) ... [2019-01-13 04:30:53,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52" (1/1) ... [2019-01-13 04:30:53,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52" (1/1) ... [2019-01-13 04:30:53,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52" (1/1) ... [2019-01-13 04:30:53,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52" (1/1) ... [2019-01-13 04:30:53,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 04:30:53,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 04:30:53,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 04:30:53,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 04:30:53,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52" (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 04:30:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 04:30:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 04:30:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 04:30:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 04:30:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 04:30:53,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 04:30:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 04:30:53,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 04:30:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 04:30:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 04:30:53,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 04:30:53,189 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 04:30:54,277 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 04:30:54,278 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 04:30:54,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:30:54 BoogieIcfgContainer [2019-01-13 04:30:54,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 04:30:54,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 04:30:54,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 04:30:54,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 04:30:54,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 04:30:52" (1/3) ... [2019-01-13 04:30:54,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec5befc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 04:30:54, skipping insertion in model container [2019-01-13 04:30:54,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:30:52" (2/3) ... [2019-01-13 04:30:54,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec5befc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 04:30:54, skipping insertion in model container [2019-01-13 04:30:54,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:30:54" (3/3) ... [2019-01-13 04:30:54,288 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.opt_false-unreach-call.i [2019-01-13 04:30:54,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,332 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,332 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,332 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,333 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,333 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,341 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,341 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:30:54,369 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 04:30:54,369 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 04:30:54,378 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 04:30:54,395 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 04:30:54,420 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 04:30:54,421 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 04:30:54,421 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 04:30:54,421 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 04:30:54,422 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 04:30:54,422 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 04:30:54,422 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 04:30:54,422 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 04:30:54,422 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 04:30:54,436 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2019-01-13 04:30:55,950 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25103 states. [2019-01-13 04:30:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 25103 states. [2019-01-13 04:30:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 04:30:55,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:55,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] [2019-01-13 04:30:55,964 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:55,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash -969782754, now seen corresponding path program 1 times [2019-01-13 04:30:55,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:55,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:56,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:56,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:30:56,324 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 04:30:56,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:30:56,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:30:56,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:30:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:30:56,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:30:56,348 INFO L87 Difference]: Start difference. First operand 25103 states. Second operand 4 states. [2019-01-13 04:30:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:30:57,648 INFO L93 Difference]: Finished difference Result 45395 states and 177649 transitions. [2019-01-13 04:30:57,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:30:57,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-01-13 04:30:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:30:58,014 INFO L225 Difference]: With dead ends: 45395 [2019-01-13 04:30:58,014 INFO L226 Difference]: Without dead ends: 40635 [2019-01-13 04:30:58,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:30:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40635 states. [2019-01-13 04:30:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40635 to 23669. [2019-01-13 04:30:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23669 states. [2019-01-13 04:30:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 92566 transitions. [2019-01-13 04:30:59,883 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 92566 transitions. Word has length 32 [2019-01-13 04:30:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:30:59,884 INFO L480 AbstractCegarLoop]: Abstraction has 23669 states and 92566 transitions. [2019-01-13 04:30:59,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:30:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 92566 transitions. [2019-01-13 04:30:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 04:30:59,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:30:59,893 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] [2019-01-13 04:30:59,893 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:30:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:30:59,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1661840205, now seen corresponding path program 1 times [2019-01-13 04:30:59,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:30:59,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:30:59,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:59,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:30:59,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:30:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:00,120 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 04:31:00,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:00,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:00,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:00,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:00,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:00,128 INFO L87 Difference]: Start difference. First operand 23669 states and 92566 transitions. Second operand 5 states. [2019-01-13 04:31:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:03,200 INFO L93 Difference]: Finished difference Result 64837 states and 241396 transitions. [2019-01-13 04:31:03,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:31:03,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-01-13 04:31:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:03,548 INFO L225 Difference]: With dead ends: 64837 [2019-01-13 04:31:03,549 INFO L226 Difference]: Without dead ends: 64677 [2019-01-13 04:31:03,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:31:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64677 states. [2019-01-13 04:31:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64677 to 37149. [2019-01-13 04:31:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37149 states. [2019-01-13 04:31:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37149 states to 37149 states and 138311 transitions. [2019-01-13 04:31:05,428 INFO L78 Accepts]: Start accepts. Automaton has 37149 states and 138311 transitions. Word has length 43 [2019-01-13 04:31:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:05,430 INFO L480 AbstractCegarLoop]: Abstraction has 37149 states and 138311 transitions. [2019-01-13 04:31:05,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:31:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 37149 states and 138311 transitions. [2019-01-13 04:31:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 04:31:05,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:05,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:05,436 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1508943518, now seen corresponding path program 1 times [2019-01-13 04:31:05,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:05,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:05,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:05,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:05,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:05,606 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 04:31:05,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:05,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:05,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:05,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:05,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:05,608 INFO L87 Difference]: Start difference. First operand 37149 states and 138311 transitions. Second operand 4 states. [2019-01-13 04:31:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:05,715 INFO L93 Difference]: Finished difference Result 12371 states and 41204 transitions. [2019-01-13 04:31:05,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:31:05,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-13 04:31:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:05,775 INFO L225 Difference]: With dead ends: 12371 [2019-01-13 04:31:05,775 INFO L226 Difference]: Without dead ends: 11850 [2019-01-13 04:31:05,776 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 04:31:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2019-01-13 04:31:06,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 11850. [2019-01-13 04:31:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11850 states. [2019-01-13 04:31:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11850 states to 11850 states and 39649 transitions. [2019-01-13 04:31:06,090 INFO L78 Accepts]: Start accepts. Automaton has 11850 states and 39649 transitions. Word has length 44 [2019-01-13 04:31:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:06,091 INFO L480 AbstractCegarLoop]: Abstraction has 11850 states and 39649 transitions. [2019-01-13 04:31:06,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 11850 states and 39649 transitions. [2019-01-13 04:31:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 04:31:06,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:06,104 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] [2019-01-13 04:31:06,104 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1699267050, now seen corresponding path program 1 times [2019-01-13 04:31:06,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:06,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:06,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:06,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:06,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:06,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:06,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:06,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:06,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:06,313 INFO L87 Difference]: Start difference. First operand 11850 states and 39649 transitions. Second operand 4 states. [2019-01-13 04:31:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:06,742 INFO L93 Difference]: Finished difference Result 17026 states and 55724 transitions. [2019-01-13 04:31:06,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:31:06,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-13 04:31:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:06,813 INFO L225 Difference]: With dead ends: 17026 [2019-01-13 04:31:06,813 INFO L226 Difference]: Without dead ends: 17026 [2019-01-13 04:31:06,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17026 states. [2019-01-13 04:31:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17026 to 12886. [2019-01-13 04:31:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12886 states. [2019-01-13 04:31:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 42751 transitions. [2019-01-13 04:31:07,229 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 42751 transitions. Word has length 57 [2019-01-13 04:31:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:07,230 INFO L480 AbstractCegarLoop]: Abstraction has 12886 states and 42751 transitions. [2019-01-13 04:31:07,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 42751 transitions. [2019-01-13 04:31:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 04:31:07,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:07,239 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] [2019-01-13 04:31:07,239 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:07,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash -852889911, now seen corresponding path program 1 times [2019-01-13 04:31:07,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:07,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:07,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:07,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:07,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:07,816 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 04:31:07,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:07,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:31:07,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:31:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:31:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:07,818 INFO L87 Difference]: Start difference. First operand 12886 states and 42751 transitions. Second operand 6 states. [2019-01-13 04:31:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:08,565 INFO L93 Difference]: Finished difference Result 18606 states and 60861 transitions. [2019-01-13 04:31:08,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 04:31:08,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-01-13 04:31:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:08,612 INFO L225 Difference]: With dead ends: 18606 [2019-01-13 04:31:08,612 INFO L226 Difference]: Without dead ends: 18574 [2019-01-13 04:31:08,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 04:31:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18574 states. [2019-01-13 04:31:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18574 to 14418. [2019-01-13 04:31:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14418 states. [2019-01-13 04:31:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14418 states to 14418 states and 47580 transitions. [2019-01-13 04:31:08,983 INFO L78 Accepts]: Start accepts. Automaton has 14418 states and 47580 transitions. Word has length 57 [2019-01-13 04:31:08,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:08,984 INFO L480 AbstractCegarLoop]: Abstraction has 14418 states and 47580 transitions. [2019-01-13 04:31:08,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:31:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand 14418 states and 47580 transitions. [2019-01-13 04:31:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 04:31:09,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:09,017 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] [2019-01-13 04:31:09,017 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1122563706, now seen corresponding path program 1 times [2019-01-13 04:31:09,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:09,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:09,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:09,177 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 04:31:09,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:09,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:09,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:09,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:09,178 INFO L87 Difference]: Start difference. First operand 14418 states and 47580 transitions. Second operand 5 states. [2019-01-13 04:31:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:09,264 INFO L93 Difference]: Finished difference Result 2834 states and 7608 transitions. [2019-01-13 04:31:09,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 04:31:09,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-01-13 04:31:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:09,270 INFO L225 Difference]: With dead ends: 2834 [2019-01-13 04:31:09,270 INFO L226 Difference]: Without dead ends: 2422 [2019-01-13 04:31:09,271 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 04:31:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-01-13 04:31:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2319. [2019-01-13 04:31:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states. [2019-01-13 04:31:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 6211 transitions. [2019-01-13 04:31:09,310 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 6211 transitions. Word has length 71 [2019-01-13 04:31:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:09,310 INFO L480 AbstractCegarLoop]: Abstraction has 2319 states and 6211 transitions. [2019-01-13 04:31:09,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:31:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 6211 transitions. [2019-01-13 04:31:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:31:09,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:09,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:09,318 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1246078848, now seen corresponding path program 1 times [2019-01-13 04:31:09,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:09,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:09,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:09,512 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 04:31:09,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:09,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:09,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:09,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:09,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:09,514 INFO L87 Difference]: Start difference. First operand 2319 states and 6211 transitions. Second operand 4 states. [2019-01-13 04:31:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:09,918 INFO L93 Difference]: Finished difference Result 3228 states and 8343 transitions. [2019-01-13 04:31:09,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:31:09,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-01-13 04:31:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:09,924 INFO L225 Difference]: With dead ends: 3228 [2019-01-13 04:31:09,924 INFO L226 Difference]: Without dead ends: 3228 [2019-01-13 04:31:09,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2019-01-13 04:31:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2754. [2019-01-13 04:31:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2754 states. [2019-01-13 04:31:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 7218 transitions. [2019-01-13 04:31:09,954 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 7218 transitions. Word has length 90 [2019-01-13 04:31:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:09,954 INFO L480 AbstractCegarLoop]: Abstraction has 2754 states and 7218 transitions. [2019-01-13 04:31:09,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 7218 transitions. [2019-01-13 04:31:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:31:09,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:09,961 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] [2019-01-13 04:31:09,961 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:09,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1865541151, now seen corresponding path program 1 times [2019-01-13 04:31:09,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:09,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:09,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:09,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:09,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:10,178 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 04:31:10,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:10,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:31:10,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:31:10,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:31:10,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:10,180 INFO L87 Difference]: Start difference. First operand 2754 states and 7218 transitions. Second operand 6 states. [2019-01-13 04:31:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:10,407 INFO L93 Difference]: Finished difference Result 2962 states and 7588 transitions. [2019-01-13 04:31:10,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 04:31:10,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-01-13 04:31:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:10,412 INFO L225 Difference]: With dead ends: 2962 [2019-01-13 04:31:10,412 INFO L226 Difference]: Without dead ends: 2962 [2019-01-13 04:31:10,413 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 04:31:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2019-01-13 04:31:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2732. [2019-01-13 04:31:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2019-01-13 04:31:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 7101 transitions. [2019-01-13 04:31:10,446 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 7101 transitions. Word has length 90 [2019-01-13 04:31:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:10,447 INFO L480 AbstractCegarLoop]: Abstraction has 2732 states and 7101 transitions. [2019-01-13 04:31:10,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:31:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 7101 transitions. [2019-01-13 04:31:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:31:10,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:10,453 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] [2019-01-13 04:31:10,453 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:10,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:10,454 INFO L82 PathProgramCache]: Analyzing trace with hash 840847230, now seen corresponding path program 1 times [2019-01-13 04:31:10,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:10,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:10,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:10,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:10,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:10,678 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 04:31:10,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:10,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:10,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:10,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:10,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:10,680 INFO L87 Difference]: Start difference. First operand 2732 states and 7101 transitions. Second operand 5 states. [2019-01-13 04:31:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:10,967 INFO L93 Difference]: Finished difference Result 3624 states and 9172 transitions. [2019-01-13 04:31:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:31:10,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-01-13 04:31:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:10,974 INFO L225 Difference]: With dead ends: 3624 [2019-01-13 04:31:10,974 INFO L226 Difference]: Without dead ends: 3624 [2019-01-13 04:31:10,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:31:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3624 states. [2019-01-13 04:31:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3624 to 2954. [2019-01-13 04:31:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-01-13 04:31:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 7597 transitions. [2019-01-13 04:31:11,014 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 7597 transitions. Word has length 90 [2019-01-13 04:31:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:11,014 INFO L480 AbstractCegarLoop]: Abstraction has 2954 states and 7597 transitions. [2019-01-13 04:31:11,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:31:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 7597 transitions. [2019-01-13 04:31:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:31:11,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:11,020 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] [2019-01-13 04:31:11,021 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:11,021 INFO L82 PathProgramCache]: Analyzing trace with hash -137312489, now seen corresponding path program 2 times [2019-01-13 04:31:11,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:11,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:11,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:11,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:11,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:11,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:11,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:11,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:11,185 INFO L87 Difference]: Start difference. First operand 2954 states and 7597 transitions. Second operand 4 states. [2019-01-13 04:31:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:11,473 INFO L93 Difference]: Finished difference Result 4362 states and 11252 transitions. [2019-01-13 04:31:11,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:31:11,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-01-13 04:31:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:11,480 INFO L225 Difference]: With dead ends: 4362 [2019-01-13 04:31:11,480 INFO L226 Difference]: Without dead ends: 4344 [2019-01-13 04:31:11,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4344 states. [2019-01-13 04:31:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4344 to 2996. [2019-01-13 04:31:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2996 states. [2019-01-13 04:31:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 7680 transitions. [2019-01-13 04:31:11,527 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 7680 transitions. Word has length 90 [2019-01-13 04:31:11,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:11,528 INFO L480 AbstractCegarLoop]: Abstraction has 2996 states and 7680 transitions. [2019-01-13 04:31:11,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:11,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 7680 transitions. [2019-01-13 04:31:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:31:11,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:11,534 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] [2019-01-13 04:31:11,534 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash 100591209, now seen corresponding path program 1 times [2019-01-13 04:31:11,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:11,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:11,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 04:31:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:11,659 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 04:31:11,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:11,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 04:31:11,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 04:31:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 04:31:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:31:11,661 INFO L87 Difference]: Start difference. First operand 2996 states and 7680 transitions. Second operand 3 states. [2019-01-13 04:31:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:11,906 INFO L93 Difference]: Finished difference Result 3048 states and 7779 transitions. [2019-01-13 04:31:11,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 04:31:11,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-01-13 04:31:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:11,912 INFO L225 Difference]: With dead ends: 3048 [2019-01-13 04:31:11,912 INFO L226 Difference]: Without dead ends: 3048 [2019-01-13 04:31:11,913 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 04:31:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2019-01-13 04:31:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 3018. [2019-01-13 04:31:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-01-13 04:31:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 7714 transitions. [2019-01-13 04:31:12,280 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 7714 transitions. Word has length 90 [2019-01-13 04:31:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:12,281 INFO L480 AbstractCegarLoop]: Abstraction has 3018 states and 7714 transitions. [2019-01-13 04:31:12,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 04:31:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 7714 transitions. [2019-01-13 04:31:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:12,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:12,286 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] [2019-01-13 04:31:12,287 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:12,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1619414373, now seen corresponding path program 1 times [2019-01-13 04:31:12,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:12,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:12,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:12,838 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 04:31:12,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:12,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 04:31:12,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 04:31:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 04:31:12,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-13 04:31:12,840 INFO L87 Difference]: Start difference. First operand 3018 states and 7714 transitions. Second operand 9 states. [2019-01-13 04:31:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:14,360 INFO L93 Difference]: Finished difference Result 7262 states and 18103 transitions. [2019-01-13 04:31:14,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-13 04:31:14,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-01-13 04:31:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:14,371 INFO L225 Difference]: With dead ends: 7262 [2019-01-13 04:31:14,371 INFO L226 Difference]: Without dead ends: 7198 [2019-01-13 04:31:14,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-01-13 04:31:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7198 states. [2019-01-13 04:31:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7198 to 4870. [2019-01-13 04:31:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4870 states. [2019-01-13 04:31:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 12383 transitions. [2019-01-13 04:31:14,445 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 12383 transitions. Word has length 92 [2019-01-13 04:31:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:14,446 INFO L480 AbstractCegarLoop]: Abstraction has 4870 states and 12383 transitions. [2019-01-13 04:31:14,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 04:31:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 12383 transitions. [2019-01-13 04:31:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:14,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:14,455 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] [2019-01-13 04:31:14,456 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1430788442, now seen corresponding path program 1 times [2019-01-13 04:31:14,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:14,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:14,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:14,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:14,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:14,783 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 04:31:14,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:14,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:31:14,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:31:14,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:31:14,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:31:14,784 INFO L87 Difference]: Start difference. First operand 4870 states and 12383 transitions. Second operand 7 states. [2019-01-13 04:31:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:15,545 INFO L93 Difference]: Finished difference Result 7871 states and 19820 transitions. [2019-01-13 04:31:15,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 04:31:15,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 04:31:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:15,557 INFO L225 Difference]: With dead ends: 7871 [2019-01-13 04:31:15,557 INFO L226 Difference]: Without dead ends: 7620 [2019-01-13 04:31:15,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:31:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2019-01-13 04:31:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 4956. [2019-01-13 04:31:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4956 states. [2019-01-13 04:31:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 12473 transitions. [2019-01-13 04:31:15,624 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 12473 transitions. Word has length 92 [2019-01-13 04:31:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:15,624 INFO L480 AbstractCegarLoop]: Abstraction has 4956 states and 12473 transitions. [2019-01-13 04:31:15,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:31:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 12473 transitions. [2019-01-13 04:31:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:15,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:15,632 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] [2019-01-13 04:31:15,632 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:15,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1693857927, now seen corresponding path program 1 times [2019-01-13 04:31:15,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:15,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:15,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:15,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:15,845 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 04:31:15,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:15,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:31:15,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:31:15,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:31:15,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:15,846 INFO L87 Difference]: Start difference. First operand 4956 states and 12473 transitions. Second operand 6 states. [2019-01-13 04:31:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:16,064 INFO L93 Difference]: Finished difference Result 3745 states and 9545 transitions. [2019-01-13 04:31:16,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:31:16,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 04:31:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:16,070 INFO L225 Difference]: With dead ends: 3745 [2019-01-13 04:31:16,071 INFO L226 Difference]: Without dead ends: 3745 [2019-01-13 04:31:16,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:31:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-01-13 04:31:16,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3533. [2019-01-13 04:31:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3533 states. [2019-01-13 04:31:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 3533 states and 9082 transitions. [2019-01-13 04:31:16,110 INFO L78 Accepts]: Start accepts. Automaton has 3533 states and 9082 transitions. Word has length 92 [2019-01-13 04:31:16,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:16,110 INFO L480 AbstractCegarLoop]: Abstraction has 3533 states and 9082 transitions. [2019-01-13 04:31:16,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:31:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3533 states and 9082 transitions. [2019-01-13 04:31:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:16,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:16,116 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] [2019-01-13 04:31:16,116 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash -638635949, now seen corresponding path program 1 times [2019-01-13 04:31:16,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:16,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:16,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:16,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:16,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:16,347 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 04:31:16,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:16,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 04:31:16,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 04:31:16,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 04:31:16,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:31:16,348 INFO L87 Difference]: Start difference. First operand 3533 states and 9082 transitions. Second operand 8 states. [2019-01-13 04:31:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:17,114 INFO L93 Difference]: Finished difference Result 4558 states and 11583 transitions. [2019-01-13 04:31:17,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 04:31:17,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-01-13 04:31:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:17,122 INFO L225 Difference]: With dead ends: 4558 [2019-01-13 04:31:17,122 INFO L226 Difference]: Without dead ends: 4526 [2019-01-13 04:31:17,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-13 04:31:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2019-01-13 04:31:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 3860. [2019-01-13 04:31:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3860 states. [2019-01-13 04:31:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3860 states to 3860 states and 9869 transitions. [2019-01-13 04:31:17,171 INFO L78 Accepts]: Start accepts. Automaton has 3860 states and 9869 transitions. Word has length 92 [2019-01-13 04:31:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:17,171 INFO L480 AbstractCegarLoop]: Abstraction has 3860 states and 9869 transitions. [2019-01-13 04:31:17,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 04:31:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3860 states and 9869 transitions. [2019-01-13 04:31:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:17,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:17,177 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] [2019-01-13 04:31:17,178 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash 322978068, now seen corresponding path program 1 times [2019-01-13 04:31:17,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:17,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:17,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:17,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:17,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:17,783 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 04:31:17,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:17,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:31:17,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:31:17,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:31:17,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:31:17,785 INFO L87 Difference]: Start difference. First operand 3860 states and 9869 transitions. Second operand 7 states. [2019-01-13 04:31:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:18,257 INFO L93 Difference]: Finished difference Result 5143 states and 13041 transitions. [2019-01-13 04:31:18,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:31:18,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 04:31:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:18,265 INFO L225 Difference]: With dead ends: 5143 [2019-01-13 04:31:18,265 INFO L226 Difference]: Without dead ends: 5143 [2019-01-13 04:31:18,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:31:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5143 states. [2019-01-13 04:31:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5143 to 4228. [2019-01-13 04:31:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4228 states. [2019-01-13 04:31:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4228 states to 4228 states and 10855 transitions. [2019-01-13 04:31:18,313 INFO L78 Accepts]: Start accepts. Automaton has 4228 states and 10855 transitions. Word has length 92 [2019-01-13 04:31:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:18,313 INFO L480 AbstractCegarLoop]: Abstraction has 4228 states and 10855 transitions. [2019-01-13 04:31:18,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:31:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 4228 states and 10855 transitions. [2019-01-13 04:31:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:18,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:18,322 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] [2019-01-13 04:31:18,322 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1567742549, now seen corresponding path program 1 times [2019-01-13 04:31:18,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:18,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:18,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:18,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:18,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:18,515 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 04:31:18,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:18,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:18,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:18,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:18,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:18,517 INFO L87 Difference]: Start difference. First operand 4228 states and 10855 transitions. Second operand 5 states. [2019-01-13 04:31:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:18,567 INFO L93 Difference]: Finished difference Result 6204 states and 16156 transitions. [2019-01-13 04:31:18,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:31:18,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-01-13 04:31:18,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:18,581 INFO L225 Difference]: With dead ends: 6204 [2019-01-13 04:31:18,581 INFO L226 Difference]: Without dead ends: 6204 [2019-01-13 04:31:18,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6204 states. [2019-01-13 04:31:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6204 to 3860. [2019-01-13 04:31:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3860 states. [2019-01-13 04:31:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3860 states to 3860 states and 9782 transitions. [2019-01-13 04:31:18,654 INFO L78 Accepts]: Start accepts. Automaton has 3860 states and 9782 transitions. Word has length 92 [2019-01-13 04:31:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:18,655 INFO L480 AbstractCegarLoop]: Abstraction has 3860 states and 9782 transitions. [2019-01-13 04:31:18,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:31:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3860 states and 9782 transitions. [2019-01-13 04:31:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:18,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:18,663 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] [2019-01-13 04:31:18,663 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:18,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2048458965, now seen corresponding path program 1 times [2019-01-13 04:31:18,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:18,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:18,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:18,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:18,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:18,945 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 04:31:18,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:18,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:31:18,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:31:18,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:31:18,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:18,946 INFO L87 Difference]: Start difference. First operand 3860 states and 9782 transitions. Second operand 6 states. [2019-01-13 04:31:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:19,184 INFO L93 Difference]: Finished difference Result 3428 states and 8462 transitions. [2019-01-13 04:31:19,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:31:19,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 04:31:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:19,189 INFO L225 Difference]: With dead ends: 3428 [2019-01-13 04:31:19,189 INFO L226 Difference]: Without dead ends: 3428 [2019-01-13 04:31:19,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:31:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2019-01-13 04:31:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 2619. [2019-01-13 04:31:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2019-01-13 04:31:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 6636 transitions. [2019-01-13 04:31:19,219 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 6636 transitions. Word has length 92 [2019-01-13 04:31:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:19,220 INFO L480 AbstractCegarLoop]: Abstraction has 2619 states and 6636 transitions. [2019-01-13 04:31:19,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:31:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 6636 transitions. [2019-01-13 04:31:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:31:19,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:19,224 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] [2019-01-13 04:31:19,225 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:19,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:19,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1613356635, now seen corresponding path program 1 times [2019-01-13 04:31:19,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:19,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:19,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:19,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:19,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:19,610 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 04:31:19,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:19,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:19,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:19,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:19,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:19,612 INFO L87 Difference]: Start difference. First operand 2619 states and 6636 transitions. Second operand 5 states. [2019-01-13 04:31:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:19,828 INFO L93 Difference]: Finished difference Result 2971 states and 7500 transitions. [2019-01-13 04:31:19,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:31:19,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 04:31:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:19,834 INFO L225 Difference]: With dead ends: 2971 [2019-01-13 04:31:19,835 INFO L226 Difference]: Without dead ends: 2939 [2019-01-13 04:31:19,835 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 04:31:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2019-01-13 04:31:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2667. [2019-01-13 04:31:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2019-01-13 04:31:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 6740 transitions. [2019-01-13 04:31:19,866 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 6740 transitions. Word has length 94 [2019-01-13 04:31:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:19,866 INFO L480 AbstractCegarLoop]: Abstraction has 2667 states and 6740 transitions. [2019-01-13 04:31:19,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:31:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 6740 transitions. [2019-01-13 04:31:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:31:19,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:19,872 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] [2019-01-13 04:31:19,872 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:19,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash -368592154, now seen corresponding path program 1 times [2019-01-13 04:31:19,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:19,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:19,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:19,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:19,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:20,155 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 04:31:20,343 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 04:31:20,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:20,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 04:31:20,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 04:31:20,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 04:31:20,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:31:20,345 INFO L87 Difference]: Start difference. First operand 2667 states and 6740 transitions. Second operand 12 states. [2019-01-13 04:31:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:21,223 INFO L93 Difference]: Finished difference Result 4454 states and 11424 transitions. [2019-01-13 04:31:21,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 04:31:21,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-01-13 04:31:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:21,230 INFO L225 Difference]: With dead ends: 4454 [2019-01-13 04:31:21,231 INFO L226 Difference]: Without dead ends: 3478 [2019-01-13 04:31:21,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-13 04:31:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2019-01-13 04:31:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 3198. [2019-01-13 04:31:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2019-01-13 04:31:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 7987 transitions. [2019-01-13 04:31:21,279 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 7987 transitions. Word has length 94 [2019-01-13 04:31:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:21,279 INFO L480 AbstractCegarLoop]: Abstraction has 3198 states and 7987 transitions. [2019-01-13 04:31:21,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 04:31:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 7987 transitions. [2019-01-13 04:31:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:31:21,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:21,286 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] [2019-01-13 04:31:21,287 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:21,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:21,287 INFO L82 PathProgramCache]: Analyzing trace with hash -822908468, now seen corresponding path program 2 times [2019-01-13 04:31:21,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:21,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:21,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:21,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:21,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:31:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:31:21,396 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 04:31:21,668 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 04:31:21,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 04:31:21 BasicIcfg [2019-01-13 04:31:21,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 04:31:21,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 04:31:21,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 04:31:21,675 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 04:31:21,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:30:54" (3/4) ... [2019-01-13 04:31:21,680 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 04:31:21,917 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 04:31:21,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 04:31:21,924 INFO L168 Benchmark]: Toolchain (without parser) took 29804.45 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 952.7 MB in the beginning and 647.6 MB in the end (delta: 305.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-13 04:31:21,925 INFO L168 Benchmark]: CDTParser took 0.18 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 04:31:21,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-13 04:31:21,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.80 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-13 04:31:21,926 INFO L168 Benchmark]: Boogie Preprocessor took 40.31 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 04:31:21,926 INFO L168 Benchmark]: RCFGBuilder took 1169.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2019-01-13 04:31:21,927 INFO L168 Benchmark]: TraceAbstraction took 27392.82 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 699.5 MB in the end (delta: 345.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-13 04:31:21,927 INFO L168 Benchmark]: Witness Printer took 248.97 ms. Allocated memory is still 2.4 GB. Free memory was 699.5 MB in the beginning and 647.6 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-01-13 04:31:21,933 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.18 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 868.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.80 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.31 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 1169.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27392.82 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 699.5 MB in the end (delta: 345.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 248.97 ms. Allocated memory is still 2.4 GB. Free memory was 699.5 MB in the beginning and 647.6 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2013; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 2 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] -1 pthread_t t2014; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] FCALL, FORK -1 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 __unbuffered_p1_EAX = x [L730] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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=2] [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L715] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L717] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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] [L735] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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] [L736] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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] [L737] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -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) [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -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 [L767] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L768] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -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 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 y$flush_delayed = weak$$choice2 [L774] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -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) [L776] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -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)) [L777] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -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)) [L778] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -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)) [L779] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -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)) [L780] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -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)) [L781] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -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)) [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y = y$flush_delayed ? y$mem_tmp : y [L784] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 27.2s OverallTime, 21 OverallIterations, 1 TraceHistogramMax, 13.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4555 SDtfs, 4489 SDslu, 11529 SDs, 0 SdLazy, 4517 SolverSat, 307 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 69 SyntacticMatches, 12 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37149occurred in iteration=2, 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: 5.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 66135 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1680 NumberOfCodeBlocks, 1680 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1566 ConstructedInterpolants, 0 QuantifiedInterpolants, 349800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...