./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi004_power.oepc_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/rfi004_power.oepc_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 7ee110232f003539cc7f511cc683fd889d7ad081 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 03:42:03,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:42:03,428 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:42:03,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:42:03,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:42:03,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:42:03,444 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:42:03,446 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:42:03,448 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:42:03,449 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:42:03,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:42:03,450 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:42:03,451 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:42:03,452 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:42:03,453 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:42:03,455 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:42:03,455 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:42:03,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:42:03,460 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:42:03,462 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:42:03,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:42:03,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:42:03,467 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:42:03,468 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:42:03,468 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:42:03,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:42:03,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:42:03,471 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:42:03,473 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:42:03,474 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:42:03,474 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:42:03,475 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:42:03,475 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:42:03,476 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:42:03,477 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:42:03,478 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:42:03,478 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 03:42:03,494 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:42:03,494 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:42:03,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:42:03,496 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:42:03,496 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:42:03,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:42:03,497 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:42:03,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:42:03,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:42:03,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:42:03,498 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:42:03,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:42:03,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:42:03,498 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:42:03,498 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:42:03,498 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:42:03,499 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:42:03,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:42:03,501 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:42:03,501 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:42:03,501 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:42:03,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:42:03,501 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:42:03,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:42:03,502 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:42:03,503 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:42:03,503 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:42:03,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:42:03,503 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 -> 7ee110232f003539cc7f511cc683fd889d7ad081 [2019-01-13 03:42:03,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:42:03,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:42:03,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:42:03,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:42:03,572 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:42:03,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi004_power.oepc_false-unreach-call.i [2019-01-13 03:42:03,632 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d083fe7ac/d11ee5c16f8d49e490aa0a30f119453d/FLAGce0b982c5 [2019-01-13 03:42:04,184 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:42:04,190 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi004_power.oepc_false-unreach-call.i [2019-01-13 03:42:04,219 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d083fe7ac/d11ee5c16f8d49e490aa0a30f119453d/FLAGce0b982c5 [2019-01-13 03:42:04,436 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d083fe7ac/d11ee5c16f8d49e490aa0a30f119453d [2019-01-13 03:42:04,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:42:04,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:42:04,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:42:04,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:42:04,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:42:04,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:42:04" (1/1) ... [2019-01-13 03:42:04,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@872c042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:04, skipping insertion in model container [2019-01-13 03:42:04,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:42:04" (1/1) ... [2019-01-13 03:42:04,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:42:04,520 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:42:04,969 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:42:04,996 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:42:05,190 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:42:05,278 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:42:05,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05 WrapperNode [2019-01-13 03:42:05,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:42:05,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:42:05,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:42:05,281 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:42:05,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05" (1/1) ... [2019-01-13 03:42:05,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05" (1/1) ... [2019-01-13 03:42:05,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:42:05,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:42:05,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:42:05,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:42:05,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05" (1/1) ... [2019-01-13 03:42:05,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05" (1/1) ... [2019-01-13 03:42:05,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05" (1/1) ... [2019-01-13 03:42:05,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05" (1/1) ... [2019-01-13 03:42:05,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05" (1/1) ... [2019-01-13 03:42:05,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05" (1/1) ... [2019-01-13 03:42:05,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05" (1/1) ... [2019-01-13 03:42:05,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:42:05,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:42:05,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:42:05,413 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:42:05,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:42:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:42:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:42:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:42:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:42:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:42:05,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:42:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:42:05,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:42:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:42:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:42:05,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:42:05,491 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 03:42:06,508 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:42:06,508 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:42:06,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:42:06 BoogieIcfgContainer [2019-01-13 03:42:06,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:42:06,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:42:06,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:42:06,515 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:42:06,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:42:04" (1/3) ... [2019-01-13 03:42:06,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a07563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:42:06, skipping insertion in model container [2019-01-13 03:42:06,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:42:05" (2/3) ... [2019-01-13 03:42:06,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a07563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:42:06, skipping insertion in model container [2019-01-13 03:42:06,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:42:06" (3/3) ... [2019-01-13 03:42:06,520 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_power.oepc_false-unreach-call.i [2019-01-13 03:42:06,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,566 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,566 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,567 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,567 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,568 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,569 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,581 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,590 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,590 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,590 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,590 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,590 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,611 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,612 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,612 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,612 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,613 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:42:06,664 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:42:06,664 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:42:06,674 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:42:06,694 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:42:06,722 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:42:06,722 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:42:06,723 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:42:06,723 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:42:06,723 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:42:06,723 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:42:06,723 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:42:06,723 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:42:06,724 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:42:06,736 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2019-01-13 03:42:09,076 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2019-01-13 03:42:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2019-01-13 03:42:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-13 03:42:09,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:09,089 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] [2019-01-13 03:42:09,091 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:09,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:09,096 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2019-01-13 03:42:09,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:09,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:09,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:09,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:09,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:09,418 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 03:42:09,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:09,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:09,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:09,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:09,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:09,440 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2019-01-13 03:42:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:10,835 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2019-01-13 03:42:10,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:42:10,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-13 03:42:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:11,446 INFO L225 Difference]: With dead ends: 47768 [2019-01-13 03:42:11,446 INFO L226 Difference]: Without dead ends: 34608 [2019-01-13 03:42:11,448 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 03:42:11,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2019-01-13 03:42:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2019-01-13 03:42:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2019-01-13 03:42:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2019-01-13 03:42:12,622 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2019-01-13 03:42:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:12,624 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2019-01-13 03:42:12,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2019-01-13 03:42:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 03:42:12,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:12,636 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] [2019-01-13 03:42:12,636 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:12,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:12,637 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2019-01-13 03:42:12,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:12,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:12,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:12,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:12,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:13,008 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 03:42:13,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:13,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:13,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:13,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:13,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:13,013 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 5 states. [2019-01-13 03:42:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:17,213 INFO L93 Difference]: Finished difference Result 47634 states and 173802 transitions. [2019-01-13 03:42:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:42:17,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-13 03:42:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:17,484 INFO L225 Difference]: With dead ends: 47634 [2019-01-13 03:42:17,484 INFO L226 Difference]: Without dead ends: 47066 [2019-01-13 03:42:17,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47066 states. [2019-01-13 03:42:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47066 to 31796. [2019-01-13 03:42:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31796 states. [2019-01-13 03:42:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 116819 transitions. [2019-01-13 03:42:19,162 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 116819 transitions. Word has length 47 [2019-01-13 03:42:19,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:19,167 INFO L480 AbstractCegarLoop]: Abstraction has 31796 states and 116819 transitions. [2019-01-13 03:42:19,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 116819 transitions. [2019-01-13 03:42:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 03:42:19,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:19,178 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] [2019-01-13 03:42:19,178 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2019-01-13 03:42:19,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:19,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:19,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:19,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:19,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:19,420 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 03:42:19,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:19,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:19,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:19,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:19,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:19,423 INFO L87 Difference]: Start difference. First operand 31796 states and 116819 transitions. Second operand 5 states. [2019-01-13 03:42:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:20,209 INFO L93 Difference]: Finished difference Result 63028 states and 229114 transitions. [2019-01-13 03:42:20,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:42:20,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-13 03:42:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:20,424 INFO L225 Difference]: With dead ends: 63028 [2019-01-13 03:42:20,424 INFO L226 Difference]: Without dead ends: 62564 [2019-01-13 03:42:20,424 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 03:42:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62564 states. [2019-01-13 03:42:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62564 to 35364. [2019-01-13 03:42:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2019-01-13 03:42:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 128877 transitions. [2019-01-13 03:42:22,600 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 128877 transitions. Word has length 48 [2019-01-13 03:42:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:22,601 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 128877 transitions. [2019-01-13 03:42:22,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 128877 transitions. [2019-01-13 03:42:22,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 03:42:22,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:22,609 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] [2019-01-13 03:42:22,609 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:22,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:22,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2019-01-13 03:42:22,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:22,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:22,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:22,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:22,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:22,688 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 03:42:22,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:22,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:42:22,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:42:22,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:42:22,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:42:22,690 INFO L87 Difference]: Start difference. First operand 35364 states and 128877 transitions. Second operand 3 states. [2019-01-13 03:42:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:22,929 INFO L93 Difference]: Finished difference Result 45910 states and 163945 transitions. [2019-01-13 03:42:22,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:42:22,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-13 03:42:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:23,024 INFO L225 Difference]: With dead ends: 45910 [2019-01-13 03:42:23,025 INFO L226 Difference]: Without dead ends: 45910 [2019-01-13 03:42:23,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:42:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45910 states. [2019-01-13 03:42:24,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45910 to 40247. [2019-01-13 03:42:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40247 states. [2019-01-13 03:42:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40247 states to 40247 states and 145215 transitions. [2019-01-13 03:42:24,769 INFO L78 Accepts]: Start accepts. Automaton has 40247 states and 145215 transitions. Word has length 50 [2019-01-13 03:42:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:24,769 INFO L480 AbstractCegarLoop]: Abstraction has 40247 states and 145215 transitions. [2019-01-13 03:42:24,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:42:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 40247 states and 145215 transitions. [2019-01-13 03:42:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:42:24,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:24,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:42:24,787 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2019-01-13 03:42:24,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:24,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:24,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:24,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:24,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:24,923 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 03:42:24,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:24,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:24,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:24,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:24,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:24,925 INFO L87 Difference]: Start difference. First operand 40247 states and 145215 transitions. Second operand 6 states. [2019-01-13 03:42:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:25,984 INFO L93 Difference]: Finished difference Result 70850 states and 252355 transitions. [2019-01-13 03:42:25,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:42:25,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-13 03:42:25,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:26,175 INFO L225 Difference]: With dead ends: 70850 [2019-01-13 03:42:26,175 INFO L226 Difference]: Without dead ends: 70314 [2019-01-13 03:42:26,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:42:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70314 states. [2019-01-13 03:42:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70314 to 40898. [2019-01-13 03:42:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40898 states. [2019-01-13 03:42:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 147668 transitions. [2019-01-13 03:42:27,243 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 147668 transitions. Word has length 54 [2019-01-13 03:42:27,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:27,244 INFO L480 AbstractCegarLoop]: Abstraction has 40898 states and 147668 transitions. [2019-01-13 03:42:27,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 147668 transitions. [2019-01-13 03:42:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:42:27,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:27,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:42:27,266 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:27,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:27,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1915358571, now seen corresponding path program 1 times [2019-01-13 03:42:27,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:27,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:27,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:27,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:27,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:27,501 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 03:42:27,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:27,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:27,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:27,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:27,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:27,502 INFO L87 Difference]: Start difference. First operand 40898 states and 147668 transitions. Second operand 6 states. [2019-01-13 03:42:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:30,797 INFO L93 Difference]: Finished difference Result 56599 states and 201648 transitions. [2019-01-13 03:42:30,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:42:30,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-01-13 03:42:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:30,924 INFO L225 Difference]: With dead ends: 56599 [2019-01-13 03:42:30,924 INFO L226 Difference]: Without dead ends: 55460 [2019-01-13 03:42:30,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:31,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2019-01-13 03:42:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 51955. [2019-01-13 03:42:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51955 states. [2019-01-13 03:42:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51955 states to 51955 states and 186007 transitions. [2019-01-13 03:42:31,970 INFO L78 Accepts]: Start accepts. Automaton has 51955 states and 186007 transitions. Word has length 54 [2019-01-13 03:42:31,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:31,970 INFO L480 AbstractCegarLoop]: Abstraction has 51955 states and 186007 transitions. [2019-01-13 03:42:31,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 51955 states and 186007 transitions. [2019-01-13 03:42:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:42:31,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:31,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:42:31,992 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash 582657366, now seen corresponding path program 1 times [2019-01-13 03:42:31,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:31,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:31,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:32,523 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 03:42:32,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:32,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:42:32,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:42:32,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:42:32,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:32,524 INFO L87 Difference]: Start difference. First operand 51955 states and 186007 transitions. Second operand 7 states. [2019-01-13 03:42:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:33,832 INFO L93 Difference]: Finished difference Result 75638 states and 260104 transitions. [2019-01-13 03:42:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 03:42:33,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-13 03:42:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:33,991 INFO L225 Difference]: With dead ends: 75638 [2019-01-13 03:42:33,991 INFO L226 Difference]: Without dead ends: 75638 [2019-01-13 03:42:33,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:42:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75638 states. [2019-01-13 03:42:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75638 to 61473. [2019-01-13 03:42:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61473 states. [2019-01-13 03:42:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61473 states to 61473 states and 215184 transitions. [2019-01-13 03:42:35,843 INFO L78 Accepts]: Start accepts. Automaton has 61473 states and 215184 transitions. Word has length 54 [2019-01-13 03:42:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:35,843 INFO L480 AbstractCegarLoop]: Abstraction has 61473 states and 215184 transitions. [2019-01-13 03:42:35,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:42:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 61473 states and 215184 transitions. [2019-01-13 03:42:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-13 03:42:35,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:35,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:42:35,859 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:35,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:35,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1470161047, now seen corresponding path program 1 times [2019-01-13 03:42:35,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:35,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:35,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:35,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:35,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:36,035 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 03:42:36,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:36,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:36,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:36,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:36,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:36,038 INFO L87 Difference]: Start difference. First operand 61473 states and 215184 transitions. Second operand 4 states. [2019-01-13 03:42:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:36,345 INFO L93 Difference]: Finished difference Result 13778 states and 43274 transitions. [2019-01-13 03:42:36,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:42:36,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-13 03:42:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:36,375 INFO L225 Difference]: With dead ends: 13778 [2019-01-13 03:42:36,376 INFO L226 Difference]: Without dead ends: 12161 [2019-01-13 03:42:36,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 03:42:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12161 states. [2019-01-13 03:42:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12161 to 12113. [2019-01-13 03:42:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12113 states. [2019-01-13 03:42:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12113 states to 12113 states and 37958 transitions. [2019-01-13 03:42:36,641 INFO L78 Accepts]: Start accepts. Automaton has 12113 states and 37958 transitions. Word has length 54 [2019-01-13 03:42:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:36,641 INFO L480 AbstractCegarLoop]: Abstraction has 12113 states and 37958 transitions. [2019-01-13 03:42:36,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 12113 states and 37958 transitions. [2019-01-13 03:42:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 03:42:36,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:36,651 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] [2019-01-13 03:42:36,651 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:36,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2019-01-13 03:42:36,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:36,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:36,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:36,770 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 03:42:36,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:36,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:36,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:36,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:36,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:36,771 INFO L87 Difference]: Start difference. First operand 12113 states and 37958 transitions. Second operand 4 states. [2019-01-13 03:42:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:37,144 INFO L93 Difference]: Finished difference Result 14276 states and 44581 transitions. [2019-01-13 03:42:37,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:42:37,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-13 03:42:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:37,167 INFO L225 Difference]: With dead ends: 14276 [2019-01-13 03:42:37,167 INFO L226 Difference]: Without dead ends: 14276 [2019-01-13 03:42:37,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14276 states. [2019-01-13 03:42:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14276 to 12844. [2019-01-13 03:42:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12844 states. [2019-01-13 03:42:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12844 states to 12844 states and 40183 transitions. [2019-01-13 03:42:37,352 INFO L78 Accepts]: Start accepts. Automaton has 12844 states and 40183 transitions. Word has length 64 [2019-01-13 03:42:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:37,353 INFO L480 AbstractCegarLoop]: Abstraction has 12844 states and 40183 transitions. [2019-01-13 03:42:37,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 12844 states and 40183 transitions. [2019-01-13 03:42:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 03:42:37,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:37,360 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] [2019-01-13 03:42:37,361 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2019-01-13 03:42:37,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:37,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:37,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:37,730 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 03:42:37,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:37,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:37,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:37,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:37,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:37,731 INFO L87 Difference]: Start difference. First operand 12844 states and 40183 transitions. Second operand 6 states. [2019-01-13 03:42:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:38,435 INFO L93 Difference]: Finished difference Result 23411 states and 72792 transitions. [2019-01-13 03:42:38,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:42:38,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-01-13 03:42:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:38,474 INFO L225 Difference]: With dead ends: 23411 [2019-01-13 03:42:38,474 INFO L226 Difference]: Without dead ends: 23347 [2019-01-13 03:42:38,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:42:38,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23347 states. [2019-01-13 03:42:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23347 to 13813. [2019-01-13 03:42:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13813 states. [2019-01-13 03:42:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13813 states to 13813 states and 42967 transitions. [2019-01-13 03:42:38,732 INFO L78 Accepts]: Start accepts. Automaton has 13813 states and 42967 transitions. Word has length 64 [2019-01-13 03:42:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:38,733 INFO L480 AbstractCegarLoop]: Abstraction has 13813 states and 42967 transitions. [2019-01-13 03:42:38,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 13813 states and 42967 transitions. [2019-01-13 03:42:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:42:38,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:38,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] [2019-01-13 03:42:38,744 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:38,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:38,744 INFO L82 PathProgramCache]: Analyzing trace with hash 708445986, now seen corresponding path program 1 times [2019-01-13 03:42:38,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:38,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:38,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:38,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:38,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:38,891 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 03:42:38,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:38,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:38,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:38,893 INFO L87 Difference]: Start difference. First operand 13813 states and 42967 transitions. Second operand 4 states. [2019-01-13 03:42:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:39,641 INFO L93 Difference]: Finished difference Result 20043 states and 60866 transitions. [2019-01-13 03:42:39,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:42:39,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-13 03:42:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:39,675 INFO L225 Difference]: With dead ends: 20043 [2019-01-13 03:42:39,675 INFO L226 Difference]: Without dead ends: 19971 [2019-01-13 03:42:39,676 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 03:42:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19971 states. [2019-01-13 03:42:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19971 to 15684. [2019-01-13 03:42:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15684 states. [2019-01-13 03:42:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15684 states to 15684 states and 48127 transitions. [2019-01-13 03:42:39,923 INFO L78 Accepts]: Start accepts. Automaton has 15684 states and 48127 transitions. Word has length 66 [2019-01-13 03:42:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:39,923 INFO L480 AbstractCegarLoop]: Abstraction has 15684 states and 48127 transitions. [2019-01-13 03:42:39,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand 15684 states and 48127 transitions. [2019-01-13 03:42:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:42:39,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:39,936 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] [2019-01-13 03:42:39,936 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash 497095073, now seen corresponding path program 1 times [2019-01-13 03:42:39,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:39,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:39,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:39,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:39,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:40,175 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 03:42:40,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:40,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:40,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:40,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:40,176 INFO L87 Difference]: Start difference. First operand 15684 states and 48127 transitions. Second operand 4 states. [2019-01-13 03:42:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:40,706 INFO L93 Difference]: Finished difference Result 19514 states and 59136 transitions. [2019-01-13 03:42:40,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:42:40,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-13 03:42:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:40,735 INFO L225 Difference]: With dead ends: 19514 [2019-01-13 03:42:40,735 INFO L226 Difference]: Without dead ends: 19514 [2019-01-13 03:42:40,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19514 states. [2019-01-13 03:42:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19514 to 15967. [2019-01-13 03:42:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15967 states. [2019-01-13 03:42:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15967 states to 15967 states and 48937 transitions. [2019-01-13 03:42:40,979 INFO L78 Accepts]: Start accepts. Automaton has 15967 states and 48937 transitions. Word has length 66 [2019-01-13 03:42:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:40,979 INFO L480 AbstractCegarLoop]: Abstraction has 15967 states and 48937 transitions. [2019-01-13 03:42:40,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 15967 states and 48937 transitions. [2019-01-13 03:42:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:42:40,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:40,992 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] [2019-01-13 03:42:40,993 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:40,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:40,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1580114270, now seen corresponding path program 1 times [2019-01-13 03:42:40,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:40,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:40,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:40,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:40,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:41,122 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 03:42:41,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:41,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:42:41,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:42:41,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:42:41,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:42:41,124 INFO L87 Difference]: Start difference. First operand 15967 states and 48937 transitions. Second operand 3 states. [2019-01-13 03:42:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:41,372 INFO L93 Difference]: Finished difference Result 16435 states and 50215 transitions. [2019-01-13 03:42:41,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:42:41,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-13 03:42:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:41,399 INFO L225 Difference]: With dead ends: 16435 [2019-01-13 03:42:41,399 INFO L226 Difference]: Without dead ends: 16435 [2019-01-13 03:42:41,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:42:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16435 states. [2019-01-13 03:42:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16435 to 16201. [2019-01-13 03:42:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16201 states. [2019-01-13 03:42:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16201 states to 16201 states and 49549 transitions. [2019-01-13 03:42:41,637 INFO L78 Accepts]: Start accepts. Automaton has 16201 states and 49549 transitions. Word has length 66 [2019-01-13 03:42:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:41,638 INFO L480 AbstractCegarLoop]: Abstraction has 16201 states and 49549 transitions. [2019-01-13 03:42:41,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:42:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 16201 states and 49549 transitions. [2019-01-13 03:42:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:42:41,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:41,655 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] [2019-01-13 03:42:41,655 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:41,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1496622296, now seen corresponding path program 1 times [2019-01-13 03:42:41,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:41,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:41,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:41,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:41,767 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 03:42:41,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:41,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:41,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:41,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:41,768 INFO L87 Difference]: Start difference. First operand 16201 states and 49549 transitions. Second operand 6 states. [2019-01-13 03:42:42,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:42,786 INFO L93 Difference]: Finished difference Result 19533 states and 58786 transitions. [2019-01-13 03:42:42,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:42:42,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 03:42:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:42,820 INFO L225 Difference]: With dead ends: 19533 [2019-01-13 03:42:42,820 INFO L226 Difference]: Without dead ends: 19533 [2019-01-13 03:42:42,820 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 03:42:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19533 states. [2019-01-13 03:42:43,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19533 to 18145. [2019-01-13 03:42:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18145 states. [2019-01-13 03:42:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18145 states to 18145 states and 54956 transitions. [2019-01-13 03:42:43,072 INFO L78 Accepts]: Start accepts. Automaton has 18145 states and 54956 transitions. Word has length 68 [2019-01-13 03:42:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:43,073 INFO L480 AbstractCegarLoop]: Abstraction has 18145 states and 54956 transitions. [2019-01-13 03:42:43,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 18145 states and 54956 transitions. [2019-01-13 03:42:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:42:43,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:43,086 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] [2019-01-13 03:42:43,087 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:43,087 INFO L82 PathProgramCache]: Analyzing trace with hash 721135657, now seen corresponding path program 1 times [2019-01-13 03:42:43,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:43,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:43,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:43,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:43,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:43,216 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 03:42:43,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:43,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:43,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:43,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:43,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:43,217 INFO L87 Difference]: Start difference. First operand 18145 states and 54956 transitions. Second operand 6 states. [2019-01-13 03:42:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:43,621 INFO L93 Difference]: Finished difference Result 19926 states and 59453 transitions. [2019-01-13 03:42:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:42:43,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 03:42:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:43,651 INFO L225 Difference]: With dead ends: 19926 [2019-01-13 03:42:43,651 INFO L226 Difference]: Without dead ends: 19926 [2019-01-13 03:42:43,652 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 03:42:43,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19926 states. [2019-01-13 03:42:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19926 to 18237. [2019-01-13 03:42:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18237 states. [2019-01-13 03:42:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18237 states to 18237 states and 54811 transitions. [2019-01-13 03:42:43,921 INFO L78 Accepts]: Start accepts. Automaton has 18237 states and 54811 transitions. Word has length 68 [2019-01-13 03:42:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:43,922 INFO L480 AbstractCegarLoop]: Abstraction has 18237 states and 54811 transitions. [2019-01-13 03:42:43,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 18237 states and 54811 transitions. [2019-01-13 03:42:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:42:43,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:43,935 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] [2019-01-13 03:42:43,935 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:43,936 INFO L82 PathProgramCache]: Analyzing trace with hash 932486570, now seen corresponding path program 1 times [2019-01-13 03:42:43,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:43,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:43,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:44,114 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 03:42:44,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:44,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:44,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:44,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:44,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:44,115 INFO L87 Difference]: Start difference. First operand 18237 states and 54811 transitions. Second operand 5 states. [2019-01-13 03:42:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:44,479 INFO L93 Difference]: Finished difference Result 22525 states and 67154 transitions. [2019-01-13 03:42:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:42:44,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 03:42:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:44,517 INFO L225 Difference]: With dead ends: 22525 [2019-01-13 03:42:44,517 INFO L226 Difference]: Without dead ends: 22525 [2019-01-13 03:42:44,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22525 states. [2019-01-13 03:42:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22525 to 19323. [2019-01-13 03:42:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19323 states. [2019-01-13 03:42:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19323 states to 19323 states and 57570 transitions. [2019-01-13 03:42:44,788 INFO L78 Accepts]: Start accepts. Automaton has 19323 states and 57570 transitions. Word has length 68 [2019-01-13 03:42:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:44,788 INFO L480 AbstractCegarLoop]: Abstraction has 19323 states and 57570 transitions. [2019-01-13 03:42:44,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 19323 states and 57570 transitions. [2019-01-13 03:42:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:42:44,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:44,802 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] [2019-01-13 03:42:44,802 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:44,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash 421952393, now seen corresponding path program 1 times [2019-01-13 03:42:44,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:44,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:44,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:44,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:44,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:44,905 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 03:42:44,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:44,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:44,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:44,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:44,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:44,907 INFO L87 Difference]: Start difference. First operand 19323 states and 57570 transitions. Second operand 5 states. [2019-01-13 03:42:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:45,441 INFO L93 Difference]: Finished difference Result 27944 states and 82376 transitions. [2019-01-13 03:42:45,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:42:45,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 03:42:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:45,488 INFO L225 Difference]: With dead ends: 27944 [2019-01-13 03:42:45,488 INFO L226 Difference]: Without dead ends: 27944 [2019-01-13 03:42:45,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 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 03:42:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27944 states. [2019-01-13 03:42:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27944 to 22126. [2019-01-13 03:42:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22126 states. [2019-01-13 03:42:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22126 states to 22126 states and 65535 transitions. [2019-01-13 03:42:46,082 INFO L78 Accepts]: Start accepts. Automaton has 22126 states and 65535 transitions. Word has length 68 [2019-01-13 03:42:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:46,083 INFO L480 AbstractCegarLoop]: Abstraction has 22126 states and 65535 transitions. [2019-01-13 03:42:46,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 22126 states and 65535 transitions. [2019-01-13 03:42:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:42:46,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:46,099 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] [2019-01-13 03:42:46,099 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:46,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1385502070, now seen corresponding path program 1 times [2019-01-13 03:42:46,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:46,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:46,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:46,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:46,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:46,241 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 03:42:46,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:46,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:46,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:46,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:46,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:46,242 INFO L87 Difference]: Start difference. First operand 22126 states and 65535 transitions. Second operand 6 states. [2019-01-13 03:42:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:47,295 INFO L93 Difference]: Finished difference Result 35126 states and 103809 transitions. [2019-01-13 03:42:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:42:47,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-01-13 03:42:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:47,352 INFO L225 Difference]: With dead ends: 35126 [2019-01-13 03:42:47,352 INFO L226 Difference]: Without dead ends: 35126 [2019-01-13 03:42:47,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35126 states. [2019-01-13 03:42:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35126 to 27938. [2019-01-13 03:42:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27938 states. [2019-01-13 03:42:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27938 states to 27938 states and 83546 transitions. [2019-01-13 03:42:47,779 INFO L78 Accepts]: Start accepts. Automaton has 27938 states and 83546 transitions. Word has length 68 [2019-01-13 03:42:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:47,780 INFO L480 AbstractCegarLoop]: Abstraction has 27938 states and 83546 transitions. [2019-01-13 03:42:47,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 27938 states and 83546 transitions. [2019-01-13 03:42:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:42:47,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:47,806 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] [2019-01-13 03:42:47,806 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:47,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:47,807 INFO L82 PathProgramCache]: Analyzing trace with hash -497998389, now seen corresponding path program 1 times [2019-01-13 03:42:47,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:47,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:47,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:47,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:47,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:48,018 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 03:42:48,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:48,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:48,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:48,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:48,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:48,019 INFO L87 Difference]: Start difference. First operand 27938 states and 83546 transitions. Second operand 4 states. [2019-01-13 03:42:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:48,644 INFO L93 Difference]: Finished difference Result 30414 states and 90227 transitions. [2019-01-13 03:42:48,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:42:48,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-01-13 03:42:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:48,693 INFO L225 Difference]: With dead ends: 30414 [2019-01-13 03:42:48,694 INFO L226 Difference]: Without dead ends: 29906 [2019-01-13 03:42:48,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29906 states. [2019-01-13 03:42:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29906 to 27610. [2019-01-13 03:42:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27610 states. [2019-01-13 03:42:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 82079 transitions. [2019-01-13 03:42:49,116 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 82079 transitions. Word has length 68 [2019-01-13 03:42:49,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:49,116 INFO L480 AbstractCegarLoop]: Abstraction has 27610 states and 82079 transitions. [2019-01-13 03:42:49,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 82079 transitions. [2019-01-13 03:42:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:42:49,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:49,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:42:49,137 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:49,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:49,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1112513867, now seen corresponding path program 1 times [2019-01-13 03:42:49,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:49,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:49,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:49,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:49,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:49,526 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 03:42:49,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:49,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:42:49,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:42:49,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:42:49,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:42:49,528 INFO L87 Difference]: Start difference. First operand 27610 states and 82079 transitions. Second operand 9 states. [2019-01-13 03:42:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:51,277 INFO L93 Difference]: Finished difference Result 34850 states and 102928 transitions. [2019-01-13 03:42:51,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:42:51,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-01-13 03:42:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:51,335 INFO L225 Difference]: With dead ends: 34850 [2019-01-13 03:42:51,335 INFO L226 Difference]: Without dead ends: 34850 [2019-01-13 03:42:51,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:42:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34850 states. [2019-01-13 03:42:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34850 to 29288. [2019-01-13 03:42:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2019-01-13 03:42:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87100 transitions. [2019-01-13 03:42:51,796 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87100 transitions. Word has length 68 [2019-01-13 03:42:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:51,796 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87100 transitions. [2019-01-13 03:42:51,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:42:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87100 transitions. [2019-01-13 03:42:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 03:42:51,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:51,819 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] [2019-01-13 03:42:51,819 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:51,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:51,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2000017548, now seen corresponding path program 1 times [2019-01-13 03:42:51,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:51,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:51,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:51,912 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 03:42:51,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:51,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:51,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:51,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:51,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:51,914 INFO L87 Difference]: Start difference. First operand 29288 states and 87100 transitions. Second operand 5 states. [2019-01-13 03:42:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:51,987 INFO L93 Difference]: Finished difference Result 7664 states and 18502 transitions. [2019-01-13 03:42:51,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:42:51,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-13 03:42:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:51,995 INFO L225 Difference]: With dead ends: 7664 [2019-01-13 03:42:51,996 INFO L226 Difference]: Without dead ends: 5913 [2019-01-13 03:42:51,996 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 03:42:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2019-01-13 03:42:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 4971. [2019-01-13 03:42:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4971 states. [2019-01-13 03:42:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 11771 transitions. [2019-01-13 03:42:52,054 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 11771 transitions. Word has length 68 [2019-01-13 03:42:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:52,055 INFO L480 AbstractCegarLoop]: Abstraction has 4971 states and 11771 transitions. [2019-01-13 03:42:52,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 11771 transitions. [2019-01-13 03:42:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:42:52,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:52,061 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] [2019-01-13 03:42:52,061 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash -150323517, now seen corresponding path program 1 times [2019-01-13 03:42:52,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:52,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:52,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:52,312 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 03:42:52,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:52,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:52,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:52,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:52,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:52,314 INFO L87 Difference]: Start difference. First operand 4971 states and 11771 transitions. Second operand 6 states. [2019-01-13 03:42:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:52,680 INFO L93 Difference]: Finished difference Result 6778 states and 15982 transitions. [2019-01-13 03:42:52,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:42:52,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-01-13 03:42:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:52,689 INFO L225 Difference]: With dead ends: 6778 [2019-01-13 03:42:52,689 INFO L226 Difference]: Without dead ends: 6746 [2019-01-13 03:42:52,690 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 03:42:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6746 states. [2019-01-13 03:42:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6746 to 5276. [2019-01-13 03:42:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5276 states. [2019-01-13 03:42:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 12536 transitions. [2019-01-13 03:42:52,752 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 12536 transitions. Word has length 83 [2019-01-13 03:42:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:52,752 INFO L480 AbstractCegarLoop]: Abstraction has 5276 states and 12536 transitions. [2019-01-13 03:42:52,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 12536 transitions. [2019-01-13 03:42:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:42:52,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:52,758 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] [2019-01-13 03:42:52,759 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:52,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:52,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1947274876, now seen corresponding path program 1 times [2019-01-13 03:42:52,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:52,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:52,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:52,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:52,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:52,950 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 03:42:52,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:52,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:42:52,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:42:52,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:42:52,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:52,951 INFO L87 Difference]: Start difference. First operand 5276 states and 12536 transitions. Second operand 7 states. [2019-01-13 03:42:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:53,531 INFO L93 Difference]: Finished difference Result 8217 states and 19889 transitions. [2019-01-13 03:42:53,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:42:53,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-01-13 03:42:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:53,541 INFO L225 Difference]: With dead ends: 8217 [2019-01-13 03:42:53,541 INFO L226 Difference]: Without dead ends: 8217 [2019-01-13 03:42:53,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:42:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2019-01-13 03:42:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 5921. [2019-01-13 03:42:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5921 states. [2019-01-13 03:42:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5921 states to 5921 states and 14180 transitions. [2019-01-13 03:42:53,621 INFO L78 Accepts]: Start accepts. Automaton has 5921 states and 14180 transitions. Word has length 83 [2019-01-13 03:42:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:53,622 INFO L480 AbstractCegarLoop]: Abstraction has 5921 states and 14180 transitions. [2019-01-13 03:42:53,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:42:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5921 states and 14180 transitions. [2019-01-13 03:42:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:42:53,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:53,629 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] [2019-01-13 03:42:53,629 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:53,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:53,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1059771195, now seen corresponding path program 1 times [2019-01-13 03:42:53,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:53,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:53,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:53,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:53,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:53,932 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 03:42:53,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:53,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:53,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:53,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:53,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:53,934 INFO L87 Difference]: Start difference. First operand 5921 states and 14180 transitions. Second operand 6 states. [2019-01-13 03:42:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:54,331 INFO L93 Difference]: Finished difference Result 6595 states and 15795 transitions. [2019-01-13 03:42:54,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:42:54,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-01-13 03:42:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:54,341 INFO L225 Difference]: With dead ends: 6595 [2019-01-13 03:42:54,341 INFO L226 Difference]: Without dead ends: 6595 [2019-01-13 03:42:54,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:42:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6595 states. [2019-01-13 03:42:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6595 to 5382. [2019-01-13 03:42:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5382 states. [2019-01-13 03:42:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5382 states to 5382 states and 12786 transitions. [2019-01-13 03:42:54,409 INFO L78 Accepts]: Start accepts. Automaton has 5382 states and 12786 transitions. Word has length 83 [2019-01-13 03:42:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:54,410 INFO L480 AbstractCegarLoop]: Abstraction has 5382 states and 12786 transitions. [2019-01-13 03:42:54,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 5382 states and 12786 transitions. [2019-01-13 03:42:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:42:54,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:54,418 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] [2019-01-13 03:42:54,418 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:54,418 INFO L82 PathProgramCache]: Analyzing trace with hash -582057176, now seen corresponding path program 1 times [2019-01-13 03:42:54,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:54,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:54,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:54,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:54,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:54,893 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 6 [2019-01-13 03:42:55,149 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 6 [2019-01-13 03:42:55,160 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 03:42:55,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:55,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:55,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:55,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:55,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:55,164 INFO L87 Difference]: Start difference. First operand 5382 states and 12786 transitions. Second operand 6 states. [2019-01-13 03:42:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:55,244 INFO L93 Difference]: Finished difference Result 5612 states and 13396 transitions. [2019-01-13 03:42:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:42:55,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-01-13 03:42:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:55,252 INFO L225 Difference]: With dead ends: 5612 [2019-01-13 03:42:55,253 INFO L226 Difference]: Without dead ends: 5612 [2019-01-13 03:42:55,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2019-01-13 03:42:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 4827. [2019-01-13 03:42:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4827 states. [2019-01-13 03:42:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4827 states to 4827 states and 11330 transitions. [2019-01-13 03:42:55,322 INFO L78 Accepts]: Start accepts. Automaton has 4827 states and 11330 transitions. Word has length 83 [2019-01-13 03:42:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:55,323 INFO L480 AbstractCegarLoop]: Abstraction has 4827 states and 11330 transitions. [2019-01-13 03:42:55,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4827 states and 11330 transitions. [2019-01-13 03:42:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-13 03:42:55,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:55,330 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] [2019-01-13 03:42:55,330 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:55,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1980934568, now seen corresponding path program 1 times [2019-01-13 03:42:55,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:55,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:55,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:55,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:55,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:55,539 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 03:42:55,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:55,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:55,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:55,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:55,541 INFO L87 Difference]: Start difference. First operand 4827 states and 11330 transitions. Second operand 6 states. [2019-01-13 03:42:55,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:55,703 INFO L93 Difference]: Finished difference Result 4507 states and 10322 transitions. [2019-01-13 03:42:55,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:42:55,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-01-13 03:42:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:55,711 INFO L225 Difference]: With dead ends: 4507 [2019-01-13 03:42:55,711 INFO L226 Difference]: Without dead ends: 4507 [2019-01-13 03:42:55,712 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 03:42:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-01-13 03:42:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 2803. [2019-01-13 03:42:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2803 states. [2019-01-13 03:42:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 6453 transitions. [2019-01-13 03:42:55,760 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 6453 transitions. Word has length 83 [2019-01-13 03:42:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:55,760 INFO L480 AbstractCegarLoop]: Abstraction has 2803 states and 6453 transitions. [2019-01-13 03:42:55,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 6453 transitions. [2019-01-13 03:42:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:42:55,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:55,765 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] [2019-01-13 03:42:55,765 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1696141667, now seen corresponding path program 1 times [2019-01-13 03:42:55,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:55,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:55,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:55,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:55,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:56,190 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 03:42:56,693 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-13 03:42:56,727 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 03:42:56,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:56,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:56,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:56,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:56,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:56,729 INFO L87 Difference]: Start difference. First operand 2803 states and 6453 transitions. Second operand 6 states. [2019-01-13 03:42:57,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:57,418 INFO L93 Difference]: Finished difference Result 3212 states and 7302 transitions. [2019-01-13 03:42:57,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:42:57,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-01-13 03:42:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:57,423 INFO L225 Difference]: With dead ends: 3212 [2019-01-13 03:42:57,423 INFO L226 Difference]: Without dead ends: 3136 [2019-01-13 03:42:57,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2019-01-13 03:42:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 2597. [2019-01-13 03:42:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2597 states. [2019-01-13 03:42:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 5931 transitions. [2019-01-13 03:42:57,457 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 5931 transitions. Word has length 85 [2019-01-13 03:42:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:57,457 INFO L480 AbstractCegarLoop]: Abstraction has 2597 states and 5931 transitions. [2019-01-13 03:42:57,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 5931 transitions. [2019-01-13 03:42:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:42:57,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:57,461 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] [2019-01-13 03:42:57,461 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:57,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1441405122, now seen corresponding path program 1 times [2019-01-13 03:42:57,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:57,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:57,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:57,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:58,017 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 03:42:58,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:58,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:42:58,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:42:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:42:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:58,019 INFO L87 Difference]: Start difference. First operand 2597 states and 5931 transitions. Second operand 7 states. [2019-01-13 03:42:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:58,302 INFO L93 Difference]: Finished difference Result 3089 states and 7036 transitions. [2019-01-13 03:42:58,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:42:58,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-01-13 03:42:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:58,307 INFO L225 Difference]: With dead ends: 3089 [2019-01-13 03:42:58,307 INFO L226 Difference]: Without dead ends: 3089 [2019-01-13 03:42:58,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:42:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2019-01-13 03:42:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2678. [2019-01-13 03:42:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2678 states. [2019-01-13 03:42:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 6081 transitions. [2019-01-13 03:42:58,342 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 6081 transitions. Word has length 85 [2019-01-13 03:42:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:58,342 INFO L480 AbstractCegarLoop]: Abstraction has 2678 states and 6081 transitions. [2019-01-13 03:42:58,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:42:58,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 6081 transitions. [2019-01-13 03:42:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:42:58,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:58,346 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] [2019-01-13 03:42:58,346 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:58,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1966058493, now seen corresponding path program 1 times [2019-01-13 03:42:58,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:58,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:58,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:58,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:58,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:42:58,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:42:58,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:42:58,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:58,845 INFO L87 Difference]: Start difference. First operand 2678 states and 6081 transitions. Second operand 7 states. [2019-01-13 03:42:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:58,940 INFO L93 Difference]: Finished difference Result 4634 states and 10603 transitions. [2019-01-13 03:42:58,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:42:58,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-01-13 03:42:58,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:58,944 INFO L225 Difference]: With dead ends: 4634 [2019-01-13 03:42:58,944 INFO L226 Difference]: Without dead ends: 2041 [2019-01-13 03:42:58,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:42:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2019-01-13 03:42:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 2041. [2019-01-13 03:42:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2019-01-13 03:42:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 4668 transitions. [2019-01-13 03:42:58,965 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 4668 transitions. Word has length 85 [2019-01-13 03:42:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:58,965 INFO L480 AbstractCegarLoop]: Abstraction has 2041 states and 4668 transitions. [2019-01-13 03:42:58,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:42:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 4668 transitions. [2019-01-13 03:42:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:42:58,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:58,968 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] [2019-01-13 03:42:58,968 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:58,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1464778360, now seen corresponding path program 2 times [2019-01-13 03:42:58,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:58,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:58,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:58,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:58,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:59,198 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 03:42:59,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:59,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:42:59,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:42:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:42:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:59,200 INFO L87 Difference]: Start difference. First operand 2041 states and 4668 transitions. Second operand 8 states. [2019-01-13 03:42:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:59,521 INFO L93 Difference]: Finished difference Result 2443 states and 5589 transitions. [2019-01-13 03:42:59,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 03:42:59,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-01-13 03:42:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:59,526 INFO L225 Difference]: With dead ends: 2443 [2019-01-13 03:42:59,526 INFO L226 Difference]: Without dead ends: 2419 [2019-01-13 03:42:59,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-13 03:42:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2019-01-13 03:42:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2067. [2019-01-13 03:42:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2019-01-13 03:42:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 4729 transitions. [2019-01-13 03:42:59,547 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 4729 transitions. Word has length 85 [2019-01-13 03:42:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:59,548 INFO L480 AbstractCegarLoop]: Abstraction has 2067 states and 4729 transitions. [2019-01-13 03:42:59,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:42:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 4729 transitions. [2019-01-13 03:42:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:42:59,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:59,551 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:59,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:59,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1942685255, now seen corresponding path program 2 times [2019-01-13 03:42:59,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:59,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:59,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:59,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:42:59,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:59,732 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 03:42:59,807 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 03:42:59,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:59,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 03:42:59,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 03:42:59,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 03:42:59,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:42:59,809 INFO L87 Difference]: Start difference. First operand 2067 states and 4729 transitions. Second operand 11 states. [2019-01-13 03:43:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:43:00,827 INFO L93 Difference]: Finished difference Result 4150 states and 9558 transitions. [2019-01-13 03:43:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:43:00,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-01-13 03:43:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:43:00,833 INFO L225 Difference]: With dead ends: 4150 [2019-01-13 03:43:00,833 INFO L226 Difference]: Without dead ends: 2428 [2019-01-13 03:43:00,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-01-13 03:43:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2019-01-13 03:43:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2100. [2019-01-13 03:43:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-01-13 03:43:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 4752 transitions. [2019-01-13 03:43:00,856 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 4752 transitions. Word has length 85 [2019-01-13 03:43:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:43:00,856 INFO L480 AbstractCegarLoop]: Abstraction has 2100 states and 4752 transitions. [2019-01-13 03:43:00,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 03:43:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 4752 transitions. [2019-01-13 03:43:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 03:43:00,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:43:00,860 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] [2019-01-13 03:43:00,860 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:43:00,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:43:00,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 3 times [2019-01-13 03:43:00,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:43:00,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:43:00,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:00,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:43:00,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:43:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:43:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:43:00,933 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:43:01,067 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:43:01,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:43:01 BasicIcfg [2019-01-13 03:43:01,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:43:01,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:43:01,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:43:01,070 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:43:01,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:42:06" (3/4) ... [2019-01-13 03:43:01,076 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:43:01,233 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:43:01,233 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:43:01,234 INFO L168 Benchmark]: Toolchain (without parser) took 56793.33 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 947.3 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 445.0 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:01,235 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:43:01,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:01,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:01,237 INFO L168 Benchmark]: Boogie Preprocessor took 44.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:43:01,239 INFO L168 Benchmark]: RCFGBuilder took 1097.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:01,240 INFO L168 Benchmark]: TraceAbstraction took 54558.09 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 418.4 MB. Max. memory is 11.5 GB. [2019-01-13 03:43:01,240 INFO L168 Benchmark]: Witness Printer took 163.30 ms. Allocated memory is still 4.5 GB. Free memory is still 3.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:43:01,244 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 836.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1097.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 54558.09 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 418.4 MB. Max. memory is 11.5 GB. * Witness Printer took 163.30 ms. Allocated memory is still 4.5 GB. Free memory is still 3.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1651; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1651, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1652; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1652, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 54.3s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 27.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8537 SDtfs, 10511 SDslu, 19211 SDs, 0 SdLazy, 7669 SolverSat, 462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 75 SyntacticMatches, 20 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61473occurred in iteration=7, 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: 15.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 164336 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2195 NumberOfCodeBlocks, 2195 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2079 ConstructedInterpolants, 0 QuantifiedInterpolants, 381298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...