./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix031_rmo.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/mix031_rmo.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 299cf90b3d63022a669c015dab67fb8f824b1c69 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:22:24,394 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 01:22:24,396 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 01:22:24,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 01:22:24,413 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 01:22:24,415 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 01:22:24,419 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 01:22:24,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 01:22:24,424 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 01:22:24,426 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 01:22:24,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 01:22:24,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 01:22:24,431 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 01:22:24,434 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 01:22:24,440 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 01:22:24,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 01:22:24,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 01:22:24,450 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 01:22:24,452 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 01:22:24,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 01:22:24,458 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 01:22:24,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 01:22:24,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 01:22:24,468 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 01:22:24,468 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 01:22:24,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 01:22:24,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 01:22:24,474 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 01:22:24,475 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 01:22:24,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 01:22:24,479 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 01:22:24,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 01:22:24,482 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 01:22:24,482 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 01:22:24,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 01:22:24,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 01:22:24,484 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 01:22:24,507 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 01:22:24,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 01:22:24,508 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 01:22:24,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 01:22:24,509 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 01:22:24,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 01:22:24,509 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 01:22:24,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 01:22:24,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 01:22:24,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 01:22:24,510 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 01:22:24,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 01:22:24,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 01:22:24,510 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 01:22:24,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 01:22:24,511 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 01:22:24,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 01:22:24,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 01:22:24,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 01:22:24,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 01:22:24,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 01:22:24,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 01:22:24,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 01:22:24,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 01:22:24,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 01:22:24,513 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 01:22:24,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 01:22:24,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 01:22:24,513 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 -> 299cf90b3d63022a669c015dab67fb8f824b1c69 [2019-01-13 01:22:24,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 01:22:24,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 01:22:24,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 01:22:24,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 01:22:24,567 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 01:22:24,568 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix031_rmo.oepc_false-unreach-call.i [2019-01-13 01:22:24,626 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a47eb801/a2d8a537b7d64afbad7a514ffd220362/FLAG5685378bc [2019-01-13 01:22:25,131 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 01:22:25,132 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix031_rmo.oepc_false-unreach-call.i [2019-01-13 01:22:25,151 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a47eb801/a2d8a537b7d64afbad7a514ffd220362/FLAG5685378bc [2019-01-13 01:22:25,416 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a47eb801/a2d8a537b7d64afbad7a514ffd220362 [2019-01-13 01:22:25,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 01:22:25,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 01:22:25,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 01:22:25,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 01:22:25,429 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 01:22:25,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:22:25" (1/1) ... [2019-01-13 01:22:25,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b19a82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:25, skipping insertion in model container [2019-01-13 01:22:25,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:22:25" (1/1) ... [2019-01-13 01:22:25,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 01:22:25,504 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 01:22:26,017 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:22:26,031 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 01:22:26,177 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:22:26,260 INFO L195 MainTranslator]: Completed translation [2019-01-13 01:22:26,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26 WrapperNode [2019-01-13 01:22:26,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 01:22:26,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 01:22:26,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 01:22:26,262 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 01:22:26,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26" (1/1) ... [2019-01-13 01:22:26,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26" (1/1) ... [2019-01-13 01:22:26,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 01:22:26,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 01:22:26,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 01:22:26,323 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 01:22:26,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26" (1/1) ... [2019-01-13 01:22:26,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26" (1/1) ... [2019-01-13 01:22:26,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26" (1/1) ... [2019-01-13 01:22:26,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26" (1/1) ... [2019-01-13 01:22:26,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26" (1/1) ... [2019-01-13 01:22:26,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26" (1/1) ... [2019-01-13 01:22:26,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26" (1/1) ... [2019-01-13 01:22:26,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 01:22:26,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 01:22:26,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 01:22:26,381 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 01:22:26,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26" (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 01:22:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 01:22:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 01:22:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 01:22:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 01:22:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 01:22:26,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 01:22:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 01:22:26,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 01:22:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 01:22:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 01:22:26,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 01:22:26,451 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 01:22:27,589 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 01:22:27,590 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 01:22:27,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:22:27 BoogieIcfgContainer [2019-01-13 01:22:27,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 01:22:27,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 01:22:27,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 01:22:27,597 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 01:22:27,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 01:22:25" (1/3) ... [2019-01-13 01:22:27,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696a0e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:22:27, skipping insertion in model container [2019-01-13 01:22:27,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:26" (2/3) ... [2019-01-13 01:22:27,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696a0e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:22:27, skipping insertion in model container [2019-01-13 01:22:27,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:22:27" (3/3) ... [2019-01-13 01:22:27,601 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_rmo.oepc_false-unreach-call.i [2019-01-13 01:22:27,649 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,650 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,650 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,650 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,652 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,653 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,670 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,673 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,681 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,681 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,693 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,714 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,723 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,724 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,724 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,724 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,725 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,726 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,726 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,726 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,726 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,727 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,729 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,731 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:27,772 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 01:22:27,773 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 01:22:27,786 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 01:22:27,805 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 01:22:27,828 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 01:22:27,829 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 01:22:27,829 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 01:22:27,829 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 01:22:27,829 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 01:22:27,830 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 01:22:27,830 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 01:22:27,830 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 01:22:27,830 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 01:22:27,844 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 184 transitions [2019-01-13 01:22:30,249 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34810 states. [2019-01-13 01:22:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 34810 states. [2019-01-13 01:22:30,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 01:22:30,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:30,263 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] [2019-01-13 01:22:30,266 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:30,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:30,273 INFO L82 PathProgramCache]: Analyzing trace with hash 148401709, now seen corresponding path program 1 times [2019-01-13 01:22:30,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:30,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:30,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:30,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:30,652 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 01:22:30,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:30,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:22:30,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:22:30,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:22:30,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:30,682 INFO L87 Difference]: Start difference. First operand 34810 states. Second operand 4 states. [2019-01-13 01:22:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:32,226 INFO L93 Difference]: Finished difference Result 60794 states and 234497 transitions. [2019-01-13 01:22:32,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:22:32,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-13 01:22:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:32,589 INFO L225 Difference]: With dead ends: 60794 [2019-01-13 01:22:32,589 INFO L226 Difference]: Without dead ends: 44274 [2019-01-13 01:22:32,591 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 01:22:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44274 states. [2019-01-13 01:22:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44274 to 27342. [2019-01-13 01:22:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27342 states. [2019-01-13 01:22:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 105503 transitions. [2019-01-13 01:22:34,532 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 105503 transitions. Word has length 37 [2019-01-13 01:22:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:34,535 INFO L480 AbstractCegarLoop]: Abstraction has 27342 states and 105503 transitions. [2019-01-13 01:22:34,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:22:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 105503 transitions. [2019-01-13 01:22:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-13 01:22:34,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:34,553 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] [2019-01-13 01:22:34,554 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:34,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:34,554 INFO L82 PathProgramCache]: Analyzing trace with hash -54930118, now seen corresponding path program 1 times [2019-01-13 01:22:34,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:34,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:34,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:34,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:34,729 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 01:22:34,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:34,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:22:34,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:22:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:22:34,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:22:34,732 INFO L87 Difference]: Start difference. First operand 27342 states and 105503 transitions. Second operand 5 states. [2019-01-13 01:22:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:37,345 INFO L93 Difference]: Finished difference Result 64008 states and 235338 transitions. [2019-01-13 01:22:37,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:22:37,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-13 01:22:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:37,664 INFO L225 Difference]: With dead ends: 64008 [2019-01-13 01:22:37,664 INFO L226 Difference]: Without dead ends: 63456 [2019-01-13 01:22:37,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:22:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63456 states. [2019-01-13 01:22:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63456 to 41424. [2019-01-13 01:22:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41424 states. [2019-01-13 01:22:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41424 states to 41424 states and 152333 transitions. [2019-01-13 01:22:39,708 INFO L78 Accepts]: Start accepts. Automaton has 41424 states and 152333 transitions. Word has length 49 [2019-01-13 01:22:39,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:39,710 INFO L480 AbstractCegarLoop]: Abstraction has 41424 states and 152333 transitions. [2019-01-13 01:22:39,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:22:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 41424 states and 152333 transitions. [2019-01-13 01:22:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 01:22:39,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:39,719 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 01:22:39,719 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:39,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash -790300171, now seen corresponding path program 1 times [2019-01-13 01:22:39,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:39,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:39,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:39,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:39,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:40,063 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-13 01:22:40,086 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 01:22:40,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:40,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:22:40,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:22:40,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:22:40,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:22:40,088 INFO L87 Difference]: Start difference. First operand 41424 states and 152333 transitions. Second operand 6 states. [2019-01-13 01:22:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:41,744 INFO L93 Difference]: Finished difference Result 52774 states and 191028 transitions. [2019-01-13 01:22:41,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:22:41,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-01-13 01:22:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:41,926 INFO L225 Difference]: With dead ends: 52774 [2019-01-13 01:22:41,926 INFO L226 Difference]: Without dead ends: 52262 [2019-01-13 01:22:41,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:22:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52262 states. [2019-01-13 01:22:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52262 to 45378. [2019-01-13 01:22:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45378 states. [2019-01-13 01:22:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45378 states to 45378 states and 166021 transitions. [2019-01-13 01:22:44,236 INFO L78 Accepts]: Start accepts. Automaton has 45378 states and 166021 transitions. Word has length 50 [2019-01-13 01:22:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:44,237 INFO L480 AbstractCegarLoop]: Abstraction has 45378 states and 166021 transitions. [2019-01-13 01:22:44,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:22:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 45378 states and 166021 transitions. [2019-01-13 01:22:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 01:22:44,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:44,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:22:44,251 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:44,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:44,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1702931131, now seen corresponding path program 1 times [2019-01-13 01:22:44,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:44,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:44,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:44,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:44,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:44,352 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 01:22:44,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:44,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:22:44,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:22:44,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:22:44,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:22:44,354 INFO L87 Difference]: Start difference. First operand 45378 states and 166021 transitions. Second operand 3 states. [2019-01-13 01:22:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:44,711 INFO L93 Difference]: Finished difference Result 65254 states and 235817 transitions. [2019-01-13 01:22:44,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:22:44,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-13 01:22:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:44,868 INFO L225 Difference]: With dead ends: 65254 [2019-01-13 01:22:44,869 INFO L226 Difference]: Without dead ends: 65254 [2019-01-13 01:22:44,869 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 01:22:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65254 states. [2019-01-13 01:22:46,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65254 to 50948. [2019-01-13 01:22:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50948 states. [2019-01-13 01:22:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50948 states to 50948 states and 184328 transitions. [2019-01-13 01:22:46,155 INFO L78 Accepts]: Start accepts. Automaton has 50948 states and 184328 transitions. Word has length 52 [2019-01-13 01:22:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:46,156 INFO L480 AbstractCegarLoop]: Abstraction has 50948 states and 184328 transitions. [2019-01-13 01:22:46,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:22:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 50948 states and 184328 transitions. [2019-01-13 01:22:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 01:22:46,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:46,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:22:46,177 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:46,177 INFO L82 PathProgramCache]: Analyzing trace with hash -190326020, now seen corresponding path program 1 times [2019-01-13 01:22:46,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:46,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:46,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:46,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:46,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:46,427 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 01:22:46,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:46,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:22:46,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:22:46,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:22:46,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:22:46,430 INFO L87 Difference]: Start difference. First operand 50948 states and 184328 transitions. Second operand 6 states. [2019-01-13 01:22:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:50,780 INFO L93 Difference]: Finished difference Result 67514 states and 242188 transitions. [2019-01-13 01:22:50,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:22:50,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-13 01:22:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:50,961 INFO L225 Difference]: With dead ends: 67514 [2019-01-13 01:22:50,961 INFO L226 Difference]: Without dead ends: 67514 [2019-01-13 01:22:50,961 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 01:22:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67514 states. [2019-01-13 01:22:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67514 to 63439. [2019-01-13 01:22:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63439 states. [2019-01-13 01:22:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63439 states to 63439 states and 227587 transitions. [2019-01-13 01:22:52,301 INFO L78 Accepts]: Start accepts. Automaton has 63439 states and 227587 transitions. Word has length 56 [2019-01-13 01:22:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:52,301 INFO L480 AbstractCegarLoop]: Abstraction has 63439 states and 227587 transitions. [2019-01-13 01:22:52,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:22:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 63439 states and 227587 transitions. [2019-01-13 01:22:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 01:22:52,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:52,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:22:52,322 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1987277379, now seen corresponding path program 1 times [2019-01-13 01:22:52,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:52,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:52,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:52,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:52,586 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 01:22:52,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:52,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:22:52,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:22:52,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:22:52,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:22:52,588 INFO L87 Difference]: Start difference. First operand 63439 states and 227587 transitions. Second operand 7 states. [2019-01-13 01:22:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:54,996 INFO L93 Difference]: Finished difference Result 88531 states and 306204 transitions. [2019-01-13 01:22:54,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 01:22:54,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-01-13 01:22:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:55,253 INFO L225 Difference]: With dead ends: 88531 [2019-01-13 01:22:55,253 INFO L226 Difference]: Without dead ends: 88531 [2019-01-13 01:22:55,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 01:22:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88531 states. [2019-01-13 01:22:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88531 to 74884. [2019-01-13 01:22:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74884 states. [2019-01-13 01:22:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74884 states to 74884 states and 262990 transitions. [2019-01-13 01:22:56,796 INFO L78 Accepts]: Start accepts. Automaton has 74884 states and 262990 transitions. Word has length 56 [2019-01-13 01:22:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:56,796 INFO L480 AbstractCegarLoop]: Abstraction has 74884 states and 262990 transitions. [2019-01-13 01:22:56,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:22:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 74884 states and 262990 transitions. [2019-01-13 01:22:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 01:22:56,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:56,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:22:56,812 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:56,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1099773698, now seen corresponding path program 1 times [2019-01-13 01:22:56,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:56,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:56,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:56,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:56,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:56,902 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 01:22:56,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:56,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:22:56,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:22:56,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:22:56,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:56,903 INFO L87 Difference]: Start difference. First operand 74884 states and 262990 transitions. Second operand 4 states. [2019-01-13 01:22:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:56,997 INFO L93 Difference]: Finished difference Result 15378 states and 48829 transitions. [2019-01-13 01:22:56,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:22:56,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-13 01:22:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:57,022 INFO L225 Difference]: With dead ends: 15378 [2019-01-13 01:22:57,023 INFO L226 Difference]: Without dead ends: 13792 [2019-01-13 01:22:57,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:22:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13792 states. [2019-01-13 01:22:57,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13792 to 13743. [2019-01-13 01:22:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13743 states. [2019-01-13 01:22:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13743 states to 13743 states and 43355 transitions. [2019-01-13 01:22:57,227 INFO L78 Accepts]: Start accepts. Automaton has 13743 states and 43355 transitions. Word has length 56 [2019-01-13 01:22:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:57,227 INFO L480 AbstractCegarLoop]: Abstraction has 13743 states and 43355 transitions. [2019-01-13 01:22:57,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:22:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 13743 states and 43355 transitions. [2019-01-13 01:22:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 01:22:57,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:57,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:22:57,229 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:57,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1252831162, now seen corresponding path program 1 times [2019-01-13 01:22:57,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:57,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:57,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:57,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:57,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:57,507 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 01:22:57,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:57,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:22:57,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:22:57,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:22:57,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:22:57,508 INFO L87 Difference]: Start difference. First operand 13743 states and 43355 transitions. Second operand 6 states. [2019-01-13 01:22:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:58,192 INFO L93 Difference]: Finished difference Result 19973 states and 62592 transitions. [2019-01-13 01:22:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 01:22:58,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-13 01:22:58,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:58,228 INFO L225 Difference]: With dead ends: 19973 [2019-01-13 01:22:58,228 INFO L226 Difference]: Without dead ends: 19901 [2019-01-13 01:22:58,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-13 01:22:58,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19901 states. [2019-01-13 01:22:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19901 to 14317. [2019-01-13 01:22:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14317 states. [2019-01-13 01:22:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14317 states to 14317 states and 45052 transitions. [2019-01-13 01:22:58,468 INFO L78 Accepts]: Start accepts. Automaton has 14317 states and 45052 transitions. Word has length 56 [2019-01-13 01:22:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:58,468 INFO L480 AbstractCegarLoop]: Abstraction has 14317 states and 45052 transitions. [2019-01-13 01:22:58,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:22:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 14317 states and 45052 transitions. [2019-01-13 01:22:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 01:22:58,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:58,473 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 01:22:58,474 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:58,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash -575191646, now seen corresponding path program 1 times [2019-01-13 01:22:58,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:58,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:58,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:58,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:58,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:58,676 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 01:22:58,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:58,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:22:58,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:22:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:22:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:58,677 INFO L87 Difference]: Start difference. First operand 14317 states and 45052 transitions. Second operand 4 states. [2019-01-13 01:22:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:58,918 INFO L93 Difference]: Finished difference Result 16620 states and 52380 transitions. [2019-01-13 01:22:58,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:22:58,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-13 01:22:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:58,952 INFO L225 Difference]: With dead ends: 16620 [2019-01-13 01:22:58,952 INFO L226 Difference]: Without dead ends: 16620 [2019-01-13 01:22:58,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:22:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16620 states. [2019-01-13 01:22:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16620 to 15137. [2019-01-13 01:22:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15137 states. [2019-01-13 01:22:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 47642 transitions. [2019-01-13 01:22:59,389 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 47642 transitions. Word has length 64 [2019-01-13 01:22:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:59,389 INFO L480 AbstractCegarLoop]: Abstraction has 15137 states and 47642 transitions. [2019-01-13 01:22:59,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:22:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 47642 transitions. [2019-01-13 01:22:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 01:22:59,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:59,395 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 01:22:59,395 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:59,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:59,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1167618689, now seen corresponding path program 1 times [2019-01-13 01:22:59,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:59,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:59,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:59,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:59,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:59,682 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-13 01:22:59,791 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 01:22:59,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:59,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 01:22:59,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 01:22:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 01:22:59,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:22:59,793 INFO L87 Difference]: Start difference. First operand 15137 states and 47642 transitions. Second operand 8 states. [2019-01-13 01:23:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:00,661 INFO L93 Difference]: Finished difference Result 19827 states and 61331 transitions. [2019-01-13 01:23:00,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:23:00,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-01-13 01:23:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:00,695 INFO L225 Difference]: With dead ends: 19827 [2019-01-13 01:23:00,695 INFO L226 Difference]: Without dead ends: 19756 [2019-01-13 01:23:00,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-13 01:23:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19756 states. [2019-01-13 01:23:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19756 to 17415. [2019-01-13 01:23:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17415 states. [2019-01-13 01:23:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17415 states to 17415 states and 54316 transitions. [2019-01-13 01:23:00,965 INFO L78 Accepts]: Start accepts. Automaton has 17415 states and 54316 transitions. Word has length 64 [2019-01-13 01:23:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:00,965 INFO L480 AbstractCegarLoop]: Abstraction has 17415 states and 54316 transitions. [2019-01-13 01:23:00,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 01:23:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 17415 states and 54316 transitions. [2019-01-13 01:23:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 01:23:00,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:00,973 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 01:23:00,973 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:00,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash -677873457, now seen corresponding path program 1 times [2019-01-13 01:23:00,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:00,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:00,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:00,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:00,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:01,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:01,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:23:01,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:23:01,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:23:01,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:23:01,215 INFO L87 Difference]: Start difference. First operand 17415 states and 54316 transitions. Second operand 4 states. [2019-01-13 01:23:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:01,792 INFO L93 Difference]: Finished difference Result 21359 states and 65805 transitions. [2019-01-13 01:23:01,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:23:01,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-01-13 01:23:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:01,829 INFO L225 Difference]: With dead ends: 21359 [2019-01-13 01:23:01,829 INFO L226 Difference]: Without dead ends: 21359 [2019-01-13 01:23:01,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:23:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2019-01-13 01:23:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 19309. [2019-01-13 01:23:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19309 states. [2019-01-13 01:23:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19309 states to 19309 states and 59695 transitions. [2019-01-13 01:23:02,126 INFO L78 Accepts]: Start accepts. Automaton has 19309 states and 59695 transitions. Word has length 68 [2019-01-13 01:23:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:02,126 INFO L480 AbstractCegarLoop]: Abstraction has 19309 states and 59695 transitions. [2019-01-13 01:23:02,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:23:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 19309 states and 59695 transitions. [2019-01-13 01:23:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 01:23:02,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:02,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 01:23:02,137 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1539884496, now seen corresponding path program 1 times [2019-01-13 01:23:02,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:02,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:02,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:02,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:02,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:02,272 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 01:23:02,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:02,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:23:02,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:23:02,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:23:02,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:23:02,274 INFO L87 Difference]: Start difference. First operand 19309 states and 59695 transitions. Second operand 3 states. [2019-01-13 01:23:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:02,619 INFO L93 Difference]: Finished difference Result 19949 states and 61434 transitions. [2019-01-13 01:23:02,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:23:02,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-13 01:23:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:02,657 INFO L225 Difference]: With dead ends: 19949 [2019-01-13 01:23:02,657 INFO L226 Difference]: Without dead ends: 19949 [2019-01-13 01:23:02,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:23:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19949 states. [2019-01-13 01:23:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19949 to 19649. [2019-01-13 01:23:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19649 states. [2019-01-13 01:23:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19649 states to 19649 states and 60611 transitions. [2019-01-13 01:23:02,964 INFO L78 Accepts]: Start accepts. Automaton has 19649 states and 60611 transitions. Word has length 68 [2019-01-13 01:23:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:02,964 INFO L480 AbstractCegarLoop]: Abstraction has 19649 states and 60611 transitions. [2019-01-13 01:23:02,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:23:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 19649 states and 60611 transitions. [2019-01-13 01:23:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 01:23:02,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:02,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:02,977 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:02,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1412859306, now seen corresponding path program 1 times [2019-01-13 01:23:02,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:02,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:02,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:02,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:02,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:03,425 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 01:23:03,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:03,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:23:03,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:23:03,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:23:03,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:23:03,427 INFO L87 Difference]: Start difference. First operand 19649 states and 60611 transitions. Second operand 6 states. [2019-01-13 01:23:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:04,623 INFO L93 Difference]: Finished difference Result 23817 states and 72329 transitions. [2019-01-13 01:23:04,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:04,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-01-13 01:23:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:04,663 INFO L225 Difference]: With dead ends: 23817 [2019-01-13 01:23:04,664 INFO L226 Difference]: Without dead ends: 23817 [2019-01-13 01:23:04,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23817 states. [2019-01-13 01:23:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23817 to 22477. [2019-01-13 01:23:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22477 states. [2019-01-13 01:23:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22477 states to 22477 states and 68751 transitions. [2019-01-13 01:23:05,002 INFO L78 Accepts]: Start accepts. Automaton has 22477 states and 68751 transitions. Word has length 70 [2019-01-13 01:23:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:05,002 INFO L480 AbstractCegarLoop]: Abstraction has 22477 states and 68751 transitions. [2019-01-13 01:23:05,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:23:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 22477 states and 68751 transitions. [2019-01-13 01:23:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 01:23:05,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:05,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:05,016 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash 804898647, now seen corresponding path program 1 times [2019-01-13 01:23:05,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:05,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:05,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:05,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:05,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:05,234 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 01:23:05,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:05,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:05,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:05,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:05,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:05,236 INFO L87 Difference]: Start difference. First operand 22477 states and 68751 transitions. Second operand 5 states. [2019-01-13 01:23:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:05,768 INFO L93 Difference]: Finished difference Result 29036 states and 88481 transitions. [2019-01-13 01:23:05,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:05,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-13 01:23:05,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:05,819 INFO L225 Difference]: With dead ends: 29036 [2019-01-13 01:23:05,820 INFO L226 Difference]: Without dead ends: 29036 [2019-01-13 01:23:05,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 01:23:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29036 states. [2019-01-13 01:23:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29036 to 26257. [2019-01-13 01:23:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26257 states. [2019-01-13 01:23:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26257 states to 26257 states and 79967 transitions. [2019-01-13 01:23:06,427 INFO L78 Accepts]: Start accepts. Automaton has 26257 states and 79967 transitions. Word has length 70 [2019-01-13 01:23:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:06,427 INFO L480 AbstractCegarLoop]: Abstraction has 26257 states and 79967 transitions. [2019-01-13 01:23:06,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 26257 states and 79967 transitions. [2019-01-13 01:23:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 01:23:06,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:06,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:06,443 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:06,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:06,443 INFO L82 PathProgramCache]: Analyzing trace with hash 294364470, now seen corresponding path program 1 times [2019-01-13 01:23:06,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:06,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:06,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:06,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:06,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:06,823 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 01:23:06,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:06,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:06,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:06,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:06,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:06,825 INFO L87 Difference]: Start difference. First operand 26257 states and 79967 transitions. Second operand 5 states. [2019-01-13 01:23:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:07,929 INFO L93 Difference]: Finished difference Result 35347 states and 106727 transitions. [2019-01-13 01:23:07,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:23:07,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-13 01:23:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:07,991 INFO L225 Difference]: With dead ends: 35347 [2019-01-13 01:23:07,991 INFO L226 Difference]: Without dead ends: 35347 [2019-01-13 01:23:07,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35347 states. [2019-01-13 01:23:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35347 to 28671. [2019-01-13 01:23:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28671 states. [2019-01-13 01:23:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28671 states to 28671 states and 86974 transitions. [2019-01-13 01:23:08,447 INFO L78 Accepts]: Start accepts. Automaton has 28671 states and 86974 transitions. Word has length 70 [2019-01-13 01:23:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:08,448 INFO L480 AbstractCegarLoop]: Abstraction has 28671 states and 86974 transitions. [2019-01-13 01:23:08,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 28671 states and 86974 transitions. [2019-01-13 01:23:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 01:23:08,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:08,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:08,462 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:08,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:08,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1513089993, now seen corresponding path program 1 times [2019-01-13 01:23:08,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:08,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:08,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:08,611 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 01:23:08,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:08,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:08,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:08,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:08,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:08,613 INFO L87 Difference]: Start difference. First operand 28671 states and 86974 transitions. Second operand 5 states. [2019-01-13 01:23:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:08,693 INFO L93 Difference]: Finished difference Result 8611 states and 21473 transitions. [2019-01-13 01:23:08,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 01:23:08,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-13 01:23:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:08,703 INFO L225 Difference]: With dead ends: 8611 [2019-01-13 01:23:08,704 INFO L226 Difference]: Without dead ends: 6783 [2019-01-13 01:23:08,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6783 states. [2019-01-13 01:23:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6783 to 5764. [2019-01-13 01:23:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2019-01-13 01:23:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 14037 transitions. [2019-01-13 01:23:08,773 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 14037 transitions. Word has length 70 [2019-01-13 01:23:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:08,774 INFO L480 AbstractCegarLoop]: Abstraction has 5764 states and 14037 transitions. [2019-01-13 01:23:08,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 14037 transitions. [2019-01-13 01:23:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 01:23:08,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:08,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:08,779 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:08,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:08,780 INFO L82 PathProgramCache]: Analyzing trace with hash -173742318, now seen corresponding path program 1 times [2019-01-13 01:23:08,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:08,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:08,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:08,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:08,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:08,853 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 01:23:08,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:08,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:23:08,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:23:08,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:23:08,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:23:08,855 INFO L87 Difference]: Start difference. First operand 5764 states and 14037 transitions. Second operand 3 states. [2019-01-13 01:23:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:08,918 INFO L93 Difference]: Finished difference Result 7836 states and 18976 transitions. [2019-01-13 01:23:08,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:23:08,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-01-13 01:23:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:08,928 INFO L225 Difference]: With dead ends: 7836 [2019-01-13 01:23:08,929 INFO L226 Difference]: Without dead ends: 7836 [2019-01-13 01:23:08,929 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 01:23:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2019-01-13 01:23:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 5665. [2019-01-13 01:23:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5665 states. [2019-01-13 01:23:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 13522 transitions. [2019-01-13 01:23:09,000 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 13522 transitions. Word has length 70 [2019-01-13 01:23:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:09,000 INFO L480 AbstractCegarLoop]: Abstraction has 5665 states and 13522 transitions. [2019-01-13 01:23:09,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:23:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 13522 transitions. [2019-01-13 01:23:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 01:23:09,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:09,006 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] [2019-01-13 01:23:09,006 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:09,007 INFO L82 PathProgramCache]: Analyzing trace with hash 536084869, now seen corresponding path program 1 times [2019-01-13 01:23:09,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:09,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:09,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:09,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:09,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:09,359 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 01:23:09,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:09,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:09,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:09,361 INFO L87 Difference]: Start difference. First operand 5665 states and 13522 transitions. Second operand 5 states. [2019-01-13 01:23:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:09,612 INFO L93 Difference]: Finished difference Result 6725 states and 16031 transitions. [2019-01-13 01:23:09,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:23:09,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-01-13 01:23:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:09,622 INFO L225 Difference]: With dead ends: 6725 [2019-01-13 01:23:09,622 INFO L226 Difference]: Without dead ends: 6725 [2019-01-13 01:23:09,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:23:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2019-01-13 01:23:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 6143. [2019-01-13 01:23:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6143 states. [2019-01-13 01:23:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6143 states to 6143 states and 14680 transitions. [2019-01-13 01:23:09,691 INFO L78 Accepts]: Start accepts. Automaton has 6143 states and 14680 transitions. Word has length 76 [2019-01-13 01:23:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:09,692 INFO L480 AbstractCegarLoop]: Abstraction has 6143 states and 14680 transitions. [2019-01-13 01:23:09,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6143 states and 14680 transitions. [2019-01-13 01:23:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 01:23:09,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:09,698 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] [2019-01-13 01:23:09,698 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:09,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:09,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2016072092, now seen corresponding path program 1 times [2019-01-13 01:23:09,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:09,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:09,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:09,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:09,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:09,872 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 01:23:09,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:09,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:23:09,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:23:09,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:23:09,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:09,873 INFO L87 Difference]: Start difference. First operand 6143 states and 14680 transitions. Second operand 7 states. [2019-01-13 01:23:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:10,686 INFO L93 Difference]: Finished difference Result 7017 states and 16575 transitions. [2019-01-13 01:23:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:23:10,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-01-13 01:23:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:10,702 INFO L225 Difference]: With dead ends: 7017 [2019-01-13 01:23:10,702 INFO L226 Difference]: Without dead ends: 6898 [2019-01-13 01:23:10,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-13 01:23:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2019-01-13 01:23:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 6153. [2019-01-13 01:23:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2019-01-13 01:23:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 14610 transitions. [2019-01-13 01:23:10,847 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 14610 transitions. Word has length 76 [2019-01-13 01:23:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:10,847 INFO L480 AbstractCegarLoop]: Abstraction has 6153 states and 14610 transitions. [2019-01-13 01:23:10,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:23:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 14610 transitions. [2019-01-13 01:23:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 01:23:10,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:10,860 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:10,861 INFO L82 PathProgramCache]: Analyzing trace with hash -322598773, now seen corresponding path program 1 times [2019-01-13 01:23:10,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:10,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:10,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:10,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:10,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:11,098 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 01:23:11,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:11,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:23:11,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:23:11,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:23:11,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:23:11,102 INFO L87 Difference]: Start difference. First operand 6153 states and 14610 transitions. Second operand 4 states. [2019-01-13 01:23:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:11,993 INFO L93 Difference]: Finished difference Result 9320 states and 22194 transitions. [2019-01-13 01:23:11,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:23:11,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-13 01:23:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:12,008 INFO L225 Difference]: With dead ends: 9320 [2019-01-13 01:23:12,008 INFO L226 Difference]: Without dead ends: 9320 [2019-01-13 01:23:12,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:23:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2019-01-13 01:23:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 7089. [2019-01-13 01:23:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7089 states. [2019-01-13 01:23:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7089 states to 7089 states and 16737 transitions. [2019-01-13 01:23:12,099 INFO L78 Accepts]: Start accepts. Automaton has 7089 states and 16737 transitions. Word has length 95 [2019-01-13 01:23:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:12,099 INFO L480 AbstractCegarLoop]: Abstraction has 7089 states and 16737 transitions. [2019-01-13 01:23:12,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:23:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 7089 states and 16737 transitions. [2019-01-13 01:23:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 01:23:12,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:12,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:12,108 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:12,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:12,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1851800219, now seen corresponding path program 2 times [2019-01-13 01:23:12,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:12,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:12,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:12,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:12,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:12,345 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 01:23:12,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:12,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:23:12,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:23:12,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:23:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:23:12,347 INFO L87 Difference]: Start difference. First operand 7089 states and 16737 transitions. Second operand 4 states. [2019-01-13 01:23:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:12,564 INFO L93 Difference]: Finished difference Result 7733 states and 18100 transitions. [2019-01-13 01:23:12,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:23:12,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-13 01:23:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:12,575 INFO L225 Difference]: With dead ends: 7733 [2019-01-13 01:23:12,575 INFO L226 Difference]: Without dead ends: 7733 [2019-01-13 01:23:12,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 01:23:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7733 states. [2019-01-13 01:23:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7733 to 7201. [2019-01-13 01:23:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7201 states. [2019-01-13 01:23:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7201 states to 7201 states and 16936 transitions. [2019-01-13 01:23:12,654 INFO L78 Accepts]: Start accepts. Automaton has 7201 states and 16936 transitions. Word has length 95 [2019-01-13 01:23:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:12,654 INFO L480 AbstractCegarLoop]: Abstraction has 7201 states and 16936 transitions. [2019-01-13 01:23:12,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:23:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 7201 states and 16936 transitions. [2019-01-13 01:23:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:12,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:12,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:12,663 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:12,663 INFO L82 PathProgramCache]: Analyzing trace with hash -542177049, now seen corresponding path program 1 times [2019-01-13 01:23:12,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:12,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:12,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:12,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:23:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:12,947 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 01:23:12,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:12,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:23:12,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:23:12,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:23:12,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:12,948 INFO L87 Difference]: Start difference. First operand 7201 states and 16936 transitions. Second operand 7 states. [2019-01-13 01:23:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:13,750 INFO L93 Difference]: Finished difference Result 8636 states and 20372 transitions. [2019-01-13 01:23:13,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:13,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-01-13 01:23:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:13,763 INFO L225 Difference]: With dead ends: 8636 [2019-01-13 01:23:13,763 INFO L226 Difference]: Without dead ends: 8636 [2019-01-13 01:23:13,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8636 states. [2019-01-13 01:23:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8636 to 7386. [2019-01-13 01:23:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7386 states. [2019-01-13 01:23:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7386 states to 7386 states and 17500 transitions. [2019-01-13 01:23:13,851 INFO L78 Accepts]: Start accepts. Automaton has 7386 states and 17500 transitions. Word has length 97 [2019-01-13 01:23:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:13,851 INFO L480 AbstractCegarLoop]: Abstraction has 7386 states and 17500 transitions. [2019-01-13 01:23:13,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:23:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 7386 states and 17500 transitions. [2019-01-13 01:23:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:13,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:13,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:13,863 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1080620369, now seen corresponding path program 1 times [2019-01-13 01:23:13,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:13,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:13,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:14,234 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 01:23:14,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:14,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:14,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:14,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:14,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:14,239 INFO L87 Difference]: Start difference. First operand 7386 states and 17500 transitions. Second operand 5 states. [2019-01-13 01:23:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:15,190 INFO L93 Difference]: Finished difference Result 8337 states and 19635 transitions. [2019-01-13 01:23:15,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:15,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-01-13 01:23:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:15,201 INFO L225 Difference]: With dead ends: 8337 [2019-01-13 01:23:15,201 INFO L226 Difference]: Without dead ends: 8337 [2019-01-13 01:23:15,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8337 states. [2019-01-13 01:23:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8337 to 6413. [2019-01-13 01:23:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2019-01-13 01:23:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 15160 transitions. [2019-01-13 01:23:15,280 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 15160 transitions. Word has length 97 [2019-01-13 01:23:15,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:15,280 INFO L480 AbstractCegarLoop]: Abstraction has 6413 states and 15160 transitions. [2019-01-13 01:23:15,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 15160 transitions. [2019-01-13 01:23:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:15,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:15,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:15,291 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:15,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:15,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1335356914, now seen corresponding path program 1 times [2019-01-13 01:23:15,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:15,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:15,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:15,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:15,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:15,496 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 01:23:15,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:15,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:15,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:15,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:15,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:15,498 INFO L87 Difference]: Start difference. First operand 6413 states and 15160 transitions. Second operand 5 states. [2019-01-13 01:23:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:16,043 INFO L93 Difference]: Finished difference Result 10470 states and 24807 transitions. [2019-01-13 01:23:16,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:23:16,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-01-13 01:23:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:16,058 INFO L225 Difference]: With dead ends: 10470 [2019-01-13 01:23:16,059 INFO L226 Difference]: Without dead ends: 10392 [2019-01-13 01:23:16,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:23:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10392 states. [2019-01-13 01:23:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10392 to 7512. [2019-01-13 01:23:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7512 states. [2019-01-13 01:23:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7512 states to 7512 states and 17828 transitions. [2019-01-13 01:23:16,158 INFO L78 Accepts]: Start accepts. Automaton has 7512 states and 17828 transitions. Word has length 97 [2019-01-13 01:23:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:16,158 INFO L480 AbstractCegarLoop]: Abstraction has 7512 states and 17828 transitions. [2019-01-13 01:23:16,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 7512 states and 17828 transitions. [2019-01-13 01:23:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:16,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:16,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:16,167 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:16,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:16,168 INFO L82 PathProgramCache]: Analyzing trace with hash -90592433, now seen corresponding path program 1 times [2019-01-13 01:23:16,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:16,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:16,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:16,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:16,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:16,421 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 01:23:16,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:16,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 01:23:16,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 01:23:16,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 01:23:16,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:23:16,422 INFO L87 Difference]: Start difference. First operand 7512 states and 17828 transitions. Second operand 9 states. [2019-01-13 01:23:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:17,119 INFO L93 Difference]: Finished difference Result 10170 states and 24028 transitions. [2019-01-13 01:23:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 01:23:17,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-01-13 01:23:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:17,134 INFO L225 Difference]: With dead ends: 10170 [2019-01-13 01:23:17,134 INFO L226 Difference]: Without dead ends: 10138 [2019-01-13 01:23:17,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-01-13 01:23:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10138 states. [2019-01-13 01:23:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10138 to 8990. [2019-01-13 01:23:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8990 states. [2019-01-13 01:23:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 21261 transitions. [2019-01-13 01:23:17,240 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 21261 transitions. Word has length 97 [2019-01-13 01:23:17,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:17,240 INFO L480 AbstractCegarLoop]: Abstraction has 8990 states and 21261 transitions. [2019-01-13 01:23:17,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 01:23:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 21261 transitions. [2019-01-13 01:23:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:17,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:17,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:17,251 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1887543792, now seen corresponding path program 1 times [2019-01-13 01:23:17,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:17,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:17,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:17,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:17,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:18,116 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 01:23:18,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:18,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 01:23:18,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 01:23:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 01:23:18,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:18,120 INFO L87 Difference]: Start difference. First operand 8990 states and 21261 transitions. Second operand 8 states. [2019-01-13 01:23:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:18,997 INFO L93 Difference]: Finished difference Result 15259 states and 36630 transitions. [2019-01-13 01:23:18,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 01:23:18,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-01-13 01:23:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:19,020 INFO L225 Difference]: With dead ends: 15259 [2019-01-13 01:23:19,020 INFO L226 Difference]: Without dead ends: 15259 [2019-01-13 01:23:19,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-01-13 01:23:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15259 states. [2019-01-13 01:23:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15259 to 9590. [2019-01-13 01:23:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9590 states. [2019-01-13 01:23:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 22862 transitions. [2019-01-13 01:23:19,195 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 22862 transitions. Word has length 97 [2019-01-13 01:23:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:19,195 INFO L480 AbstractCegarLoop]: Abstraction has 9590 states and 22862 transitions. [2019-01-13 01:23:19,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 01:23:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 22862 transitions. [2019-01-13 01:23:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:19,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:19,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:19,208 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1000040111, now seen corresponding path program 1 times [2019-01-13 01:23:19,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:19,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:19,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:19,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:19,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:19,595 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 01:23:19,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:19,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 01:23:19,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 01:23:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 01:23:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-13 01:23:19,598 INFO L87 Difference]: Start difference. First operand 9590 states and 22862 transitions. Second operand 10 states. [2019-01-13 01:23:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:20,558 INFO L93 Difference]: Finished difference Result 12782 states and 30529 transitions. [2019-01-13 01:23:20,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 01:23:20,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-01-13 01:23:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:20,575 INFO L225 Difference]: With dead ends: 12782 [2019-01-13 01:23:20,575 INFO L226 Difference]: Without dead ends: 12782 [2019-01-13 01:23:20,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-01-13 01:23:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12782 states. [2019-01-13 01:23:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12782 to 10514. [2019-01-13 01:23:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10514 states. [2019-01-13 01:23:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10514 states to 10514 states and 24978 transitions. [2019-01-13 01:23:20,806 INFO L78 Accepts]: Start accepts. Automaton has 10514 states and 24978 transitions. Word has length 97 [2019-01-13 01:23:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:20,806 INFO L480 AbstractCegarLoop]: Abstraction has 10514 states and 24978 transitions. [2019-01-13 01:23:20,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 01:23:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 10514 states and 24978 transitions. [2019-01-13 01:23:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:20,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:20,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:20,818 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1562951633, now seen corresponding path program 1 times [2019-01-13 01:23:20,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:20,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:20,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:20,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:20,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:21,063 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 01:23:21,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:21,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:23:21,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:23:21,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:23:21,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:23:21,064 INFO L87 Difference]: Start difference. First operand 10514 states and 24978 transitions. Second operand 6 states. [2019-01-13 01:23:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:21,214 INFO L93 Difference]: Finished difference Result 10242 states and 24026 transitions. [2019-01-13 01:23:21,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:21,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-01-13 01:23:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:21,229 INFO L225 Difference]: With dead ends: 10242 [2019-01-13 01:23:21,229 INFO L226 Difference]: Without dead ends: 10242 [2019-01-13 01:23:21,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states. [2019-01-13 01:23:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 7338. [2019-01-13 01:23:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7338 states. [2019-01-13 01:23:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7338 states to 7338 states and 17211 transitions. [2019-01-13 01:23:21,330 INFO L78 Accepts]: Start accepts. Automaton has 7338 states and 17211 transitions. Word has length 97 [2019-01-13 01:23:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:21,330 INFO L480 AbstractCegarLoop]: Abstraction has 7338 states and 17211 transitions. [2019-01-13 01:23:21,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:23:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 7338 states and 17211 transitions. [2019-01-13 01:23:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:21,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:21,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:21,339 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:21,339 INFO L82 PathProgramCache]: Analyzing trace with hash -529897289, now seen corresponding path program 1 times [2019-01-13 01:23:21,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:21,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:21,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:21,795 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 01:23:21,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:21,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:21,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:21,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:21,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:21,797 INFO L87 Difference]: Start difference. First operand 7338 states and 17211 transitions. Second operand 5 states. [2019-01-13 01:23:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:21,849 INFO L93 Difference]: Finished difference Result 7338 states and 17195 transitions. [2019-01-13 01:23:21,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:23:21,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-01-13 01:23:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:21,860 INFO L225 Difference]: With dead ends: 7338 [2019-01-13 01:23:21,860 INFO L226 Difference]: Without dead ends: 7338 [2019-01-13 01:23:21,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:23:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7338 states. [2019-01-13 01:23:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7338 to 7338. [2019-01-13 01:23:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7338 states. [2019-01-13 01:23:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7338 states to 7338 states and 17195 transitions. [2019-01-13 01:23:21,936 INFO L78 Accepts]: Start accepts. Automaton has 7338 states and 17195 transitions. Word has length 99 [2019-01-13 01:23:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:21,937 INFO L480 AbstractCegarLoop]: Abstraction has 7338 states and 17195 transitions. [2019-01-13 01:23:21,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7338 states and 17195 transitions. [2019-01-13 01:23:21,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:21,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:21,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:21,946 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:21,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:21,946 INFO L82 PathProgramCache]: Analyzing trace with hash 357606392, now seen corresponding path program 1 times [2019-01-13 01:23:21,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:21,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:21,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:21,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:21,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:22,194 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 01:23:22,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:22,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 01:23:22,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 01:23:22,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 01:23:22,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 01:23:22,195 INFO L87 Difference]: Start difference. First operand 7338 states and 17195 transitions. Second operand 10 states. [2019-01-13 01:23:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:23,275 INFO L93 Difference]: Finished difference Result 10504 states and 24507 transitions. [2019-01-13 01:23:23,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 01:23:23,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2019-01-13 01:23:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:23,287 INFO L225 Difference]: With dead ends: 10504 [2019-01-13 01:23:23,288 INFO L226 Difference]: Without dead ends: 8056 [2019-01-13 01:23:23,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-13 01:23:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2019-01-13 01:23:23,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 7471. [2019-01-13 01:23:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7471 states. [2019-01-13 01:23:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7471 states to 7471 states and 17468 transitions. [2019-01-13 01:23:23,370 INFO L78 Accepts]: Start accepts. Automaton has 7471 states and 17468 transitions. Word has length 99 [2019-01-13 01:23:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:23,371 INFO L480 AbstractCegarLoop]: Abstraction has 7471 states and 17468 transitions. [2019-01-13 01:23:23,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 01:23:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7471 states and 17468 transitions. [2019-01-13 01:23:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:23,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:23,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:23,380 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:23,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1814131433, now seen corresponding path program 1 times [2019-01-13 01:23:23,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:23,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:23,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:23,813 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 01:23:24,082 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-13 01:23:24,103 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 01:23:24,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:24,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:23:24,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:23:24,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:23:24,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:23:24,104 INFO L87 Difference]: Start difference. First operand 7471 states and 17468 transitions. Second operand 6 states. [2019-01-13 01:23:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:24,348 INFO L93 Difference]: Finished difference Result 8972 states and 20330 transitions. [2019-01-13 01:23:24,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:24,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-01-13 01:23:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:24,362 INFO L225 Difference]: With dead ends: 8972 [2019-01-13 01:23:24,362 INFO L226 Difference]: Without dead ends: 8939 [2019-01-13 01:23:24,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8939 states. [2019-01-13 01:23:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8939 to 7538. [2019-01-13 01:23:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7538 states. [2019-01-13 01:23:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7538 states to 7538 states and 17250 transitions. [2019-01-13 01:23:24,450 INFO L78 Accepts]: Start accepts. Automaton has 7538 states and 17250 transitions. Word has length 99 [2019-01-13 01:23:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:24,451 INFO L480 AbstractCegarLoop]: Abstraction has 7538 states and 17250 transitions. [2019-01-13 01:23:24,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:23:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 7538 states and 17250 transitions. [2019-01-13 01:23:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:24,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:24,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:24,460 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:24,460 INFO L82 PathProgramCache]: Analyzing trace with hash -705952148, now seen corresponding path program 1 times [2019-01-13 01:23:24,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:24,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:24,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:24,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:24,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:24,790 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 01:23:24,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:24,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:24,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:24,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:24,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:24,794 INFO L87 Difference]: Start difference. First operand 7538 states and 17250 transitions. Second operand 5 states. [2019-01-13 01:23:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:25,269 INFO L93 Difference]: Finished difference Result 8815 states and 20021 transitions. [2019-01-13 01:23:25,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:23:25,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-01-13 01:23:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:25,284 INFO L225 Difference]: With dead ends: 8815 [2019-01-13 01:23:25,285 INFO L226 Difference]: Without dead ends: 8733 [2019-01-13 01:23:25,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8733 states. [2019-01-13 01:23:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8733 to 6949. [2019-01-13 01:23:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6949 states. [2019-01-13 01:23:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6949 states to 6949 states and 16006 transitions. [2019-01-13 01:23:25,370 INFO L78 Accepts]: Start accepts. Automaton has 6949 states and 16006 transitions. Word has length 99 [2019-01-13 01:23:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:25,370 INFO L480 AbstractCegarLoop]: Abstraction has 6949 states and 16006 transitions. [2019-01-13 01:23:25,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 6949 states and 16006 transitions. [2019-01-13 01:23:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:25,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:25,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:25,379 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:25,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:25,379 INFO L82 PathProgramCache]: Analyzing trace with hash -12850451, now seen corresponding path program 2 times [2019-01-13 01:23:25,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:25,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:25,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:25,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:25,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:25,894 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 01:23:25,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:25,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:23:25,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:23:25,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:23:25,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:23:25,897 INFO L87 Difference]: Start difference. First operand 6949 states and 16006 transitions. Second operand 6 states. [2019-01-13 01:23:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:26,294 INFO L93 Difference]: Finished difference Result 7444 states and 17018 transitions. [2019-01-13 01:23:26,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:23:26,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-01-13 01:23:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:26,304 INFO L225 Difference]: With dead ends: 7444 [2019-01-13 01:23:26,304 INFO L226 Difference]: Without dead ends: 7444 [2019-01-13 01:23:26,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7444 states. [2019-01-13 01:23:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7444 to 7309. [2019-01-13 01:23:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7309 states. [2019-01-13 01:23:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7309 states to 7309 states and 16732 transitions. [2019-01-13 01:23:26,386 INFO L78 Accepts]: Start accepts. Automaton has 7309 states and 16732 transitions. Word has length 99 [2019-01-13 01:23:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:26,387 INFO L480 AbstractCegarLoop]: Abstraction has 7309 states and 16732 transitions. [2019-01-13 01:23:26,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:23:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7309 states and 16732 transitions. [2019-01-13 01:23:26,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:26,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:26,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:26,396 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:26,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:26,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2032139224, now seen corresponding path program 2 times [2019-01-13 01:23:26,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:26,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:26,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:26,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:23:26,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:26,585 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 01:23:26,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:26,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 01:23:26,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 01:23:26,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 01:23:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:23:26,587 INFO L87 Difference]: Start difference. First operand 7309 states and 16732 transitions. Second operand 9 states. [2019-01-13 01:23:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:26,790 INFO L93 Difference]: Finished difference Result 10484 states and 23979 transitions. [2019-01-13 01:23:26,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:23:26,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-01-13 01:23:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:26,797 INFO L225 Difference]: With dead ends: 10484 [2019-01-13 01:23:26,797 INFO L226 Difference]: Without dead ends: 3386 [2019-01-13 01:23:26,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-13 01:23:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2019-01-13 01:23:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3386. [2019-01-13 01:23:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-01-13 01:23:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 7668 transitions. [2019-01-13 01:23:26,833 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 7668 transitions. Word has length 99 [2019-01-13 01:23:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:26,834 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 7668 transitions. [2019-01-13 01:23:26,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 01:23:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 7668 transitions. [2019-01-13 01:23:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:26,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:26,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:26,839 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:26,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1546893730, now seen corresponding path program 3 times [2019-01-13 01:23:26,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:26,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:26,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:23:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:27,019 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 01:23:27,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:27,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 01:23:27,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 01:23:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 01:23:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 01:23:27,020 INFO L87 Difference]: Start difference. First operand 3386 states and 7668 transitions. Second operand 11 states. [2019-01-13 01:23:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:28,066 INFO L93 Difference]: Finished difference Result 6993 states and 15902 transitions. [2019-01-13 01:23:28,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:23:28,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-01-13 01:23:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:28,074 INFO L225 Difference]: With dead ends: 6993 [2019-01-13 01:23:28,074 INFO L226 Difference]: Without dead ends: 4514 [2019-01-13 01:23:28,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-01-13 01:23:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4514 states. [2019-01-13 01:23:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4514 to 3417. [2019-01-13 01:23:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-01-13 01:23:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 7684 transitions. [2019-01-13 01:23:28,114 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 7684 transitions. Word has length 99 [2019-01-13 01:23:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:28,114 INFO L480 AbstractCegarLoop]: Abstraction has 3417 states and 7684 transitions. [2019-01-13 01:23:28,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 01:23:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 7684 transitions. [2019-01-13 01:23:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:28,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:28,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:23:28,119 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:28,119 INFO L82 PathProgramCache]: Analyzing trace with hash -275361982, now seen corresponding path program 4 times [2019-01-13 01:23:28,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:28,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:28,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:23:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:23:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:23:28,198 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 01:23:28,399 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 01:23:28,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 01:23:28 BasicIcfg [2019-01-13 01:23:28,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 01:23:28,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 01:23:28,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 01:23:28,402 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 01:23:28,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:22:27" (3/4) ... [2019-01-13 01:23:28,409 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 01:23:28,581 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 01:23:28,581 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 01:23:28,584 INFO L168 Benchmark]: Toolchain (without parser) took 63163.42 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 952.7 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-13 01:23:28,585 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 01:23:28,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-13 01:23:28,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.11 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-13 01:23:28,589 INFO L168 Benchmark]: Boogie Preprocessor took 58.05 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 01:23:28,591 INFO L168 Benchmark]: RCFGBuilder took 1211.59 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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-01-13 01:23:28,591 INFO L168 Benchmark]: TraceAbstraction took 60808.40 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 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-13 01:23:28,595 INFO L168 Benchmark]: Witness Printer took 179.22 ms. Allocated memory is still 4.5 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-01-13 01:23:28,598 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 837.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.11 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.05 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 1211.59 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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60808.40 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 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 179.22 ms. Allocated memory is still 4.5 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L682] -1 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L683] -1 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L684] -1 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L685] -1 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L686] -1 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L687] -1 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L688] -1 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L689] -1 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L690] -1 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L691] -1 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L692] -1 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L693] -1 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L694] -1 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L695] -1 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L696] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L697] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L699] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L704] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L705] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L790] -1 pthread_t t843; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t843, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L709] 0 a$w_buff1 = a$w_buff0 [L710] 0 a$w_buff0 = 1 [L711] 0 a$w_buff1_used = a$w_buff0_used [L712] 0 a$w_buff0_used = (_Bool)1 [L792] -1 pthread_t t844; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t844, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L714] 0 a$r_buff1_thd0 = a$r_buff0_thd0 [L715] 0 a$r_buff1_thd1 = a$r_buff0_thd1 [L716] 0 a$r_buff1_thd2 = a$r_buff0_thd2 [L717] 0 a$r_buff0_thd1 = (_Bool)1 [L720] 0 x = 1 [L723] 0 __unbuffered_p0_EAX = x [L726] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L729] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L743] 1 y = 1 [L746] 1 z = 1 [L749] 1 __unbuffered_p1_EAX = z [L752] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L753] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L754] 1 a$flush_delayed = weak$$choice2 [L755] 1 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L756] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L729] 0 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L730] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L756] 1 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L730] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L731] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L731] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L757] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] 0 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L733] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L733] 0 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L736] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L757] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L758] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L758] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L759] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L759] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L760] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L760] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L761] 1 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L762] EXPR 1 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L762] 1 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 1 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L764] EXPR 1 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$flush_delayed ? a$mem_tmp : a [L765] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] -1 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L800] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L800] -1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L801] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L801] -1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L802] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L802] -1 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L803] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L803] -1 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L806] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 226 locations, 3 error locations. UNSAFE Result, 60.5s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 31.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9464 SDtfs, 10781 SDslu, 22886 SDs, 0 SdLazy, 9878 SolverSat, 553 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 91 SyntacticMatches, 29 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74884occurred in iteration=6, 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.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 130803 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 2839 NumberOfCodeBlocks, 2839 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2705 ConstructedInterpolants, 0 QuantifiedInterpolants, 658282 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...