./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2704334a5f5c65f6107547c60b5bde5e46cdf374 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 05:27:25,144 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:27:25,146 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:27:25,158 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:27:25,159 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:27:25,160 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:27:25,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:27:25,164 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:27:25,166 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:27:25,167 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:27:25,168 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:27:25,168 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:27:25,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:27:25,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:27:25,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:27:25,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:27:25,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:27:25,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:27:25,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:27:25,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:27:25,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:27:25,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:27:25,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:27:25,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:27:25,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:27:25,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:27:25,189 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:27:25,190 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:27:25,191 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:27:25,192 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:27:25,192 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:27:25,193 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:27:25,193 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:27:25,193 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:27:25,195 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:27:25,196 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:27:25,196 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:27:25,212 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:27:25,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:27:25,214 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:27:25,214 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:27:25,215 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:27:25,215 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:27:25,215 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:27:25,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:27:25,215 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:27:25,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:27:25,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:27:25,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:27:25,216 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:27:25,216 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:27:25,216 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:27:25,217 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:27:25,218 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:27:25,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:27:25,219 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:27:25,219 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:27:25,219 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:27:25,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:27:25,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:27:25,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:27:25,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:27:25,221 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:27:25,221 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:27:25,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:27:25,221 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 -> 2704334a5f5c65f6107547c60b5bde5e46cdf374 [2019-01-13 05:27:25,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:27:25,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:27:25,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:27:25,287 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:27:25,287 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:27:25,288 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i [2019-01-13 05:27:25,349 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfec52609/b7cd2a5604b043de9fb29c8f40594884/FLAG762e0a744 [2019-01-13 05:27:25,870 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:27:25,871 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i [2019-01-13 05:27:25,900 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfec52609/b7cd2a5604b043de9fb29c8f40594884/FLAG762e0a744 [2019-01-13 05:27:26,165 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfec52609/b7cd2a5604b043de9fb29c8f40594884 [2019-01-13 05:27:26,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:27:26,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:27:26,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:27:26,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:27:26,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:27:26,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:27:26" (1/1) ... [2019-01-13 05:27:26,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4370fc43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:26, skipping insertion in model container [2019-01-13 05:27:26,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:27:26" (1/1) ... [2019-01-13 05:27:26,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:27:26,257 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:27:26,795 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:27:26,815 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:27:27,036 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:27:27,151 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:27:27,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27 WrapperNode [2019-01-13 05:27:27,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:27:27,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:27:27,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:27:27,153 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:27:27,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27" (1/1) ... [2019-01-13 05:27:27,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27" (1/1) ... [2019-01-13 05:27:27,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:27:27,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:27:27,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:27:27,234 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:27:27,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27" (1/1) ... [2019-01-13 05:27:27,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27" (1/1) ... [2019-01-13 05:27:27,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27" (1/1) ... [2019-01-13 05:27:27,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27" (1/1) ... [2019-01-13 05:27:27,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27" (1/1) ... [2019-01-13 05:27:27,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27" (1/1) ... [2019-01-13 05:27:27,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27" (1/1) ... [2019-01-13 05:27:27,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:27:27,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:27:27,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:27:27,276 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:27:27,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:27:27,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:27:27,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 05:27:27,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:27:27,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:27:27,366 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 05:27:27,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 05:27:27,366 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 05:27:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 05:27:27,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 05:27:27,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:27:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:27:27,371 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 05:27:28,708 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:27:28,708 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 05:27:28,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:27:28 BoogieIcfgContainer [2019-01-13 05:27:28,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:27:28,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:27:28,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:27:28,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:27:28,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:27:26" (1/3) ... [2019-01-13 05:27:28,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5857e75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:27:28, skipping insertion in model container [2019-01-13 05:27:28,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:27" (2/3) ... [2019-01-13 05:27:28,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5857e75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:27:28, skipping insertion in model container [2019-01-13 05:27:28,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:27:28" (3/3) ... [2019-01-13 05:27:28,720 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt_false-unreach-call.i [2019-01-13 05:27:28,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,763 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,763 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,769 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,771 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,771 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,771 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,772 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,772 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:28,793 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:27:28,794 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:27:28,803 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 05:27:28,819 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 05:27:28,847 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:27:28,848 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:27:28,848 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:27:28,848 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:27:28,849 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:27:28,849 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:27:28,849 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:27:28,849 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:27:28,849 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:27:28,865 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2019-01-13 05:27:30,537 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25086 states. [2019-01-13 05:27:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 25086 states. [2019-01-13 05:27:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 05:27:30,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:30,550 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] [2019-01-13 05:27:30,553 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:30,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1594278667, now seen corresponding path program 1 times [2019-01-13 05:27:30,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:30,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:30,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:30,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:30,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:30,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:30,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:30,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:30,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:30,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:30,908 INFO L87 Difference]: Start difference. First operand 25086 states. Second operand 4 states. [2019-01-13 05:27:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:31,979 INFO L93 Difference]: Finished difference Result 45386 states and 177624 transitions. [2019-01-13 05:27:31,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:27:31,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-13 05:27:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:32,308 INFO L225 Difference]: With dead ends: 45386 [2019-01-13 05:27:32,309 INFO L226 Difference]: Without dead ends: 40626 [2019-01-13 05:27:32,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40626 states. [2019-01-13 05:27:33,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40626 to 23660. [2019-01-13 05:27:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23660 states. [2019-01-13 05:27:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23660 states to 23660 states and 92541 transitions. [2019-01-13 05:27:34,130 INFO L78 Accepts]: Start accepts. Automaton has 23660 states and 92541 transitions. Word has length 35 [2019-01-13 05:27:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:34,131 INFO L480 AbstractCegarLoop]: Abstraction has 23660 states and 92541 transitions. [2019-01-13 05:27:34,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 23660 states and 92541 transitions. [2019-01-13 05:27:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-13 05:27:34,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:34,144 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] [2019-01-13 05:27:34,149 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash 435483284, now seen corresponding path program 1 times [2019-01-13 05:27:34,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:34,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:34,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:34,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:34,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:34,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:34,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:34,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:34,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:34,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:34,310 INFO L87 Difference]: Start difference. First operand 23660 states and 92541 transitions. Second operand 5 states. [2019-01-13 05:27:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:37,093 INFO L93 Difference]: Finished difference Result 64828 states and 241367 transitions. [2019-01-13 05:27:37,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:27:37,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-01-13 05:27:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:37,595 INFO L225 Difference]: With dead ends: 64828 [2019-01-13 05:27:37,596 INFO L226 Difference]: Without dead ends: 64668 [2019-01-13 05:27:37,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:27:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64668 states. [2019-01-13 05:27:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64668 to 37140. [2019-01-13 05:27:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37140 states. [2019-01-13 05:27:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37140 states to 37140 states and 138282 transitions. [2019-01-13 05:27:39,372 INFO L78 Accepts]: Start accepts. Automaton has 37140 states and 138282 transitions. Word has length 42 [2019-01-13 05:27:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:39,373 INFO L480 AbstractCegarLoop]: Abstraction has 37140 states and 138282 transitions. [2019-01-13 05:27:39,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 37140 states and 138282 transitions. [2019-01-13 05:27:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 05:27:39,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:39,378 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 05:27:39,378 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:39,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash -888651829, now seen corresponding path program 1 times [2019-01-13 05:27:39,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:39,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:39,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:39,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:39,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:39,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:39,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:39,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:39,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:39,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:39,533 INFO L87 Difference]: Start difference. First operand 37140 states and 138282 transitions. Second operand 4 states. [2019-01-13 05:27:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:39,724 INFO L93 Difference]: Finished difference Result 12362 states and 41175 transitions. [2019-01-13 05:27:39,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:39,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-01-13 05:27:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:39,757 INFO L225 Difference]: With dead ends: 12362 [2019-01-13 05:27:39,757 INFO L226 Difference]: Without dead ends: 11841 [2019-01-13 05:27:39,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2019-01-13 05:27:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 11841. [2019-01-13 05:27:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11841 states. [2019-01-13 05:27:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11841 states to 11841 states and 39620 transitions. [2019-01-13 05:27:40,047 INFO L78 Accepts]: Start accepts. Automaton has 11841 states and 39620 transitions. Word has length 43 [2019-01-13 05:27:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:40,047 INFO L480 AbstractCegarLoop]: Abstraction has 11841 states and 39620 transitions. [2019-01-13 05:27:40,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 11841 states and 39620 transitions. [2019-01-13 05:27:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:27:40,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:40,056 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] [2019-01-13 05:27:40,056 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1477280175, now seen corresponding path program 1 times [2019-01-13 05:27:40,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:40,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:40,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:40,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:40,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:40,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:40,337 INFO L87 Difference]: Start difference. First operand 11841 states and 39620 transitions. Second operand 4 states. [2019-01-13 05:27:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:40,874 INFO L93 Difference]: Finished difference Result 17017 states and 55691 transitions. [2019-01-13 05:27:40,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:40,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-13 05:27:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:40,907 INFO L225 Difference]: With dead ends: 17017 [2019-01-13 05:27:40,907 INFO L226 Difference]: Without dead ends: 17017 [2019-01-13 05:27:40,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17017 states. [2019-01-13 05:27:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17017 to 12877. [2019-01-13 05:27:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12877 states. [2019-01-13 05:27:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12877 states to 12877 states and 42718 transitions. [2019-01-13 05:27:41,190 INFO L78 Accepts]: Start accepts. Automaton has 12877 states and 42718 transitions. Word has length 56 [2019-01-13 05:27:41,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:41,191 INFO L480 AbstractCegarLoop]: Abstraction has 12877 states and 42718 transitions. [2019-01-13 05:27:41,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 12877 states and 42718 transitions. [2019-01-13 05:27:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:27:41,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:41,202 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] [2019-01-13 05:27:41,203 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:41,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:41,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1182034221, now seen corresponding path program 1 times [2019-01-13 05:27:41,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:41,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:41,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:41,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:41,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:41,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:41,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:41,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:41,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:41,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:41,398 INFO L87 Difference]: Start difference. First operand 12877 states and 42718 transitions. Second operand 5 states. [2019-01-13 05:27:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:41,466 INFO L93 Difference]: Finished difference Result 2521 states and 6735 transitions. [2019-01-13 05:27:41,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:27:41,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-01-13 05:27:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:41,470 INFO L225 Difference]: With dead ends: 2521 [2019-01-13 05:27:41,471 INFO L226 Difference]: Without dead ends: 2109 [2019-01-13 05:27:41,471 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 05:27:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2019-01-13 05:27:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2006. [2019-01-13 05:27:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-01-13 05:27:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 5338 transitions. [2019-01-13 05:27:41,502 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 5338 transitions. Word has length 56 [2019-01-13 05:27:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:41,503 INFO L480 AbstractCegarLoop]: Abstraction has 2006 states and 5338 transitions. [2019-01-13 05:27:41,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 5338 transitions. [2019-01-13 05:27:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:27:41,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:41,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:41,511 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:41,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:41,511 INFO L82 PathProgramCache]: Analyzing trace with hash 318545353, now seen corresponding path program 1 times [2019-01-13 05:27:41,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:41,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:41,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:41,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:41,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:41,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:41,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:27:41,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:27:41,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:27:41,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:27:41,680 INFO L87 Difference]: Start difference. First operand 2006 states and 5338 transitions. Second operand 3 states. [2019-01-13 05:27:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:42,155 INFO L93 Difference]: Finished difference Result 2090 states and 5527 transitions. [2019-01-13 05:27:42,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:27:42,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-13 05:27:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:42,162 INFO L225 Difference]: With dead ends: 2090 [2019-01-13 05:27:42,163 INFO L226 Difference]: Without dead ends: 2090 [2019-01-13 05:27:42,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:27:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-01-13 05:27:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2044. [2019-01-13 05:27:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-01-13 05:27:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 5424 transitions. [2019-01-13 05:27:42,192 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 5424 transitions. Word has length 89 [2019-01-13 05:27:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:42,192 INFO L480 AbstractCegarLoop]: Abstraction has 2044 states and 5424 transitions. [2019-01-13 05:27:42,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:27:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 5424 transitions. [2019-01-13 05:27:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:27:42,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:42,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:42,200 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:42,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1894805112, now seen corresponding path program 1 times [2019-01-13 05:27:42,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:42,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:42,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:42,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:42,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:42,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:42,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:42,321 INFO L87 Difference]: Start difference. First operand 2044 states and 5424 transitions. Second operand 4 states. [2019-01-13 05:27:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:42,726 INFO L93 Difference]: Finished difference Result 3189 states and 8505 transitions. [2019-01-13 05:27:42,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:27:42,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-13 05:27:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:42,733 INFO L225 Difference]: With dead ends: 3189 [2019-01-13 05:27:42,733 INFO L226 Difference]: Without dead ends: 3189 [2019-01-13 05:27:42,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-01-13 05:27:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2084. [2019-01-13 05:27:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-01-13 05:27:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 5514 transitions. [2019-01-13 05:27:42,774 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 5514 transitions. Word has length 89 [2019-01-13 05:27:42,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:42,775 INFO L480 AbstractCegarLoop]: Abstraction has 2084 states and 5514 transitions. [2019-01-13 05:27:42,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 5514 transitions. [2019-01-13 05:27:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:27:43,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:43,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:43,015 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1714371072, now seen corresponding path program 2 times [2019-01-13 05:27:43,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:43,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:43,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:43,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:43,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:43,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:43,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:43,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:43,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:43,128 INFO L87 Difference]: Start difference. First operand 2084 states and 5514 transitions. Second operand 5 states. [2019-01-13 05:27:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:43,385 INFO L93 Difference]: Finished difference Result 2972 states and 7652 transitions. [2019-01-13 05:27:43,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:43,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-13 05:27:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:43,391 INFO L225 Difference]: With dead ends: 2972 [2019-01-13 05:27:43,391 INFO L226 Difference]: Without dead ends: 2972 [2019-01-13 05:27:43,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2019-01-13 05:27:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2208. [2019-01-13 05:27:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2019-01-13 05:27:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 5829 transitions. [2019-01-13 05:27:43,430 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 5829 transitions. Word has length 89 [2019-01-13 05:27:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:43,430 INFO L480 AbstractCegarLoop]: Abstraction has 2208 states and 5829 transitions. [2019-01-13 05:27:43,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 5829 transitions. [2019-01-13 05:27:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:27:43,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:43,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:43,439 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:43,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:43,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1904549666, now seen corresponding path program 3 times [2019-01-13 05:27:43,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:43,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:43,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:43,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:27:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:43,609 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 05:27:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:43,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:43,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:43,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:43,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:43,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:43,687 INFO L87 Difference]: Start difference. First operand 2208 states and 5829 transitions. Second operand 7 states. [2019-01-13 05:27:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:44,709 INFO L93 Difference]: Finished difference Result 2942 states and 7549 transitions. [2019-01-13 05:27:44,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:27:44,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-01-13 05:27:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:44,715 INFO L225 Difference]: With dead ends: 2942 [2019-01-13 05:27:44,715 INFO L226 Difference]: Without dead ends: 2896 [2019-01-13 05:27:44,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:27:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2019-01-13 05:27:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2389. [2019-01-13 05:27:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2019-01-13 05:27:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 6245 transitions. [2019-01-13 05:27:44,744 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 6245 transitions. Word has length 89 [2019-01-13 05:27:44,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:44,745 INFO L480 AbstractCegarLoop]: Abstraction has 2389 states and 6245 transitions. [2019-01-13 05:27:44,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:44,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 6245 transitions. [2019-01-13 05:27:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:27:44,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:44,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:44,751 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:44,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:44,751 INFO L82 PathProgramCache]: Analyzing trace with hash 66389791, now seen corresponding path program 1 times [2019-01-13 05:27:44,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:44,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:44,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:44,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:27:44,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:44,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:44,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:44,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:44,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:44,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:44,888 INFO L87 Difference]: Start difference. First operand 2389 states and 6245 transitions. Second operand 5 states. [2019-01-13 05:27:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:45,167 INFO L93 Difference]: Finished difference Result 3274 states and 8297 transitions. [2019-01-13 05:27:45,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:27:45,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-13 05:27:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:45,173 INFO L225 Difference]: With dead ends: 3274 [2019-01-13 05:27:45,173 INFO L226 Difference]: Without dead ends: 3210 [2019-01-13 05:27:45,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:27:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2019-01-13 05:27:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 2424. [2019-01-13 05:27:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2019-01-13 05:27:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 6308 transitions. [2019-01-13 05:27:45,218 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 6308 transitions. Word has length 89 [2019-01-13 05:27:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:45,218 INFO L480 AbstractCegarLoop]: Abstraction has 2424 states and 6308 transitions. [2019-01-13 05:27:45,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 6308 transitions. [2019-01-13 05:27:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:45,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:45,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:45,226 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:45,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1433627711, now seen corresponding path program 1 times [2019-01-13 05:27:45,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:45,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:45,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:45,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:45,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:45,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:45,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:45,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:45,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:45,394 INFO L87 Difference]: Start difference. First operand 2424 states and 6308 transitions. Second operand 4 states. [2019-01-13 05:27:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:46,080 INFO L93 Difference]: Finished difference Result 5336 states and 14263 transitions. [2019-01-13 05:27:46,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:46,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 05:27:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:46,092 INFO L225 Difference]: With dead ends: 5336 [2019-01-13 05:27:46,093 INFO L226 Difference]: Without dead ends: 5287 [2019-01-13 05:27:46,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5287 states. [2019-01-13 05:27:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5287 to 2195. [2019-01-13 05:27:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-01-13 05:27:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 5666 transitions. [2019-01-13 05:27:46,134 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 5666 transitions. Word has length 91 [2019-01-13 05:27:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:46,134 INFO L480 AbstractCegarLoop]: Abstraction has 2195 states and 5666 transitions. [2019-01-13 05:27:46,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:46,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 5666 transitions. [2019-01-13 05:27:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:46,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:46,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:46,138 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:46,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:46,139 INFO L82 PathProgramCache]: Analyzing trace with hash 510944128, now seen corresponding path program 1 times [2019-01-13 05:27:46,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:46,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:46,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:46,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:46,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:46,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:46,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:46,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:46,490 INFO L87 Difference]: Start difference. First operand 2195 states and 5666 transitions. Second operand 6 states. [2019-01-13 05:27:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:46,864 INFO L93 Difference]: Finished difference Result 2441 states and 6198 transitions. [2019-01-13 05:27:46,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:27:46,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:27:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:46,869 INFO L225 Difference]: With dead ends: 2441 [2019-01-13 05:27:46,869 INFO L226 Difference]: Without dead ends: 2441 [2019-01-13 05:27:46,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:27:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2019-01-13 05:27:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2086. [2019-01-13 05:27:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states. [2019-01-13 05:27:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 5380 transitions. [2019-01-13 05:27:46,900 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 5380 transitions. Word has length 91 [2019-01-13 05:27:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:46,900 INFO L480 AbstractCegarLoop]: Abstraction has 2086 states and 5380 transitions. [2019-01-13 05:27:46,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 5380 transitions. [2019-01-13 05:27:46,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:46,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:46,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:46,906 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:46,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1275259263, now seen corresponding path program 1 times [2019-01-13 05:27:46,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:46,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:46,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:46,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:46,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:47,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:47,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:47,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:47,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:47,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:47,161 INFO L87 Difference]: Start difference. First operand 2086 states and 5380 transitions. Second operand 4 states. [2019-01-13 05:27:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:47,402 INFO L93 Difference]: Finished difference Result 2422 states and 6300 transitions. [2019-01-13 05:27:47,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:27:47,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 05:27:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:47,409 INFO L225 Difference]: With dead ends: 2422 [2019-01-13 05:27:47,409 INFO L226 Difference]: Without dead ends: 2422 [2019-01-13 05:27:47,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 05:27:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-01-13 05:27:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2390. [2019-01-13 05:27:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-01-13 05:27:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 6220 transitions. [2019-01-13 05:27:47,436 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 6220 transitions. Word has length 91 [2019-01-13 05:27:47,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:47,436 INFO L480 AbstractCegarLoop]: Abstraction has 2390 states and 6220 transitions. [2019-01-13 05:27:47,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 6220 transitions. [2019-01-13 05:27:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:47,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:47,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:47,441 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:47,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:47,441 INFO L82 PathProgramCache]: Analyzing trace with hash 942498690, now seen corresponding path program 1 times [2019-01-13 05:27:47,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:47,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:47,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:47,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:47,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:47,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:47,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:47,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:47,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:47,640 INFO L87 Difference]: Start difference. First operand 2390 states and 6220 transitions. Second operand 7 states. [2019-01-13 05:27:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:48,174 INFO L93 Difference]: Finished difference Result 3910 states and 9984 transitions. [2019-01-13 05:27:48,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 05:27:48,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-13 05:27:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:48,181 INFO L225 Difference]: With dead ends: 3910 [2019-01-13 05:27:48,182 INFO L226 Difference]: Without dead ends: 3878 [2019-01-13 05:27:48,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:27:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2019-01-13 05:27:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 3254. [2019-01-13 05:27:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2019-01-13 05:27:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 8389 transitions. [2019-01-13 05:27:48,226 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 8389 transitions. Word has length 91 [2019-01-13 05:27:48,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:48,226 INFO L480 AbstractCegarLoop]: Abstraction has 3254 states and 8389 transitions. [2019-01-13 05:27:48,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 8389 transitions. [2019-01-13 05:27:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:48,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:48,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:48,233 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:48,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:48,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1904112707, now seen corresponding path program 1 times [2019-01-13 05:27:48,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:48,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:48,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:48,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:48,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:48,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:48,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:48,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:48,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:48,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:48,495 INFO L87 Difference]: Start difference. First operand 3254 states and 8389 transitions. Second operand 7 states. [2019-01-13 05:27:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:49,011 INFO L93 Difference]: Finished difference Result 4497 states and 11477 transitions. [2019-01-13 05:27:49,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:27:49,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-13 05:27:49,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:49,019 INFO L225 Difference]: With dead ends: 4497 [2019-01-13 05:27:49,020 INFO L226 Difference]: Without dead ends: 4497 [2019-01-13 05:27:49,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-01-13 05:27:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2019-01-13 05:27:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 3718. [2019-01-13 05:27:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3718 states. [2019-01-13 05:27:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 9631 transitions. [2019-01-13 05:27:49,074 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 9631 transitions. Word has length 91 [2019-01-13 05:27:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:49,075 INFO L480 AbstractCegarLoop]: Abstraction has 3718 states and 9631 transitions. [2019-01-13 05:27:49,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 9631 transitions. [2019-01-13 05:27:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:49,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:49,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:49,084 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:49,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:49,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1146090108, now seen corresponding path program 1 times [2019-01-13 05:27:49,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:49,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:49,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:49,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:49,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:49,389 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-13 05:27:49,940 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-13 05:27:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:49,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:49,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:49,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:49,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:49,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:49,948 INFO L87 Difference]: Start difference. First operand 3718 states and 9631 transitions. Second operand 6 states. [2019-01-13 05:27:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:50,688 INFO L93 Difference]: Finished difference Result 4467 states and 11566 transitions. [2019-01-13 05:27:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:27:50,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:27:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:50,694 INFO L225 Difference]: With dead ends: 4467 [2019-01-13 05:27:50,695 INFO L226 Difference]: Without dead ends: 4467 [2019-01-13 05:27:50,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2019-01-13 05:27:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 3597. [2019-01-13 05:27:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2019-01-13 05:27:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 9312 transitions. [2019-01-13 05:27:50,738 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 9312 transitions. Word has length 91 [2019-01-13 05:27:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:50,738 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 9312 transitions. [2019-01-13 05:27:50,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 9312 transitions. [2019-01-13 05:27:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:50,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:50,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:50,744 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:50,744 INFO L82 PathProgramCache]: Analyzing trace with hash 682115181, now seen corresponding path program 1 times [2019-01-13 05:27:50,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:50,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:50,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:50,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:50,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:50,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:50,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:50,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:50,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:50,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:50,881 INFO L87 Difference]: Start difference. First operand 3597 states and 9312 transitions. Second operand 7 states. [2019-01-13 05:27:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:51,207 INFO L93 Difference]: Finished difference Result 3854 states and 9924 transitions. [2019-01-13 05:27:51,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:27:51,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-13 05:27:51,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:51,213 INFO L225 Difference]: With dead ends: 3854 [2019-01-13 05:27:51,213 INFO L226 Difference]: Without dead ends: 3854 [2019-01-13 05:27:51,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2019-01-13 05:27:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 3595. [2019-01-13 05:27:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3595 states. [2019-01-13 05:27:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 9299 transitions. [2019-01-13 05:27:51,254 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 9299 transitions. Word has length 91 [2019-01-13 05:27:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:51,254 INFO L480 AbstractCegarLoop]: Abstraction has 3595 states and 9299 transitions. [2019-01-13 05:27:51,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 9299 transitions. [2019-01-13 05:27:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:51,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:51,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:51,260 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:51,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:51,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1587356682, now seen corresponding path program 1 times [2019-01-13 05:27:51,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:51,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:51,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:51,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:51,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:51,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:51,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:27:51,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:27:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:27:51,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:27:51,644 INFO L87 Difference]: Start difference. First operand 3595 states and 9299 transitions. Second operand 8 states. [2019-01-13 05:27:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:52,216 INFO L93 Difference]: Finished difference Result 4253 states and 10835 transitions. [2019-01-13 05:27:52,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:27:52,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2019-01-13 05:27:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:52,223 INFO L225 Difference]: With dead ends: 4253 [2019-01-13 05:27:52,223 INFO L226 Difference]: Without dead ends: 4221 [2019-01-13 05:27:52,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-13 05:27:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2019-01-13 05:27:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 3128. [2019-01-13 05:27:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2019-01-13 05:27:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 8019 transitions. [2019-01-13 05:27:52,264 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 8019 transitions. Word has length 91 [2019-01-13 05:27:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:52,264 INFO L480 AbstractCegarLoop]: Abstraction has 3128 states and 8019 transitions. [2019-01-13 05:27:52,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:27:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 8019 transitions. [2019-01-13 05:27:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:52,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:52,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:52,270 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:52,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:52,270 INFO L82 PathProgramCache]: Analyzing trace with hash -501232116, now seen corresponding path program 1 times [2019-01-13 05:27:52,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:52,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:52,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:52,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:52,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:52,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:52,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:52,467 INFO L87 Difference]: Start difference. First operand 3128 states and 8019 transitions. Second operand 5 states. [2019-01-13 05:27:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:52,512 INFO L93 Difference]: Finished difference Result 5011 states and 13104 transitions. [2019-01-13 05:27:52,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:52,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-01-13 05:27:52,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:52,521 INFO L225 Difference]: With dead ends: 5011 [2019-01-13 05:27:52,521 INFO L226 Difference]: Without dead ends: 5011 [2019-01-13 05:27:52,522 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 05:27:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2019-01-13 05:27:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 2856. [2019-01-13 05:27:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2019-01-13 05:27:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 7248 transitions. [2019-01-13 05:27:52,570 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 7248 transitions. Word has length 91 [2019-01-13 05:27:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:52,570 INFO L480 AbstractCegarLoop]: Abstraction has 2856 states and 7248 transitions. [2019-01-13 05:27:52,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 7248 transitions. [2019-01-13 05:27:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:52,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:52,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:52,575 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:52,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:52,576 INFO L82 PathProgramCache]: Analyzing trace with hash -20515700, now seen corresponding path program 1 times [2019-01-13 05:27:52,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:52,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:52,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:52,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:52,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:52,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:52,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:52,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:52,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:52,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:52,745 INFO L87 Difference]: Start difference. First operand 2856 states and 7248 transitions. Second operand 6 states. [2019-01-13 05:27:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:52,961 INFO L93 Difference]: Finished difference Result 2504 states and 6208 transitions. [2019-01-13 05:27:52,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:27:52,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:27:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:52,967 INFO L225 Difference]: With dead ends: 2504 [2019-01-13 05:27:52,967 INFO L226 Difference]: Without dead ends: 2504 [2019-01-13 05:27:52,968 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 05:27:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-01-13 05:27:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2025. [2019-01-13 05:27:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-01-13 05:27:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 5113 transitions. [2019-01-13 05:27:52,992 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 5113 transitions. Word has length 91 [2019-01-13 05:27:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:52,992 INFO L480 AbstractCegarLoop]: Abstraction has 2025 states and 5113 transitions. [2019-01-13 05:27:52,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 5113 transitions. [2019-01-13 05:27:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:52,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:52,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:52,996 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:52,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2074225848, now seen corresponding path program 1 times [2019-01-13 05:27:52,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:52,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:52,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:52,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:52,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:53,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:53,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:27:53,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:27:53,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:27:53,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:27:53,152 INFO L87 Difference]: Start difference. First operand 2025 states and 5113 transitions. Second operand 8 states. [2019-01-13 05:27:53,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:53,719 INFO L93 Difference]: Finished difference Result 2916 states and 7221 transitions. [2019-01-13 05:27:53,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:27:53,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-01-13 05:27:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:53,726 INFO L225 Difference]: With dead ends: 2916 [2019-01-13 05:27:53,726 INFO L226 Difference]: Without dead ends: 2916 [2019-01-13 05:27:53,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-01-13 05:27:53,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2019-01-13 05:27:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 2341. [2019-01-13 05:27:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2019-01-13 05:27:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 5888 transitions. [2019-01-13 05:27:53,755 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 5888 transitions. Word has length 93 [2019-01-13 05:27:53,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:53,755 INFO L480 AbstractCegarLoop]: Abstraction has 2341 states and 5888 transitions. [2019-01-13 05:27:53,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:27:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 5888 transitions. [2019-01-13 05:27:53,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:53,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:53,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:53,760 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:53,760 INFO L82 PathProgramCache]: Analyzing trace with hash -829461367, now seen corresponding path program 1 times [2019-01-13 05:27:53,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:53,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:53,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:53,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:53,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:54,165 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 05:27:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:54,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:54,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:54,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:54,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:54,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:54,250 INFO L87 Difference]: Start difference. First operand 2341 states and 5888 transitions. Second operand 6 states. [2019-01-13 05:27:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:54,413 INFO L93 Difference]: Finished difference Result 2470 states and 6124 transitions. [2019-01-13 05:27:54,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:27:54,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 05:27:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:54,418 INFO L225 Difference]: With dead ends: 2470 [2019-01-13 05:27:54,418 INFO L226 Difference]: Without dead ends: 2450 [2019-01-13 05:27:54,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2019-01-13 05:27:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2275. [2019-01-13 05:27:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2019-01-13 05:27:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 5753 transitions. [2019-01-13 05:27:54,444 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 5753 transitions. Word has length 93 [2019-01-13 05:27:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:54,444 INFO L480 AbstractCegarLoop]: Abstraction has 2275 states and 5753 transitions. [2019-01-13 05:27:54,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 5753 transitions. [2019-01-13 05:27:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:54,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:54,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:54,448 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1278158006, now seen corresponding path program 1 times [2019-01-13 05:27:54,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:54,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:54,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:54,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:54,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:54,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:54,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:54,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:54,645 INFO L87 Difference]: Start difference. First operand 2275 states and 5753 transitions. Second operand 6 states. [2019-01-13 05:27:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:54,853 INFO L93 Difference]: Finished difference Result 2065 states and 5170 transitions. [2019-01-13 05:27:54,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:27:54,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 05:27:54,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:54,857 INFO L225 Difference]: With dead ends: 2065 [2019-01-13 05:27:54,858 INFO L226 Difference]: Without dead ends: 2065 [2019-01-13 05:27:54,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:27:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2019-01-13 05:27:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1995. [2019-01-13 05:27:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2019-01-13 05:27:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 5037 transitions. [2019-01-13 05:27:54,880 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 5037 transitions. Word has length 93 [2019-01-13 05:27:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:54,880 INFO L480 AbstractCegarLoop]: Abstraction has 1995 states and 5037 transitions. [2019-01-13 05:27:54,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 5037 transitions. [2019-01-13 05:27:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:54,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:54,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:54,884 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:54,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:54,884 INFO L82 PathProgramCache]: Analyzing trace with hash 849361226, now seen corresponding path program 1 times [2019-01-13 05:27:54,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:54,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:54,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:55,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:55,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:55,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:55,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:55,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:55,144 INFO L87 Difference]: Start difference. First operand 1995 states and 5037 transitions. Second operand 5 states. [2019-01-13 05:27:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:55,352 INFO L93 Difference]: Finished difference Result 2315 states and 5837 transitions. [2019-01-13 05:27:55,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:27:55,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 05:27:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:55,358 INFO L225 Difference]: With dead ends: 2315 [2019-01-13 05:27:55,358 INFO L226 Difference]: Without dead ends: 2315 [2019-01-13 05:27:55,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2019-01-13 05:27:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2043. [2019-01-13 05:27:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2019-01-13 05:27:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 5157 transitions. [2019-01-13 05:27:55,382 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 5157 transitions. Word has length 93 [2019-01-13 05:27:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:55,382 INFO L480 AbstractCegarLoop]: Abstraction has 2043 states and 5157 transitions. [2019-01-13 05:27:55,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 5157 transitions. [2019-01-13 05:27:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:55,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:55,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:55,386 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:55,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2094125707, now seen corresponding path program 1 times [2019-01-13 05:27:55,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:55,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:55,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:55,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:55,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:55,638 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 05:27:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:56,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:56,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 05:27:56,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 05:27:56,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 05:27:56,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:27:56,072 INFO L87 Difference]: Start difference. First operand 2043 states and 5157 transitions. Second operand 12 states. [2019-01-13 05:27:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:56,824 INFO L93 Difference]: Finished difference Result 3696 states and 9496 transitions. [2019-01-13 05:27:56,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 05:27:56,825 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-13 05:27:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:56,830 INFO L225 Difference]: With dead ends: 3696 [2019-01-13 05:27:56,830 INFO L226 Difference]: Without dead ends: 2720 [2019-01-13 05:27:56,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-13 05:27:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-01-13 05:27:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2512. [2019-01-13 05:27:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2512 states. [2019-01-13 05:27:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 6216 transitions. [2019-01-13 05:27:56,865 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 6216 transitions. Word has length 93 [2019-01-13 05:27:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:56,866 INFO L480 AbstractCegarLoop]: Abstraction has 2512 states and 6216 transitions. [2019-01-13 05:27:56,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 05:27:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 6216 transitions. [2019-01-13 05:27:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:27:56,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:56,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:56,871 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash 211591505, now seen corresponding path program 2 times [2019-01-13 05:27:56,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:56,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:56,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:56,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:56,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:27:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:27:56,967 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 05:27:57,163 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:27:57,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:27:57 BasicIcfg [2019-01-13 05:27:57,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:27:57,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:27:57,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:27:57,166 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:27:57,167 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:27:28" (3/4) ... [2019-01-13 05:27:57,169 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 05:27:57,360 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:27:57,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:27:57,362 INFO L168 Benchmark]: Toolchain (without parser) took 31191.65 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 951.4 MB in the beginning and 850.9 MB in the end (delta: 100.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-13 05:27:57,363 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:27:57,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 979.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -108.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-13 05:27:57,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-01-13 05:27:57,366 INFO L168 Benchmark]: Boogie Preprocessor took 41.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:27:57,367 INFO L168 Benchmark]: RCFGBuilder took 1434.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.8 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2019-01-13 05:27:57,367 INFO L168 Benchmark]: TraceAbstraction took 28453.88 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 997.8 MB in the beginning and 877.7 MB in the end (delta: 120.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-13 05:27:57,374 INFO L168 Benchmark]: Witness Printer took 195.21 ms. Allocated memory is still 2.3 GB. Free memory was 877.7 MB in the beginning and 850.9 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-01-13 05:27:57,382 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 979.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -108.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1434.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.8 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28453.88 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 997.8 MB in the beginning and 877.7 MB in the end (delta: 120.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 195.21 ms. Allocated memory is still 2.3 GB. Free memory was 877.7 MB in the beginning and 850.9 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.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] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L676] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L677] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L678] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L679] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L680] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L681] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L682] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L683] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L684] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L685] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L686] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L687] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L688] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L689] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L691] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] -1 pthread_t t2481; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] FCALL, FORK -1 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t2482; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L717] 0 x$w_buff1 = x$w_buff0 [L718] 0 x$w_buff0 = 2 [L719] 0 x$w_buff1_used = x$w_buff0_used [L720] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L723] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L724] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L725] 0 x$r_buff0_thd2 = (_Bool)1 [L728] 0 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L697] 1 y = 2 [L700] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L704] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L704] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L705] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L706] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L738] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L763] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 x$flush_delayed = weak$$choice2 [L772] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L774] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L775] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L776] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 x = x$flush_delayed ? x$mem_tmp : x [L782] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 28.3s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 14.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5227 SDtfs, 4789 SDslu, 11964 SDs, 0 SdLazy, 4742 SolverSat, 308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 71 SyntacticMatches, 17 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37140occurred 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: 4.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 62983 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2145 NumberOfCodeBlocks, 2145 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2027 ConstructedInterpolants, 0 QuantifiedInterpolants, 440597 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...