./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe022_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/safe022_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 93cb2c4090f541459da4de0159a7e8a446889601 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2019-01-01 00:12:06,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:12:06,477 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:12:06,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:12:06,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:12:06,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:12:06,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:12:06,495 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:12:06,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:12:06,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:12:06,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:12:06,499 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:12:06,500 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:12:06,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:12:06,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:12:06,503 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:12:06,504 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:12:06,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:12:06,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:12:06,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:12:06,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:12:06,511 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:12:06,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:12:06,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:12:06,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:12:06,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:12:06,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:12:06,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:12:06,518 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:12:06,519 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:12:06,519 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:12:06,520 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:12:06,520 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:12:06,521 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:12:06,522 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:12:06,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:12:06,523 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:12:06,543 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:12:06,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:12:06,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:12:06,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:12:06,545 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:12:06,546 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:12:06,546 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:12:06,546 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:12:06,546 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:12:06,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:12:06,546 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:12:06,547 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:12:06,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:12:06,548 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:12:06,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:12:06,548 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:12:06,548 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:12:06,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:12:06,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:12:06,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:12:06,549 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:12:06,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:12:06,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:12:06,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:12:06,551 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:12:06,551 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:12:06,552 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:12:06,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:12:06,552 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 -> 93cb2c4090f541459da4de0159a7e8a446889601 [2019-01-01 00:12:06,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:12:06,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:12:06,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:12:06,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:12:06,619 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:12:06,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe022_rmo.oepc_false-unreach-call.i [2019-01-01 00:12:06,697 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df410349/cc3e4717245d47ea9877043c4c263a1d/FLAG382d385b0 [2019-01-01 00:12:07,307 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:12:07,307 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe022_rmo.oepc_false-unreach-call.i [2019-01-01 00:12:07,325 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df410349/cc3e4717245d47ea9877043c4c263a1d/FLAG382d385b0 [2019-01-01 00:12:07,585 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df410349/cc3e4717245d47ea9877043c4c263a1d [2019-01-01 00:12:07,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:12:07,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:12:07,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:12:07,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:12:07,605 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:12:07,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:12:07" (1/1) ... [2019-01-01 00:12:07,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7719c6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:07, skipping insertion in model container [2019-01-01 00:12:07,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:12:07" (1/1) ... [2019-01-01 00:12:07,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:12:07,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:12:08,202 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:12:08,225 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:12:08,405 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:12:08,489 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:12:08,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08 WrapperNode [2019-01-01 00:12:08,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:12:08,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:12:08,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:12:08,491 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:12:08,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08" (1/1) ... [2019-01-01 00:12:08,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08" (1/1) ... [2019-01-01 00:12:08,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:12:08,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:12:08,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:12:08,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:12:08,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08" (1/1) ... [2019-01-01 00:12:08,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08" (1/1) ... [2019-01-01 00:12:08,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08" (1/1) ... [2019-01-01 00:12:08,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08" (1/1) ... [2019-01-01 00:12:08,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08" (1/1) ... [2019-01-01 00:12:08,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08" (1/1) ... [2019-01-01 00:12:08,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08" (1/1) ... [2019-01-01 00:12:08,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:12:08,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:12:08,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:12:08,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:12:08,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08" (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-01 00:12:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:12:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:12:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:12:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:12:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:12:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:12:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:12:08,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:12:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:12:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:12:08,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:12:08,695 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:12:09,864 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:12:09,864 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 00:12:09,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:12:09 BoogieIcfgContainer [2019-01-01 00:12:09,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:12:09,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:12:09,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:12:09,873 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:12:09,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:12:07" (1/3) ... [2019-01-01 00:12:09,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e03203e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:12:09, skipping insertion in model container [2019-01-01 00:12:09,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:12:08" (2/3) ... [2019-01-01 00:12:09,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e03203e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:12:09, skipping insertion in model container [2019-01-01 00:12:09,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:12:09" (3/3) ... [2019-01-01 00:12:09,877 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_rmo.oepc_false-unreach-call.i [2019-01-01 00:12:09,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,925 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,925 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,925 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,926 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,926 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,937 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,941 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:09,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:12:10,006 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:12:10,007 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:12:10,015 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-01 00:12:10,031 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-01 00:12:10,056 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:12:10,056 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:12:10,057 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:12:10,057 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:12:10,057 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:12:10,057 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:12:10,057 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:12:10,057 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:12:10,058 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:12:10,073 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2019-01-01 00:12:12,720 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2019-01-01 00:12:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2019-01-01 00:12:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 00:12:12,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:12,734 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] [2019-01-01 00:12:12,737 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:12,747 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2019-01-01 00:12:12,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:12,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:12,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:12,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:12,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:13,140 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-01 00:12:13,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:13,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:12:13,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:12:13,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:12:13,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:12:13,171 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2019-01-01 00:12:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:14,716 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2019-01-01 00:12:14,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:12:14,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-01 00:12:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:15,070 INFO L225 Difference]: With dead ends: 60790 [2019-01-01 00:12:15,071 INFO L226 Difference]: Without dead ends: 44270 [2019-01-01 00:12:15,073 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-01 00:12:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2019-01-01 00:12:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2019-01-01 00:12:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2019-01-01 00:12:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2019-01-01 00:12:16,935 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2019-01-01 00:12:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:16,936 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2019-01-01 00:12:16,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:12:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2019-01-01 00:12:16,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 00:12:16,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:16,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:16,948 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:16,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:16,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2019-01-01 00:12:16,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:16,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:16,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:17,065 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-01 00:12:17,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:17,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:12:17,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:12:17,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:12:17,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:12:17,069 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2019-01-01 00:12:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:17,440 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2019-01-01 00:12:17,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:12:17,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-01 00:12:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:17,470 INFO L225 Difference]: With dead ends: 8528 [2019-01-01 00:12:17,470 INFO L226 Difference]: Without dead ends: 7466 [2019-01-01 00:12:17,472 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-01 00:12:17,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2019-01-01 00:12:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2019-01-01 00:12:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2019-01-01 00:12:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2019-01-01 00:12:17,706 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2019-01-01 00:12:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:17,707 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2019-01-01 00:12:17,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:12:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2019-01-01 00:12:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 00:12:17,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:17,712 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] [2019-01-01 00:12:17,712 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2019-01-01 00:12:17,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:17,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:17,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:17,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:17,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:18,073 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-01 00:12:18,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:18,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:12:18,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:12:18,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:12:18,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:12:18,075 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2019-01-01 00:12:19,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:19,458 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2019-01-01 00:12:19,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:12:19,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-01 00:12:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:19,511 INFO L225 Difference]: With dead ends: 13998 [2019-01-01 00:12:19,511 INFO L226 Difference]: Without dead ends: 13930 [2019-01-01 00:12:19,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:12:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2019-01-01 00:12:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2019-01-01 00:12:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2019-01-01 00:12:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2019-01-01 00:12:20,196 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2019-01-01 00:12:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:20,200 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2019-01-01 00:12:20,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:12:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2019-01-01 00:12:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 00:12:20,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:20,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:20,205 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:20,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2019-01-01 00:12:20,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:20,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:20,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:20,334 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-01 00:12:20,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:20,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:12:20,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:12:20,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:12:20,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:12:20,336 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2019-01-01 00:12:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:20,455 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2019-01-01 00:12:20,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:12:20,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-01-01 00:12:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:20,490 INFO L225 Difference]: With dead ends: 13279 [2019-01-01 00:12:20,490 INFO L226 Difference]: Without dead ends: 13279 [2019-01-01 00:12:20,490 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-01 00:12:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2019-01-01 00:12:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2019-01-01 00:12:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2019-01-01 00:12:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2019-01-01 00:12:20,766 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2019-01-01 00:12:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:20,766 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2019-01-01 00:12:20,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:12:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2019-01-01 00:12:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 00:12:20,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:20,770 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-01 00:12:20,771 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:20,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2019-01-01 00:12:20,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:20,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:20,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:20,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:21,105 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 00:12:21,210 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-01 00:12:21,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:21,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:12:21,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:12:21,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:12:21,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:12:21,213 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2019-01-01 00:12:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:22,299 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2019-01-01 00:12:22,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 00:12:22,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-01-01 00:12:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:22,329 INFO L225 Difference]: With dead ends: 12285 [2019-01-01 00:12:22,329 INFO L226 Difference]: Without dead ends: 12213 [2019-01-01 00:12:22,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-01 00:12:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2019-01-01 00:12:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2019-01-01 00:12:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2019-01-01 00:12:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2019-01-01 00:12:22,592 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2019-01-01 00:12:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:22,592 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2019-01-01 00:12:22,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:12:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2019-01-01 00:12:22,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-01 00:12:22,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:22,600 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] [2019-01-01 00:12:22,600 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2019-01-01 00:12:22,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:22,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:22,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:12:22,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:22,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:12:22,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:12:22,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:12:22,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:12:22,826 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2019-01-01 00:12:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:23,157 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2019-01-01 00:12:23,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:12:23,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-01-01 00:12:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:23,183 INFO L225 Difference]: With dead ends: 12396 [2019-01-01 00:12:23,184 INFO L226 Difference]: Without dead ends: 12396 [2019-01-01 00:12:23,184 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-01 00:12:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2019-01-01 00:12:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2019-01-01 00:12:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2019-01-01 00:12:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2019-01-01 00:12:23,490 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2019-01-01 00:12:23,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:23,490 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2019-01-01 00:12:23,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:12:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2019-01-01 00:12:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-01 00:12:23,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:23,500 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] [2019-01-01 00:12:23,500 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:23,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2019-01-01 00:12:23,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:23,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:23,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:23,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:23,918 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-01 00:12:23,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:23,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:12:23,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:12:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:12:23,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:12:23,920 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2019-01-01 00:12:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:25,026 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2019-01-01 00:12:25,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:12:25,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-01-01 00:12:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:25,071 INFO L225 Difference]: With dead ends: 20969 [2019-01-01 00:12:25,072 INFO L226 Difference]: Without dead ends: 20898 [2019-01-01 00:12:25,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:12:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2019-01-01 00:12:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2019-01-01 00:12:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2019-01-01 00:12:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2019-01-01 00:12:25,781 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2019-01-01 00:12:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:25,781 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2019-01-01 00:12:25,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:12:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2019-01-01 00:12:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-01 00:12:25,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:25,795 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-01 00:12:25,796 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:25,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1699576415, now seen corresponding path program 1 times [2019-01-01 00:12:25,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:25,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:25,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:25,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:25,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:26,055 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-01 00:12:26,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:26,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:12:26,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:12:26,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:12:26,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:12:26,057 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2019-01-01 00:12:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:26,646 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2019-01-01 00:12:26,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:12:26,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-01 00:12:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:26,680 INFO L225 Difference]: With dead ends: 17635 [2019-01-01 00:12:26,680 INFO L226 Difference]: Without dead ends: 17635 [2019-01-01 00:12:26,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:12:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2019-01-01 00:12:26,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2019-01-01 00:12:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2019-01-01 00:12:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2019-01-01 00:12:26,970 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2019-01-01 00:12:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:26,971 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2019-01-01 00:12:26,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:12:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2019-01-01 00:12:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-01 00:12:26,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:26,986 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-01 00:12:26,986 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:26,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash -377632928, now seen corresponding path program 1 times [2019-01-01 00:12:26,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:26,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:26,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:26,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:26,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:27,107 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-01 00:12:27,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:27,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:12:27,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:12:27,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:12:27,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:12:27,109 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2019-01-01 00:12:27,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:27,429 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2019-01-01 00:12:27,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:12:27,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-01 00:12:27,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:27,458 INFO L225 Difference]: With dead ends: 16385 [2019-01-01 00:12:27,459 INFO L226 Difference]: Without dead ends: 16385 [2019-01-01 00:12:27,459 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-01 00:12:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2019-01-01 00:12:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2019-01-01 00:12:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2019-01-01 00:12:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2019-01-01 00:12:27,709 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2019-01-01 00:12:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:27,709 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2019-01-01 00:12:27,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:12:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2019-01-01 00:12:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-01 00:12:27,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:27,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:27,723 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:27,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:27,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1938632710, now seen corresponding path program 1 times [2019-01-01 00:12:27,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:27,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:27,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:27,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:27,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:27,944 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-01 00:12:27,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:27,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:12:27,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:12:27,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:12:27,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:12:27,946 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2019-01-01 00:12:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:29,738 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2019-01-01 00:12:29,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:12:29,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-01 00:12:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:29,776 INFO L225 Difference]: With dead ends: 19821 [2019-01-01 00:12:29,776 INFO L226 Difference]: Without dead ends: 19821 [2019-01-01 00:12:29,777 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-01 00:12:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2019-01-01 00:12:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2019-01-01 00:12:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2019-01-01 00:12:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2019-01-01 00:12:30,083 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2019-01-01 00:12:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:30,083 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2019-01-01 00:12:30,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:12:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2019-01-01 00:12:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-01 00:12:30,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:30,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:30,098 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash -138576633, now seen corresponding path program 1 times [2019-01-01 00:12:30,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:30,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:30,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:30,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:30,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:30,496 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-01 00:12:30,575 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-01 00:12:30,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:30,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:12:30,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:12:30,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:12:30,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:12:30,576 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2019-01-01 00:12:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:31,347 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2019-01-01 00:12:31,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:12:31,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-01 00:12:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:31,384 INFO L225 Difference]: With dead ends: 21449 [2019-01-01 00:12:31,384 INFO L226 Difference]: Without dead ends: 21449 [2019-01-01 00:12:31,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:12:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2019-01-01 00:12:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2019-01-01 00:12:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2019-01-01 00:12:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2019-01-01 00:12:31,706 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2019-01-01 00:12:31,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:31,706 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2019-01-01 00:12:31,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:12:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2019-01-01 00:12:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-01 00:12:31,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:31,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:31,720 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:31,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:31,720 INFO L82 PathProgramCache]: Analyzing trace with hash 72774280, now seen corresponding path program 1 times [2019-01-01 00:12:31,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:31,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:31,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:31,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:31,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:32,158 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-01 00:12:32,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:32,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:12:32,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:12:32,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:12:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:12:32,161 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2019-01-01 00:12:33,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:33,427 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2019-01-01 00:12:33,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:12:33,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-01 00:12:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:33,469 INFO L225 Difference]: With dead ends: 25024 [2019-01-01 00:12:33,469 INFO L226 Difference]: Without dead ends: 25024 [2019-01-01 00:12:33,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:12:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2019-01-01 00:12:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2019-01-01 00:12:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2019-01-01 00:12:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2019-01-01 00:12:33,843 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2019-01-01 00:12:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:33,843 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2019-01-01 00:12:33,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:12:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2019-01-01 00:12:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-01 00:12:33,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:33,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:33,857 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:33,858 INFO L82 PathProgramCache]: Analyzing trace with hash -437759897, now seen corresponding path program 1 times [2019-01-01 00:12:33,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:33,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:33,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:33,996 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-01 00:12:33,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:33,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:12:33,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:12:33,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:12:33,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:12:33,997 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 5 states. [2019-01-01 00:12:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:34,054 INFO L93 Difference]: Finished difference Result 7837 states and 18946 transitions. [2019-01-01 00:12:34,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:12:34,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-01 00:12:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:34,064 INFO L225 Difference]: With dead ends: 7837 [2019-01-01 00:12:34,064 INFO L226 Difference]: Without dead ends: 6355 [2019-01-01 00:12:34,065 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-01 00:12:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-01-01 00:12:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5703. [2019-01-01 00:12:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5703 states. [2019-01-01 00:12:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 13364 transitions. [2019-01-01 00:12:34,139 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 13364 transitions. Word has length 66 [2019-01-01 00:12:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:34,139 INFO L480 AbstractCegarLoop]: Abstraction has 5703 states and 13364 transitions. [2019-01-01 00:12:34,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:12:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 13364 transitions. [2019-01-01 00:12:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-01 00:12:34,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:34,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:34,146 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:34,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2019-01-01 00:12:34,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:34,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:34,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:34,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:34,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:34,219 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-01 00:12:34,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:34,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:12:34,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:12:34,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:12:34,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:12:34,221 INFO L87 Difference]: Start difference. First operand 5703 states and 13364 transitions. Second operand 3 states. [2019-01-01 00:12:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:34,325 INFO L93 Difference]: Finished difference Result 7505 states and 17450 transitions. [2019-01-01 00:12:34,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:12:34,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-01 00:12:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:34,334 INFO L225 Difference]: With dead ends: 7505 [2019-01-01 00:12:34,334 INFO L226 Difference]: Without dead ends: 7505 [2019-01-01 00:12:34,335 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-01 00:12:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2019-01-01 00:12:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 5642. [2019-01-01 00:12:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-01-01 00:12:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 12904 transitions. [2019-01-01 00:12:34,405 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 12904 transitions. Word has length 66 [2019-01-01 00:12:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:34,405 INFO L480 AbstractCegarLoop]: Abstraction has 5642 states and 12904 transitions. [2019-01-01 00:12:34,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:12:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 12904 transitions. [2019-01-01 00:12:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-01 00:12:34,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:34,413 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] [2019-01-01 00:12:34,413 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2019-01-01 00:12:34,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:34,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:34,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:34,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:34,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:34,551 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-01 00:12:34,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:34,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:12:34,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:12:34,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:12:34,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:12:34,552 INFO L87 Difference]: Start difference. First operand 5642 states and 12904 transitions. Second operand 5 states. [2019-01-01 00:12:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:34,756 INFO L93 Difference]: Finished difference Result 6806 states and 15528 transitions. [2019-01-01 00:12:34,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:12:34,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-01-01 00:12:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:34,768 INFO L225 Difference]: With dead ends: 6806 [2019-01-01 00:12:34,769 INFO L226 Difference]: Without dead ends: 6806 [2019-01-01 00:12:34,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:12:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6806 states. [2019-01-01 00:12:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6806 to 6086. [2019-01-01 00:12:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6086 states. [2019-01-01 00:12:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 13908 transitions. [2019-01-01 00:12:34,892 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 13908 transitions. Word has length 72 [2019-01-01 00:12:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:34,893 INFO L480 AbstractCegarLoop]: Abstraction has 6086 states and 13908 transitions. [2019-01-01 00:12:34,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:12:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 13908 transitions. [2019-01-01 00:12:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-01 00:12:34,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:34,904 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] [2019-01-01 00:12:34,905 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:34,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:34,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2019-01-01 00:12:34,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:34,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:34,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:35,175 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 00:12:35,388 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-01 00:12:35,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:35,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 00:12:35,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 00:12:35,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 00:12:35,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:12:35,389 INFO L87 Difference]: Start difference. First operand 6086 states and 13908 transitions. Second operand 9 states. [2019-01-01 00:12:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:36,623 INFO L93 Difference]: Finished difference Result 8112 states and 18389 transitions. [2019-01-01 00:12:36,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 00:12:36,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-01-01 00:12:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:36,634 INFO L225 Difference]: With dead ends: 8112 [2019-01-01 00:12:36,635 INFO L226 Difference]: Without dead ends: 7993 [2019-01-01 00:12:36,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-01-01 00:12:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states. [2019-01-01 00:12:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 6183. [2019-01-01 00:12:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6183 states. [2019-01-01 00:12:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 14001 transitions. [2019-01-01 00:12:36,717 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 14001 transitions. Word has length 72 [2019-01-01 00:12:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:36,717 INFO L480 AbstractCegarLoop]: Abstraction has 6183 states and 14001 transitions. [2019-01-01 00:12:36,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 00:12:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 14001 transitions. [2019-01-01 00:12:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:12:36,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:36,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:36,728 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:36,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1174333635, now seen corresponding path program 1 times [2019-01-01 00:12:36,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:36,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:36,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:36,866 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-01 00:12:36,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:36,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:12:36,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:12:36,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:12:36,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:12:36,867 INFO L87 Difference]: Start difference. First operand 6183 states and 14001 transitions. Second operand 4 states. [2019-01-01 00:12:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:37,228 INFO L93 Difference]: Finished difference Result 9854 states and 22232 transitions. [2019-01-01 00:12:37,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:12:37,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-01 00:12:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:37,244 INFO L225 Difference]: With dead ends: 9854 [2019-01-01 00:12:37,244 INFO L226 Difference]: Without dead ends: 9854 [2019-01-01 00:12:37,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:12:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9854 states. [2019-01-01 00:12:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9854 to 7303. [2019-01-01 00:12:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2019-01-01 00:12:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 16335 transitions. [2019-01-01 00:12:37,363 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 16335 transitions. Word has length 91 [2019-01-01 00:12:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:37,363 INFO L480 AbstractCegarLoop]: Abstraction has 7303 states and 16335 transitions. [2019-01-01 00:12:37,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:12:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 16335 transitions. [2019-01-01 00:12:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:12:37,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:37,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:37,376 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:37,376 INFO L82 PathProgramCache]: Analyzing trace with hash 39095599, now seen corresponding path program 1 times [2019-01-01 00:12:37,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:37,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:37,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:37,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:37,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:37,626 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-01 00:12:37,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:37,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:12:37,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:12:37,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:12:37,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:12:37,629 INFO L87 Difference]: Start difference. First operand 7303 states and 16335 transitions. Second operand 4 states. [2019-01-01 00:12:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:37,767 INFO L93 Difference]: Finished difference Result 7805 states and 17493 transitions. [2019-01-01 00:12:37,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:12:37,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-01 00:12:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:37,778 INFO L225 Difference]: With dead ends: 7805 [2019-01-01 00:12:37,778 INFO L226 Difference]: Without dead ends: 7805 [2019-01-01 00:12:37,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:12:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7805 states. [2019-01-01 00:12:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7805 to 7209. [2019-01-01 00:12:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-01-01 00:12:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 16230 transitions. [2019-01-01 00:12:37,860 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 16230 transitions. Word has length 91 [2019-01-01 00:12:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:37,860 INFO L480 AbstractCegarLoop]: Abstraction has 7209 states and 16230 transitions. [2019-01-01 00:12:37,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:12:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 16230 transitions. [2019-01-01 00:12:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:12:37,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:37,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:37,869 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1715163703, now seen corresponding path program 1 times [2019-01-01 00:12:37,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:37,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:37,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:37,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:38,038 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 00:12:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:12:38,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:38,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:12:38,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:12:38,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:12:38,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:12:38,184 INFO L87 Difference]: Start difference. First operand 7209 states and 16230 transitions. Second operand 7 states. [2019-01-01 00:12:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:39,078 INFO L93 Difference]: Finished difference Result 8986 states and 20184 transitions. [2019-01-01 00:12:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:12:39,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:12:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:39,092 INFO L225 Difference]: With dead ends: 8986 [2019-01-01 00:12:39,093 INFO L226 Difference]: Without dead ends: 8986 [2019-01-01 00:12:39,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:12:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8986 states. [2019-01-01 00:12:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8986 to 7321. [2019-01-01 00:12:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-01-01 00:12:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 16550 transitions. [2019-01-01 00:12:39,205 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 16550 transitions. Word has length 93 [2019-01-01 00:12:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:39,206 INFO L480 AbstractCegarLoop]: Abstraction has 7321 states and 16550 transitions. [2019-01-01 00:12:39,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:12:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 16550 transitions. [2019-01-01 00:12:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:12:39,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:39,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:39,215 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:39,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1745561198, now seen corresponding path program 1 times [2019-01-01 00:12:39,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:39,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:39,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:39,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:39,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:39,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-01 00:12:39,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:39,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:12:39,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:12:39,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:12:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:12:39,429 INFO L87 Difference]: Start difference. First operand 7321 states and 16550 transitions. Second operand 5 states. [2019-01-01 00:12:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:39,605 INFO L93 Difference]: Finished difference Result 8130 states and 18286 transitions. [2019-01-01 00:12:39,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:12:39,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-01 00:12:39,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:39,616 INFO L225 Difference]: With dead ends: 8130 [2019-01-01 00:12:39,616 INFO L226 Difference]: Without dead ends: 8130 [2019-01-01 00:12:39,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:12:39,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2019-01-01 00:12:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 6217. [2019-01-01 00:12:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2019-01-01 00:12:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 14069 transitions. [2019-01-01 00:12:39,701 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 14069 transitions. Word has length 93 [2019-01-01 00:12:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:39,702 INFO L480 AbstractCegarLoop]: Abstraction has 6217 states and 14069 transitions. [2019-01-01 00:12:39,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:12:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 14069 transitions. [2019-01-01 00:12:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:12:39,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:39,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:39,710 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:39,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:39,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1490824653, now seen corresponding path program 1 times [2019-01-01 00:12:39,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:39,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:39,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:39,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:39,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:39,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-01 00:12:39,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:39,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:12:39,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:12:39,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:12:39,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:12:39,873 INFO L87 Difference]: Start difference. First operand 6217 states and 14069 transitions. Second operand 5 states. [2019-01-01 00:12:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:40,445 INFO L93 Difference]: Finished difference Result 9852 states and 22424 transitions. [2019-01-01 00:12:40,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:12:40,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-01 00:12:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:40,461 INFO L225 Difference]: With dead ends: 9852 [2019-01-01 00:12:40,461 INFO L226 Difference]: Without dead ends: 9774 [2019-01-01 00:12:40,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:12:40,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2019-01-01 00:12:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 7358. [2019-01-01 00:12:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7358 states. [2019-01-01 00:12:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7358 states to 7358 states and 16716 transitions. [2019-01-01 00:12:40,571 INFO L78 Accepts]: Start accepts. Automaton has 7358 states and 16716 transitions. Word has length 93 [2019-01-01 00:12:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:40,571 INFO L480 AbstractCegarLoop]: Abstraction has 7358 states and 16716 transitions. [2019-01-01 00:12:40,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:12:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7358 states and 16716 transitions. [2019-01-01 00:12:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:12:40,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:40,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:40,582 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:40,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1559378162, now seen corresponding path program 1 times [2019-01-01 00:12:40,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:40,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:40,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:40,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:40,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:41,102 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-01 00:12:41,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:41,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:12:41,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:12:41,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:12:41,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:12:41,104 INFO L87 Difference]: Start difference. First operand 7358 states and 16716 transitions. Second operand 6 states. [2019-01-01 00:12:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:42,920 INFO L93 Difference]: Finished difference Result 9349 states and 21078 transitions. [2019-01-01 00:12:42,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 00:12:42,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-01 00:12:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:42,934 INFO L225 Difference]: With dead ends: 9349 [2019-01-01 00:12:42,934 INFO L226 Difference]: Without dead ends: 9270 [2019-01-01 00:12:42,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:12:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9270 states. [2019-01-01 00:12:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9270 to 6928. [2019-01-01 00:12:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6928 states. [2019-01-01 00:12:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6928 states to 6928 states and 15763 transitions. [2019-01-01 00:12:43,028 INFO L78 Accepts]: Start accepts. Automaton has 6928 states and 15763 transitions. Word has length 93 [2019-01-01 00:12:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:43,029 INFO L480 AbstractCegarLoop]: Abstraction has 6928 states and 15763 transitions. [2019-01-01 00:12:43,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:12:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 6928 states and 15763 transitions. [2019-01-01 00:12:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:12:43,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:43,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:43,037 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1497612213, now seen corresponding path program 1 times [2019-01-01 00:12:43,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:43,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:43,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:43,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:43,609 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-01 00:12:43,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:43,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 00:12:43,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 00:12:43,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 00:12:43,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:12:43,611 INFO L87 Difference]: Start difference. First operand 6928 states and 15763 transitions. Second operand 9 states. [2019-01-01 00:12:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:44,395 INFO L93 Difference]: Finished difference Result 9639 states and 21910 transitions. [2019-01-01 00:12:44,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 00:12:44,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-01-01 00:12:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:44,407 INFO L225 Difference]: With dead ends: 9639 [2019-01-01 00:12:44,408 INFO L226 Difference]: Without dead ends: 9639 [2019-01-01 00:12:44,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-01-01 00:12:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2019-01-01 00:12:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 8631. [2019-01-01 00:12:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8631 states. [2019-01-01 00:12:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8631 states to 8631 states and 19631 transitions. [2019-01-01 00:12:44,508 INFO L78 Accepts]: Start accepts. Automaton has 8631 states and 19631 transitions. Word has length 93 [2019-01-01 00:12:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:44,509 INFO L480 AbstractCegarLoop]: Abstraction has 8631 states and 19631 transitions. [2019-01-01 00:12:44,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 00:12:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 8631 states and 19631 transitions. [2019-01-01 00:12:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:12:44,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:44,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:44,519 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:44,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:44,520 INFO L82 PathProgramCache]: Analyzing trace with hash -989900620, now seen corresponding path program 1 times [2019-01-01 00:12:44,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:44,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:44,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:44,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:44,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:44,630 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-01 00:12:44,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:44,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:12:44,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:12:44,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:12:44,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:12:44,632 INFO L87 Difference]: Start difference. First operand 8631 states and 19631 transitions. Second operand 4 states. [2019-01-01 00:12:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:44,749 INFO L93 Difference]: Finished difference Result 8903 states and 20327 transitions. [2019-01-01 00:12:44,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:12:44,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-01 00:12:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:44,761 INFO L225 Difference]: With dead ends: 8903 [2019-01-01 00:12:44,761 INFO L226 Difference]: Without dead ends: 8871 [2019-01-01 00:12:44,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:12:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8871 states. [2019-01-01 00:12:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8871 to 8727. [2019-01-01 00:12:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8727 states. [2019-01-01 00:12:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8727 states to 8727 states and 19887 transitions. [2019-01-01 00:12:44,862 INFO L78 Accepts]: Start accepts. Automaton has 8727 states and 19887 transitions. Word has length 93 [2019-01-01 00:12:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:44,863 INFO L480 AbstractCegarLoop]: Abstraction has 8727 states and 19887 transitions. [2019-01-01 00:12:44,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:12:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 8727 states and 19887 transitions. [2019-01-01 00:12:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:12:44,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:44,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:44,873 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:44,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:44,873 INFO L82 PathProgramCache]: Analyzing trace with hash -299339146, now seen corresponding path program 1 times [2019-01-01 00:12:44,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:44,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:44,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:44,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:44,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:45,798 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-01 00:12:45,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:45,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 00:12:45,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 00:12:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 00:12:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:12:45,799 INFO L87 Difference]: Start difference. First operand 8727 states and 19887 transitions. Second operand 8 states. [2019-01-01 00:12:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:46,403 INFO L93 Difference]: Finished difference Result 13198 states and 30502 transitions. [2019-01-01 00:12:46,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 00:12:46,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-01-01 00:12:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:46,421 INFO L225 Difference]: With dead ends: 13198 [2019-01-01 00:12:46,421 INFO L226 Difference]: Without dead ends: 13198 [2019-01-01 00:12:46,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-01 00:12:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13198 states. [2019-01-01 00:12:46,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13198 to 9365. [2019-01-01 00:12:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-01-01 00:12:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 21554 transitions. [2019-01-01 00:12:46,563 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 21554 transitions. Word has length 93 [2019-01-01 00:12:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:46,564 INFO L480 AbstractCegarLoop]: Abstraction has 9365 states and 21554 transitions. [2019-01-01 00:12:46,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 00:12:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 21554 transitions. [2019-01-01 00:12:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:12:46,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:46,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:46,575 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:46,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:46,576 INFO L82 PathProgramCache]: Analyzing trace with hash 588164535, now seen corresponding path program 1 times [2019-01-01 00:12:46,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:46,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:46,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:46,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:46,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:46,809 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-01 00:12:46,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:46,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 00:12:46,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 00:12:46,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 00:12:46,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-01 00:12:46,810 INFO L87 Difference]: Start difference. First operand 9365 states and 21554 transitions. Second operand 10 states. [2019-01-01 00:12:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:47,745 INFO L93 Difference]: Finished difference Result 12545 states and 28910 transitions. [2019-01-01 00:12:47,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 00:12:47,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-01-01 00:12:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:47,763 INFO L225 Difference]: With dead ends: 12545 [2019-01-01 00:12:47,764 INFO L226 Difference]: Without dead ends: 12545 [2019-01-01 00:12:47,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-01-01 00:12:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12545 states. [2019-01-01 00:12:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12545 to 10501. [2019-01-01 00:12:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10501 states. [2019-01-01 00:12:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 24012 transitions. [2019-01-01 00:12:47,917 INFO L78 Accepts]: Start accepts. Automaton has 10501 states and 24012 transitions. Word has length 93 [2019-01-01 00:12:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:47,918 INFO L480 AbstractCegarLoop]: Abstraction has 10501 states and 24012 transitions. [2019-01-01 00:12:47,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 00:12:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 10501 states and 24012 transitions. [2019-01-01 00:12:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:12:47,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:47,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:47,932 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:47,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:47,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1143811017, now seen corresponding path program 1 times [2019-01-01 00:12:47,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:47,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:47,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:47,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:47,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:48,109 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-01 00:12:48,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:48,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:12:48,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:12:48,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:12:48,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:12:48,111 INFO L87 Difference]: Start difference. First operand 10501 states and 24012 transitions. Second operand 6 states. [2019-01-01 00:12:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:48,711 INFO L93 Difference]: Finished difference Result 10133 states and 22836 transitions. [2019-01-01 00:12:48,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:12:48,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-01 00:12:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:48,725 INFO L225 Difference]: With dead ends: 10133 [2019-01-01 00:12:48,725 INFO L226 Difference]: Without dead ends: 10133 [2019-01-01 00:12:48,725 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-01 00:12:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10133 states. [2019-01-01 00:12:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10133 to 7136. [2019-01-01 00:12:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2019-01-01 00:12:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 16093 transitions. [2019-01-01 00:12:48,840 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 16093 transitions. Word has length 93 [2019-01-01 00:12:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:48,841 INFO L480 AbstractCegarLoop]: Abstraction has 7136 states and 16093 transitions. [2019-01-01 00:12:48,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:12:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 16093 transitions. [2019-01-01 00:12:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-01 00:12:48,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:48,850 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-01 00:12:48,850 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:48,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2068511189, now seen corresponding path program 1 times [2019-01-01 00:12:48,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:48,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:48,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:48,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:48,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:12:49,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:49,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 00:12:49,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 00:12:49,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 00:12:49,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:12:49,115 INFO L87 Difference]: Start difference. First operand 7136 states and 16093 transitions. Second operand 9 states. [2019-01-01 00:12:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:49,847 INFO L93 Difference]: Finished difference Result 8480 states and 18944 transitions. [2019-01-01 00:12:49,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 00:12:49,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-01-01 00:12:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:49,860 INFO L225 Difference]: With dead ends: 8480 [2019-01-01 00:12:49,860 INFO L226 Difference]: Without dead ends: 8480 [2019-01-01 00:12:49,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-01-01 00:12:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8480 states. [2019-01-01 00:12:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8480 to 8214. [2019-01-01 00:12:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8214 states. [2019-01-01 00:12:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8214 states to 8214 states and 18420 transitions. [2019-01-01 00:12:49,959 INFO L78 Accepts]: Start accepts. Automaton has 8214 states and 18420 transitions. Word has length 95 [2019-01-01 00:12:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:49,959 INFO L480 AbstractCegarLoop]: Abstraction has 8214 states and 18420 transitions. [2019-01-01 00:12:49,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 00:12:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8214 states and 18420 transitions. [2019-01-01 00:12:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-01 00:12:49,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:49,969 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-01 00:12:49,970 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:49,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:49,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1338952426, now seen corresponding path program 1 times [2019-01-01 00:12:49,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:49,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:49,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:50,267 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 00:12:50,434 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 00:12:50,553 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-01 00:12:50,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:50,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 00:12:50,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 00:12:50,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 00:12:50,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:12:50,554 INFO L87 Difference]: Start difference. First operand 8214 states and 18420 transitions. Second operand 11 states. [2019-01-01 00:12:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:52,266 INFO L93 Difference]: Finished difference Result 15152 states and 34122 transitions. [2019-01-01 00:12:52,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 00:12:52,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-01-01 00:12:52,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:52,282 INFO L225 Difference]: With dead ends: 15152 [2019-01-01 00:12:52,282 INFO L226 Difference]: Without dead ends: 10596 [2019-01-01 00:12:52,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-01 00:12:52,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10596 states. [2019-01-01 00:12:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10596 to 7968. [2019-01-01 00:12:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7968 states. [2019-01-01 00:12:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7968 states to 7968 states and 17844 transitions. [2019-01-01 00:12:52,397 INFO L78 Accepts]: Start accepts. Automaton has 7968 states and 17844 transitions. Word has length 95 [2019-01-01 00:12:52,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:52,398 INFO L480 AbstractCegarLoop]: Abstraction has 7968 states and 17844 transitions. [2019-01-01 00:12:52,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 00:12:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 7968 states and 17844 transitions. [2019-01-01 00:12:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-01 00:12:52,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:52,409 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-01 00:12:52,409 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:52,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:52,409 INFO L82 PathProgramCache]: Analyzing trace with hash -860395469, now seen corresponding path program 1 times [2019-01-01 00:12:52,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:52,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:52,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:52,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:52,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:52,800 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-01 00:12:53,273 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-01 00:12:53,302 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-01 00:12:53,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:53,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:12:53,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:12:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:12:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:12:53,303 INFO L87 Difference]: Start difference. First operand 7968 states and 17844 transitions. Second operand 6 states. [2019-01-01 00:12:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:53,514 INFO L93 Difference]: Finished difference Result 8947 states and 19761 transitions. [2019-01-01 00:12:53,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:12:53,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-01 00:12:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:53,526 INFO L225 Difference]: With dead ends: 8947 [2019-01-01 00:12:53,526 INFO L226 Difference]: Without dead ends: 8890 [2019-01-01 00:12:53,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:12:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8890 states. [2019-01-01 00:12:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8890 to 7966. [2019-01-01 00:12:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7966 states. [2019-01-01 00:12:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 17669 transitions. [2019-01-01 00:12:53,630 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 17669 transitions. Word has length 95 [2019-01-01 00:12:53,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:53,630 INFO L480 AbstractCegarLoop]: Abstraction has 7966 states and 17669 transitions. [2019-01-01 00:12:53,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:12:53,630 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 17669 transitions. [2019-01-01 00:12:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-01 00:12:53,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:53,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:12:53,640 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:53,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1196866221, now seen corresponding path program 2 times [2019-01-01 00:12:53,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:53,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:53,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:53,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:12:53,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:12:53,971 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-01 00:12:53,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:12:53,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:12:53,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:12:53,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:12:53,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:12:53,972 INFO L87 Difference]: Start difference. First operand 7966 states and 17669 transitions. Second operand 6 states. [2019-01-01 00:12:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:12:54,199 INFO L93 Difference]: Finished difference Result 8186 states and 18114 transitions. [2019-01-01 00:12:54,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:12:54,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-01 00:12:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:12:54,210 INFO L225 Difference]: With dead ends: 8186 [2019-01-01 00:12:54,211 INFO L226 Difference]: Without dead ends: 8186 [2019-01-01 00:12:54,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:12:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8186 states. [2019-01-01 00:12:54,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8186 to 7872. [2019-01-01 00:12:54,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7872 states. [2019-01-01 00:12:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7872 states to 7872 states and 17459 transitions. [2019-01-01 00:12:54,328 INFO L78 Accepts]: Start accepts. Automaton has 7872 states and 17459 transitions. Word has length 95 [2019-01-01 00:12:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:12:54,328 INFO L480 AbstractCegarLoop]: Abstraction has 7872 states and 17459 transitions. [2019-01-01 00:12:54,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:12:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7872 states and 17459 transitions. [2019-01-01 00:12:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-01 00:12:54,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:12:54,339 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-01 00:12:54,339 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:12:54,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:12:54,340 INFO L82 PathProgramCache]: Analyzing trace with hash -530629708, now seen corresponding path program 2 times [2019-01-01 00:12:54,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:12:54,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:12:54,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:54,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:12:54,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:12:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:12:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:12:54,450 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 00:12:54,668 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:12:54,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:12:54 BasicIcfg [2019-01-01 00:12:54,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:12:54,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:12:54,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:12:54,673 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:12:54,674 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:12:09" (3/4) ... [2019-01-01 00:12:54,680 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 00:12:54,916 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:12:54,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:12:54,922 INFO L168 Benchmark]: Toolchain (without parser) took 47330.84 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 948.7 MB in the beginning and 987.7 MB in the end (delta: -39.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-01-01 00:12:54,923 INFO L168 Benchmark]: CDTParser took 0.17 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-01 00:12:54,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 892.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-01-01 00:12:54,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.77 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-01 00:12:54,926 INFO L168 Benchmark]: Boogie Preprocessor took 43.68 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-01 00:12:54,926 INFO L168 Benchmark]: RCFGBuilder took 1252.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-01-01 00:12:54,926 INFO L168 Benchmark]: TraceAbstraction took 44803.20 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-01 00:12:54,929 INFO L168 Benchmark]: Witness Printer took 247.97 ms. Allocated memory is still 2.9 GB. Free memory was 1.0 GB in the beginning and 987.7 MB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2019-01-01 00:12:54,933 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 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 892.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.77 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 43.68 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 1252.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44803.20 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 247.97 ms. Allocated memory is still 2.9 GB. Free memory was 1.0 GB in the beginning and 987.7 MB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t2315; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t2315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] -1 pthread_t t2316; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t2316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 __unbuffered_p1_EAX = x [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L786] -1 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 44.6s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7915 SDtfs, 9006 SDslu, 19800 SDs, 0 SdLazy, 8859 SolverSat, 434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 85 SyntacticMatches, 31 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34806occurred in iteration=0, 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: 7.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 73028 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 2440 NumberOfCodeBlocks, 2440 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2314 ConstructedInterpolants, 0 QuantifiedInterpolants, 517475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...