./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix012_pso.opt_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/mix012_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa1d0028f3d5125dc6cb3ad0fddd9ea5a6690445 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 [2018-12-31 18:35:13,539 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 18:35:13,541 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 18:35:13,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 18:35:13,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 18:35:13,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 18:35:13,558 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 18:35:13,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 18:35:13,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 18:35:13,563 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 18:35:13,564 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 18:35:13,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 18:35:13,565 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 18:35:13,566 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 18:35:13,567 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 18:35:13,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 18:35:13,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 18:35:13,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 18:35:13,574 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 18:35:13,576 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 18:35:13,578 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 18:35:13,579 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 18:35:13,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 18:35:13,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 18:35:13,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 18:35:13,585 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 18:35:13,586 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 18:35:13,587 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 18:35:13,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 18:35:13,589 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 18:35:13,589 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 18:35:13,590 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 18:35:13,591 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 18:35:13,591 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 18:35:13,592 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 18:35:13,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 18:35:13,594 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 18:35:13,610 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 18:35:13,611 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 18:35:13,614 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 18:35:13,616 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 18:35:13,616 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 18:35:13,616 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 18:35:13,616 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 18:35:13,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 18:35:13,617 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 18:35:13,617 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 18:35:13,617 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 18:35:13,617 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 18:35:13,617 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 18:35:13,618 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 18:35:13,618 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 18:35:13,618 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 18:35:13,618 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 18:35:13,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 18:35:13,619 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 18:35:13,623 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 18:35:13,624 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 18:35:13,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:35:13,624 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 18:35:13,624 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 18:35:13,624 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 18:35:13,625 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 18:35:13,627 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 18:35:13,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 18:35:13,627 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 -> fa1d0028f3d5125dc6cb3ad0fddd9ea5a6690445 [2018-12-31 18:35:13,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 18:35:13,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 18:35:13,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 18:35:13,701 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 18:35:13,702 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 18:35:13,704 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix012_pso.opt_false-unreach-call.i [2018-12-31 18:35:13,778 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321a73c01/461f98fe708b4945a94f2332d9004cd2/FLAGe3b4c3b82 [2018-12-31 18:35:14,324 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 18:35:14,327 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix012_pso.opt_false-unreach-call.i [2018-12-31 18:35:14,344 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321a73c01/461f98fe708b4945a94f2332d9004cd2/FLAGe3b4c3b82 [2018-12-31 18:35:14,573 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321a73c01/461f98fe708b4945a94f2332d9004cd2 [2018-12-31 18:35:14,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 18:35:14,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 18:35:14,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 18:35:14,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 18:35:14,586 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 18:35:14,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:35:14" (1/1) ... [2018-12-31 18:35:14,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b20f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:14, skipping insertion in model container [2018-12-31 18:35:14,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:35:14" (1/1) ... [2018-12-31 18:35:14,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 18:35:14,680 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 18:35:15,216 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:35:15,231 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 18:35:15,428 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:35:15,516 INFO L195 MainTranslator]: Completed translation [2018-12-31 18:35:15,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15 WrapperNode [2018-12-31 18:35:15,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 18:35:15,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 18:35:15,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 18:35:15,519 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 18:35:15,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15" (1/1) ... [2018-12-31 18:35:15,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15" (1/1) ... [2018-12-31 18:35:15,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 18:35:15,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 18:35:15,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 18:35:15,608 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 18:35:15,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15" (1/1) ... [2018-12-31 18:35:15,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15" (1/1) ... [2018-12-31 18:35:15,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15" (1/1) ... [2018-12-31 18:35:15,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15" (1/1) ... [2018-12-31 18:35:15,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15" (1/1) ... [2018-12-31 18:35:15,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15" (1/1) ... [2018-12-31 18:35:15,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15" (1/1) ... [2018-12-31 18:35:15,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 18:35:15,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 18:35:15,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 18:35:15,703 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 18:35:15,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15" (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 [2018-12-31 18:35:15,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 18:35:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 18:35:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 18:35:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 18:35:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 18:35:15,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 18:35:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 18:35:15,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 18:35:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 18:35:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 18:35:15,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 18:35:15,816 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 18:35:17,446 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 18:35:17,446 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 18:35:17,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:35:17 BoogieIcfgContainer [2018-12-31 18:35:17,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 18:35:17,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 18:35:17,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 18:35:17,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 18:35:17,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:35:14" (1/3) ... [2018-12-31 18:35:17,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1cba31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:35:17, skipping insertion in model container [2018-12-31 18:35:17,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:15" (2/3) ... [2018-12-31 18:35:17,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1cba31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:35:17, skipping insertion in model container [2018-12-31 18:35:17,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:35:17" (3/3) ... [2018-12-31 18:35:17,459 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt_false-unreach-call.i [2018-12-31 18:35:17,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,524 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,524 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,528 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,528 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,528 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,528 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,531 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,531 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,531 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,531 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,531 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,532 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,532 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,532 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,532 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,532 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,533 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,533 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,533 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,533 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,534 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,534 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,534 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,534 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,535 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,535 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,535 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,535 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,535 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,536 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,536 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,536 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,536 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,537 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,537 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,537 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,537 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,537 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,540 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,540 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,540 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,540 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,540 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,541 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,541 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,541 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,541 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,542 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,543 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,544 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,545 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,546 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,546 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,547 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,549 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,549 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,549 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,552 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,557 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,569 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,570 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,571 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,572 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,573 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,574 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:17,604 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 18:35:17,604 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 18:35:17,616 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 18:35:17,635 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 18:35:17,662 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 18:35:17,663 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 18:35:17,663 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 18:35:17,663 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 18:35:17,663 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 18:35:17,664 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 18:35:17,664 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 18:35:17,664 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 18:35:17,664 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 18:35:17,688 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173places, 226 transitions [2018-12-31 18:35:26,895 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83127 states. [2018-12-31 18:35:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 83127 states. [2018-12-31 18:35:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 18:35:26,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:26,910 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] [2018-12-31 18:35:26,915 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:26,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1968553448, now seen corresponding path program 1 times [2018-12-31 18:35:26,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:26,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:27,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:27,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:27,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:27,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:27,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:27,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:27,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:27,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:27,343 INFO L87 Difference]: Start difference. First operand 83127 states. Second operand 4 states. [2018-12-31 18:35:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:30,345 INFO L93 Difference]: Finished difference Result 150583 states and 603160 transitions. [2018-12-31 18:35:30,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:35:30,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-31 18:35:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:31,018 INFO L225 Difference]: With dead ends: 150583 [2018-12-31 18:35:31,019 INFO L226 Difference]: Without dead ends: 105839 [2018-12-31 18:35:31,021 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 [2018-12-31 18:35:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105839 states. [2018-12-31 18:35:35,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105839 to 61235. [2018-12-31 18:35:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61235 states. [2018-12-31 18:35:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61235 states to 61235 states and 248290 transitions. [2018-12-31 18:35:36,726 INFO L78 Accepts]: Start accepts. Automaton has 61235 states and 248290 transitions. Word has length 38 [2018-12-31 18:35:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:36,728 INFO L480 AbstractCegarLoop]: Abstraction has 61235 states and 248290 transitions. [2018-12-31 18:35:36,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 61235 states and 248290 transitions. [2018-12-31 18:35:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 18:35:36,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:36,739 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] [2018-12-31 18:35:36,739 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:36,740 INFO L82 PathProgramCache]: Analyzing trace with hash 40051689, now seen corresponding path program 1 times [2018-12-31 18:35:36,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:36,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:36,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:36,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:36,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:36,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:36,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:36,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:36,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:36,955 INFO L87 Difference]: Start difference. First operand 61235 states and 248290 transitions. Second operand 4 states. [2018-12-31 18:35:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:37,527 INFO L93 Difference]: Finished difference Result 14309 states and 48363 transitions. [2018-12-31 18:35:37,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:35:37,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-31 18:35:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:37,580 INFO L225 Difference]: With dead ends: 14309 [2018-12-31 18:35:37,580 INFO L226 Difference]: Without dead ends: 11489 [2018-12-31 18:35:37,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11489 states. [2018-12-31 18:35:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11489 to 11489. [2018-12-31 18:35:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2018-12-31 18:35:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 37854 transitions. [2018-12-31 18:35:37,840 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 37854 transitions. Word has length 46 [2018-12-31 18:35:37,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:37,842 INFO L480 AbstractCegarLoop]: Abstraction has 11489 states and 37854 transitions. [2018-12-31 18:35:37,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 37854 transitions. [2018-12-31 18:35:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 18:35:37,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:37,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] [2018-12-31 18:35:37,851 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:37,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash -709413427, now seen corresponding path program 1 times [2018-12-31 18:35:37,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:37,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:37,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:37,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:37,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:37,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:37,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:37,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:37,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:37,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:37,998 INFO L87 Difference]: Start difference. First operand 11489 states and 37854 transitions. Second operand 5 states. [2018-12-31 18:35:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:39,327 INFO L93 Difference]: Finished difference Result 23359 states and 75855 transitions. [2018-12-31 18:35:39,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:39,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 18:35:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:39,411 INFO L225 Difference]: With dead ends: 23359 [2018-12-31 18:35:39,411 INFO L226 Difference]: Without dead ends: 23284 [2018-12-31 18:35:39,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23284 states. [2018-12-31 18:35:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23284 to 15416. [2018-12-31 18:35:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15416 states. [2018-12-31 18:35:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15416 states to 15416 states and 49309 transitions. [2018-12-31 18:35:39,837 INFO L78 Accepts]: Start accepts. Automaton has 15416 states and 49309 transitions. Word has length 47 [2018-12-31 18:35:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:39,838 INFO L480 AbstractCegarLoop]: Abstraction has 15416 states and 49309 transitions. [2018-12-31 18:35:39,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 15416 states and 49309 transitions. [2018-12-31 18:35:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 18:35:39,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:39,841 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] [2018-12-31 18:35:39,841 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:39,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:39,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2036076211, now seen corresponding path program 1 times [2018-12-31 18:35:39,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:39,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:39,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:39,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:39,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:35:39,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:35:39,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:35:39,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:39,933 INFO L87 Difference]: Start difference. First operand 15416 states and 49309 transitions. Second operand 3 states. [2018-12-31 18:35:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:40,359 INFO L93 Difference]: Finished difference Result 28676 states and 90547 transitions. [2018-12-31 18:35:40,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:35:40,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 18:35:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:40,432 INFO L225 Difference]: With dead ends: 28676 [2018-12-31 18:35:40,432 INFO L226 Difference]: Without dead ends: 28672 [2018-12-31 18:35:40,433 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 [2018-12-31 18:35:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28672 states. [2018-12-31 18:35:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28672 to 24151. [2018-12-31 18:35:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24151 states. [2018-12-31 18:35:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24151 states to 24151 states and 76315 transitions. [2018-12-31 18:35:41,037 INFO L78 Accepts]: Start accepts. Automaton has 24151 states and 76315 transitions. Word has length 49 [2018-12-31 18:35:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:41,038 INFO L480 AbstractCegarLoop]: Abstraction has 24151 states and 76315 transitions. [2018-12-31 18:35:41,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:35:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 24151 states and 76315 transitions. [2018-12-31 18:35:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:35:41,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:41,043 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] [2018-12-31 18:35:41,043 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:41,044 INFO L82 PathProgramCache]: Analyzing trace with hash -762942338, now seen corresponding path program 1 times [2018-12-31 18:35:41,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:41,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:41,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:41,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:41,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:41,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:41,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:41,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:41,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:41,197 INFO L87 Difference]: Start difference. First operand 24151 states and 76315 transitions. Second operand 6 states. [2018-12-31 18:35:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:42,576 INFO L93 Difference]: Finished difference Result 33837 states and 105313 transitions. [2018-12-31 18:35:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:42,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 18:35:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:42,645 INFO L225 Difference]: With dead ends: 33837 [2018-12-31 18:35:42,645 INFO L226 Difference]: Without dead ends: 33740 [2018-12-31 18:35:42,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:35:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33740 states. [2018-12-31 18:35:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33740 to 23972. [2018-12-31 18:35:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23972 states. [2018-12-31 18:35:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23972 states to 23972 states and 75821 transitions. [2018-12-31 18:35:45,652 INFO L78 Accepts]: Start accepts. Automaton has 23972 states and 75821 transitions. Word has length 53 [2018-12-31 18:35:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:45,652 INFO L480 AbstractCegarLoop]: Abstraction has 23972 states and 75821 transitions. [2018-12-31 18:35:45,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 23972 states and 75821 transitions. [2018-12-31 18:35:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 18:35:45,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:45,670 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] [2018-12-31 18:35:45,670 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:45,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:45,670 INFO L82 PathProgramCache]: Analyzing trace with hash -782943030, now seen corresponding path program 1 times [2018-12-31 18:35:45,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:45,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:45,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:45,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:45,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:45,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:45,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:45,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:45,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:45,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:45,814 INFO L87 Difference]: Start difference. First operand 23972 states and 75821 transitions. Second operand 4 states. [2018-12-31 18:35:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:46,287 INFO L93 Difference]: Finished difference Result 30736 states and 97931 transitions. [2018-12-31 18:35:46,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:35:46,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-31 18:35:46,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:46,358 INFO L225 Difference]: With dead ends: 30736 [2018-12-31 18:35:46,359 INFO L226 Difference]: Without dead ends: 30736 [2018-12-31 18:35:46,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30736 states. [2018-12-31 18:35:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30736 to 27608. [2018-12-31 18:35:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27608 states. [2018-12-31 18:35:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27608 states to 27608 states and 87449 transitions. [2018-12-31 18:35:46,918 INFO L78 Accepts]: Start accepts. Automaton has 27608 states and 87449 transitions. Word has length 63 [2018-12-31 18:35:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:46,918 INFO L480 AbstractCegarLoop]: Abstraction has 27608 states and 87449 transitions. [2018-12-31 18:35:46,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:46,918 INFO L276 IsEmpty]: Start isEmpty. Operand 27608 states and 87449 transitions. [2018-12-31 18:35:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 18:35:46,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:46,939 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] [2018-12-31 18:35:46,940 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash 959867305, now seen corresponding path program 1 times [2018-12-31 18:35:46,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:46,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:46,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:46,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:46,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:47,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:47,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:47,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:47,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:47,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:47,264 INFO L87 Difference]: Start difference. First operand 27608 states and 87449 transitions. Second operand 6 states. [2018-12-31 18:35:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:48,659 INFO L93 Difference]: Finished difference Result 65701 states and 204770 transitions. [2018-12-31 18:35:48,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:35:48,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-31 18:35:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:48,820 INFO L225 Difference]: With dead ends: 65701 [2018-12-31 18:35:48,820 INFO L226 Difference]: Without dead ends: 65637 [2018-12-31 18:35:48,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 18:35:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65637 states. [2018-12-31 18:35:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65637 to 39276. [2018-12-31 18:35:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39276 states. [2018-12-31 18:35:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39276 states to 39276 states and 121530 transitions. [2018-12-31 18:35:49,735 INFO L78 Accepts]: Start accepts. Automaton has 39276 states and 121530 transitions. Word has length 63 [2018-12-31 18:35:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:49,736 INFO L480 AbstractCegarLoop]: Abstraction has 39276 states and 121530 transitions. [2018-12-31 18:35:49,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 39276 states and 121530 transitions. [2018-12-31 18:35:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:35:49,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:49,772 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] [2018-12-31 18:35:49,773 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:49,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1380720218, now seen corresponding path program 1 times [2018-12-31 18:35:49,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:49,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:49,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:49,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:49,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:49,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:49,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:35:49,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:35:49,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:35:49,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:49,876 INFO L87 Difference]: Start difference. First operand 39276 states and 121530 transitions. Second operand 3 states. [2018-12-31 18:35:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:50,174 INFO L93 Difference]: Finished difference Result 44929 states and 137015 transitions. [2018-12-31 18:35:50,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:35:50,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-31 18:35:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:50,294 INFO L225 Difference]: With dead ends: 44929 [2018-12-31 18:35:50,294 INFO L226 Difference]: Without dead ends: 44929 [2018-12-31 18:35:50,295 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 [2018-12-31 18:35:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44929 states. [2018-12-31 18:35:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44929 to 38916. [2018-12-31 18:35:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38916 states. [2018-12-31 18:35:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38916 states to 38916 states and 117880 transitions. [2018-12-31 18:35:51,485 INFO L78 Accepts]: Start accepts. Automaton has 38916 states and 117880 transitions. Word has length 69 [2018-12-31 18:35:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:51,485 INFO L480 AbstractCegarLoop]: Abstraction has 38916 states and 117880 transitions. [2018-12-31 18:35:51,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:35:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 38916 states and 117880 transitions. [2018-12-31 18:35:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 18:35:51,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:51,505 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] [2018-12-31 18:35:51,505 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:51,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2033390120, now seen corresponding path program 1 times [2018-12-31 18:35:51,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:51,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:51,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:51,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:51,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:51,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:51,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:51,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:51,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:51,755 INFO L87 Difference]: Start difference. First operand 38916 states and 117880 transitions. Second operand 7 states. [2018-12-31 18:35:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:54,411 INFO L93 Difference]: Finished difference Result 56281 states and 170058 transitions. [2018-12-31 18:35:54,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:54,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-31 18:35:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:54,553 INFO L225 Difference]: With dead ends: 56281 [2018-12-31 18:35:54,553 INFO L226 Difference]: Without dead ends: 55977 [2018-12-31 18:35:54,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:35:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55977 states. [2018-12-31 18:35:55,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55977 to 47672. [2018-12-31 18:35:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47672 states. [2018-12-31 18:35:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47672 states to 47672 states and 144131 transitions. [2018-12-31 18:35:55,445 INFO L78 Accepts]: Start accepts. Automaton has 47672 states and 144131 transitions. Word has length 70 [2018-12-31 18:35:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:55,446 INFO L480 AbstractCegarLoop]: Abstraction has 47672 states and 144131 transitions. [2018-12-31 18:35:55,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 47672 states and 144131 transitions. [2018-12-31 18:35:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 18:35:55,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:55,471 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] [2018-12-31 18:35:55,471 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:55,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:55,472 INFO L82 PathProgramCache]: Analyzing trace with hash 236438761, now seen corresponding path program 1 times [2018-12-31 18:35:55,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:55,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:55,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:55,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:55,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:55,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:55,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:35:55,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:35:55,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:35:55,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:55,800 INFO L87 Difference]: Start difference. First operand 47672 states and 144131 transitions. Second operand 8 states. [2018-12-31 18:35:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:57,571 INFO L93 Difference]: Finished difference Result 57838 states and 172357 transitions. [2018-12-31 18:35:57,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 18:35:57,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-12-31 18:35:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:57,701 INFO L225 Difference]: With dead ends: 57838 [2018-12-31 18:35:57,701 INFO L226 Difference]: Without dead ends: 57838 [2018-12-31 18:35:57,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-31 18:35:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57838 states. [2018-12-31 18:35:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57838 to 50532. [2018-12-31 18:35:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50532 states. [2018-12-31 18:35:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50532 states to 50532 states and 152080 transitions. [2018-12-31 18:35:59,045 INFO L78 Accepts]: Start accepts. Automaton has 50532 states and 152080 transitions. Word has length 70 [2018-12-31 18:35:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:59,046 INFO L480 AbstractCegarLoop]: Abstraction has 50532 states and 152080 transitions. [2018-12-31 18:35:59,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:35:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 50532 states and 152080 transitions. [2018-12-31 18:35:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 18:35:59,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:59,071 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] [2018-12-31 18:35:59,071 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1123942442, now seen corresponding path program 1 times [2018-12-31 18:35:59,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:59,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:59,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:59,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:59,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:59,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:59,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:59,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:59,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:59,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:59,196 INFO L87 Difference]: Start difference. First operand 50532 states and 152080 transitions. Second operand 5 states. [2018-12-31 18:35:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:59,304 INFO L93 Difference]: Finished difference Result 13236 states and 33132 transitions. [2018-12-31 18:35:59,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:35:59,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 18:35:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:59,319 INFO L225 Difference]: With dead ends: 13236 [2018-12-31 18:35:59,319 INFO L226 Difference]: Without dead ends: 11116 [2018-12-31 18:35:59,320 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 [2018-12-31 18:35:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11116 states. [2018-12-31 18:35:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11116 to 8545. [2018-12-31 18:35:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2018-12-31 18:35:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 21304 transitions. [2018-12-31 18:35:59,451 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 21304 transitions. Word has length 70 [2018-12-31 18:35:59,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:59,451 INFO L480 AbstractCegarLoop]: Abstraction has 8545 states and 21304 transitions. [2018-12-31 18:35:59,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:59,452 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 21304 transitions. [2018-12-31 18:35:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:35:59,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:59,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:59,466 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:59,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2012320343, now seen corresponding path program 1 times [2018-12-31 18:35:59,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:59,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:59,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:59,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:59,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:59,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:59,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:59,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:59,664 INFO L87 Difference]: Start difference. First operand 8545 states and 21304 transitions. Second operand 4 states. [2018-12-31 18:36:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:00,145 INFO L93 Difference]: Finished difference Result 9960 states and 24428 transitions. [2018-12-31 18:36:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:36:00,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-31 18:36:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:00,160 INFO L225 Difference]: With dead ends: 9960 [2018-12-31 18:36:00,161 INFO L226 Difference]: Without dead ends: 9960 [2018-12-31 18:36:00,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:36:00,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2018-12-31 18:36:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 9441. [2018-12-31 18:36:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-31 18:36:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 23271 transitions. [2018-12-31 18:36:00,294 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 23271 transitions. Word has length 98 [2018-12-31 18:36:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:00,294 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 23271 transitions. [2018-12-31 18:36:00,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:36:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 23271 transitions. [2018-12-31 18:36:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:36:00,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:00,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:00,308 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:00,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1931847016, now seen corresponding path program 1 times [2018-12-31 18:36:00,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:00,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:00,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:00,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:00,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:00,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:00,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:00,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:00,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:00,904 INFO L87 Difference]: Start difference. First operand 9441 states and 23271 transitions. Second operand 7 states. [2018-12-31 18:36:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:01,465 INFO L93 Difference]: Finished difference Result 14689 states and 34927 transitions. [2018-12-31 18:36:01,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:36:01,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-31 18:36:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:01,483 INFO L225 Difference]: With dead ends: 14689 [2018-12-31 18:36:01,483 INFO L226 Difference]: Without dead ends: 14579 [2018-12-31 18:36:01,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:36:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14579 states. [2018-12-31 18:36:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14579 to 12030. [2018-12-31 18:36:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12030 states. [2018-12-31 18:36:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 28962 transitions. [2018-12-31 18:36:01,643 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 28962 transitions. Word has length 98 [2018-12-31 18:36:01,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:01,643 INFO L480 AbstractCegarLoop]: Abstraction has 12030 states and 28962 transitions. [2018-12-31 18:36:01,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 28962 transitions. [2018-12-31 18:36:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:36:01,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:01,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:01,658 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:01,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:01,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2129287199, now seen corresponding path program 2 times [2018-12-31 18:36:01,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:01,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:01,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:01,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:01,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:01,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:01,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:01,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:01,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:01,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:01,919 INFO L87 Difference]: Start difference. First operand 12030 states and 28962 transitions. Second operand 5 states. [2018-12-31 18:36:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:02,366 INFO L93 Difference]: Finished difference Result 14443 states and 34139 transitions. [2018-12-31 18:36:02,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:36:02,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-31 18:36:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:02,384 INFO L225 Difference]: With dead ends: 14443 [2018-12-31 18:36:02,385 INFO L226 Difference]: Without dead ends: 14407 [2018-12-31 18:36:02,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14407 states. [2018-12-31 18:36:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14407 to 12725. [2018-12-31 18:36:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12725 states. [2018-12-31 18:36:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12725 states to 12725 states and 30402 transitions. [2018-12-31 18:36:02,546 INFO L78 Accepts]: Start accepts. Automaton has 12725 states and 30402 transitions. Word has length 98 [2018-12-31 18:36:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:02,547 INFO L480 AbstractCegarLoop]: Abstraction has 12725 states and 30402 transitions. [2018-12-31 18:36:02,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 12725 states and 30402 transitions. [2018-12-31 18:36:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:36:02,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:02,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:02,564 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:02,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash 838299897, now seen corresponding path program 3 times [2018-12-31 18:36:02,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:02,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:02,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:02,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:36:02,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:03,370 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 18:36:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:03,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:03,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:36:03,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:36:03,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:36:03,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:03,404 INFO L87 Difference]: Start difference. First operand 12725 states and 30402 transitions. Second operand 8 states. [2018-12-31 18:36:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:05,660 INFO L93 Difference]: Finished difference Result 17040 states and 40778 transitions. [2018-12-31 18:36:05,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:36:05,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2018-12-31 18:36:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:05,684 INFO L225 Difference]: With dead ends: 17040 [2018-12-31 18:36:05,684 INFO L226 Difference]: Without dead ends: 17008 [2018-12-31 18:36:05,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:36:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17008 states. [2018-12-31 18:36:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17008 to 13983. [2018-12-31 18:36:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13983 states. [2018-12-31 18:36:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13983 states to 13983 states and 33535 transitions. [2018-12-31 18:36:05,878 INFO L78 Accepts]: Start accepts. Automaton has 13983 states and 33535 transitions. Word has length 98 [2018-12-31 18:36:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:05,878 INFO L480 AbstractCegarLoop]: Abstraction has 13983 states and 33535 transitions. [2018-12-31 18:36:05,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:36:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 13983 states and 33535 transitions. [2018-12-31 18:36:05,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:36:05,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:05,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:05,897 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:05,897 INFO L82 PathProgramCache]: Analyzing trace with hash -958651462, now seen corresponding path program 1 times [2018-12-31 18:36:05,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:05,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:05,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:05,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:36:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:06,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:06,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:06,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:06,073 INFO L87 Difference]: Start difference. First operand 13983 states and 33535 transitions. Second operand 7 states. [2018-12-31 18:36:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:06,917 INFO L93 Difference]: Finished difference Result 19175 states and 46298 transitions. [2018-12-31 18:36:06,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 18:36:06,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-31 18:36:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:06,942 INFO L225 Difference]: With dead ends: 19175 [2018-12-31 18:36:06,942 INFO L226 Difference]: Without dead ends: 19175 [2018-12-31 18:36:06,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-31 18:36:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19175 states. [2018-12-31 18:36:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19175 to 14464. [2018-12-31 18:36:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14464 states. [2018-12-31 18:36:07,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14464 states to 14464 states and 34818 transitions. [2018-12-31 18:36:07,167 INFO L78 Accepts]: Start accepts. Automaton has 14464 states and 34818 transitions. Word has length 98 [2018-12-31 18:36:07,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:07,168 INFO L480 AbstractCegarLoop]: Abstraction has 14464 states and 34818 transitions. [2018-12-31 18:36:07,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:07,168 INFO L276 IsEmpty]: Start isEmpty. Operand 14464 states and 34818 transitions. [2018-12-31 18:36:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:36:07,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:07,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:07,187 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash -71147781, now seen corresponding path program 1 times [2018-12-31 18:36:07,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:07,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:07,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:07,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:07,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:07,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:07,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:07,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:07,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:07,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:07,369 INFO L87 Difference]: Start difference. First operand 14464 states and 34818 transitions. Second operand 7 states. [2018-12-31 18:36:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:07,607 INFO L93 Difference]: Finished difference Result 17011 states and 41055 transitions. [2018-12-31 18:36:07,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:36:07,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-31 18:36:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:07,630 INFO L225 Difference]: With dead ends: 17011 [2018-12-31 18:36:07,630 INFO L226 Difference]: Without dead ends: 17011 [2018-12-31 18:36:07,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17011 states. [2018-12-31 18:36:07,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17011 to 14751. [2018-12-31 18:36:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14751 states. [2018-12-31 18:36:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14751 states to 14751 states and 35471 transitions. [2018-12-31 18:36:07,900 INFO L78 Accepts]: Start accepts. Automaton has 14751 states and 35471 transitions. Word has length 98 [2018-12-31 18:36:07,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:07,900 INFO L480 AbstractCegarLoop]: Abstraction has 14751 states and 35471 transitions. [2018-12-31 18:36:07,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 14751 states and 35471 transitions. [2018-12-31 18:36:07,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:36:07,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:07,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:07,922 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:07,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1298259545, now seen corresponding path program 1 times [2018-12-31 18:36:07,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:07,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:07,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:07,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:07,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:08,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:08,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:08,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:08,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:08,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:08,155 INFO L87 Difference]: Start difference. First operand 14751 states and 35471 transitions. Second operand 6 states. [2018-12-31 18:36:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:08,418 INFO L93 Difference]: Finished difference Result 14479 states and 34519 transitions. [2018-12-31 18:36:08,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:36:08,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-31 18:36:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:08,439 INFO L225 Difference]: With dead ends: 14479 [2018-12-31 18:36:08,439 INFO L226 Difference]: Without dead ends: 14479 [2018-12-31 18:36:08,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14479 states. [2018-12-31 18:36:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14479 to 11990. [2018-12-31 18:36:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11990 states. [2018-12-31 18:36:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11990 states to 11990 states and 28718 transitions. [2018-12-31 18:36:08,619 INFO L78 Accepts]: Start accepts. Automaton has 11990 states and 28718 transitions. Word has length 98 [2018-12-31 18:36:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:08,619 INFO L480 AbstractCegarLoop]: Abstraction has 11990 states and 28718 transitions. [2018-12-31 18:36:08,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 11990 states and 28718 transitions. [2018-12-31 18:36:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 18:36:08,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:08,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:08,635 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1470672120, now seen corresponding path program 1 times [2018-12-31 18:36:08,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:08,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:08,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:08,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:08,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:08,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:08,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:08,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:08,947 INFO L87 Difference]: Start difference. First operand 11990 states and 28718 transitions. Second operand 7 states. [2018-12-31 18:36:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:09,768 INFO L93 Difference]: Finished difference Result 15758 states and 36141 transitions. [2018-12-31 18:36:09,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:36:09,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-31 18:36:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:09,790 INFO L225 Difference]: With dead ends: 15758 [2018-12-31 18:36:09,790 INFO L226 Difference]: Without dead ends: 15758 [2018-12-31 18:36:09,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-31 18:36:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15758 states. [2018-12-31 18:36:09,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15758 to 13186. [2018-12-31 18:36:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13186 states. [2018-12-31 18:36:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13186 states to 13186 states and 30757 transitions. [2018-12-31 18:36:09,986 INFO L78 Accepts]: Start accepts. Automaton has 13186 states and 30757 transitions. Word has length 100 [2018-12-31 18:36:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:09,986 INFO L480 AbstractCegarLoop]: Abstraction has 13186 states and 30757 transitions. [2018-12-31 18:36:09,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 13186 states and 30757 transitions. [2018-12-31 18:36:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 18:36:10,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:10,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:10,003 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:10,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:10,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1537678873, now seen corresponding path program 1 times [2018-12-31 18:36:10,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:10,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:10,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:10,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:10,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:10,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:10,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:36:10,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:36:10,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:36:10,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:10,319 INFO L87 Difference]: Start difference. First operand 13186 states and 30757 transitions. Second operand 8 states. [2018-12-31 18:36:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:11,061 INFO L93 Difference]: Finished difference Result 14562 states and 33662 transitions. [2018-12-31 18:36:11,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:36:11,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-12-31 18:36:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:11,079 INFO L225 Difference]: With dead ends: 14562 [2018-12-31 18:36:11,079 INFO L226 Difference]: Without dead ends: 14562 [2018-12-31 18:36:11,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-31 18:36:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14562 states. [2018-12-31 18:36:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14562 to 13817. [2018-12-31 18:36:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13817 states. [2018-12-31 18:36:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13817 states to 13817 states and 32143 transitions. [2018-12-31 18:36:11,236 INFO L78 Accepts]: Start accepts. Automaton has 13817 states and 32143 transitions. Word has length 100 [2018-12-31 18:36:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:11,236 INFO L480 AbstractCegarLoop]: Abstraction has 13817 states and 32143 transitions. [2018-12-31 18:36:11,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:36:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 13817 states and 32143 transitions. [2018-12-31 18:36:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 18:36:11,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:11,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:11,256 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:11,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:11,256 INFO L82 PathProgramCache]: Analyzing trace with hash -650175192, now seen corresponding path program 1 times [2018-12-31 18:36:11,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:11,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:11,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:11,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:11,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:11,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:11,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:11,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:11,603 INFO L87 Difference]: Start difference. First operand 13817 states and 32143 transitions. Second operand 7 states. [2018-12-31 18:36:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:12,091 INFO L93 Difference]: Finished difference Result 14101 states and 32825 transitions. [2018-12-31 18:36:12,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:36:12,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-31 18:36:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:12,110 INFO L225 Difference]: With dead ends: 14101 [2018-12-31 18:36:12,111 INFO L226 Difference]: Without dead ends: 14101 [2018-12-31 18:36:12,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:36:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14101 states. [2018-12-31 18:36:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14101 to 13721. [2018-12-31 18:36:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13721 states. [2018-12-31 18:36:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13721 states to 13721 states and 31949 transitions. [2018-12-31 18:36:12,284 INFO L78 Accepts]: Start accepts. Automaton has 13721 states and 31949 transitions. Word has length 100 [2018-12-31 18:36:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:12,284 INFO L480 AbstractCegarLoop]: Abstraction has 13721 states and 31949 transitions. [2018-12-31 18:36:12,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 13721 states and 31949 transitions. [2018-12-31 18:36:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 18:36:12,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:12,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:12,300 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1457583259, now seen corresponding path program 1 times [2018-12-31 18:36:12,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:12,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:12,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:12,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:12,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:36:12,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:36:12,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:36:12,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:36:12,403 INFO L87 Difference]: Start difference. First operand 13721 states and 31949 transitions. Second operand 3 states. [2018-12-31 18:36:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:12,538 INFO L93 Difference]: Finished difference Result 16704 states and 38915 transitions. [2018-12-31 18:36:12,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:36:12,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-31 18:36:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:12,557 INFO L225 Difference]: With dead ends: 16704 [2018-12-31 18:36:12,557 INFO L226 Difference]: Without dead ends: 16704 [2018-12-31 18:36:12,558 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 [2018-12-31 18:36:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16704 states. [2018-12-31 18:36:12,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16704 to 16639. [2018-12-31 18:36:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16639 states. [2018-12-31 18:36:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16639 states to 16639 states and 38774 transitions. [2018-12-31 18:36:12,745 INFO L78 Accepts]: Start accepts. Automaton has 16639 states and 38774 transitions. Word has length 100 [2018-12-31 18:36:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:12,745 INFO L480 AbstractCegarLoop]: Abstraction has 16639 states and 38774 transitions. [2018-12-31 18:36:12,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:36:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 16639 states and 38774 transitions. [2018-12-31 18:36:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 18:36:12,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:12,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:12,764 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1246232346, now seen corresponding path program 1 times [2018-12-31 18:36:12,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:12,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:12,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:12,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:12,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:12,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:12,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:36:12,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:36:12,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:36:12,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:36:12,906 INFO L87 Difference]: Start difference. First operand 16639 states and 38774 transitions. Second operand 4 states. [2018-12-31 18:36:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:13,193 INFO L93 Difference]: Finished difference Result 17247 states and 40127 transitions. [2018-12-31 18:36:13,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:36:13,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-31 18:36:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:13,218 INFO L225 Difference]: With dead ends: 17247 [2018-12-31 18:36:13,218 INFO L226 Difference]: Without dead ends: 17247 [2018-12-31 18:36:13,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:36:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17247 states. [2018-12-31 18:36:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17247 to 16232. [2018-12-31 18:36:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16232 states. [2018-12-31 18:36:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16232 states to 16232 states and 37875 transitions. [2018-12-31 18:36:13,404 INFO L78 Accepts]: Start accepts. Automaton has 16232 states and 37875 transitions. Word has length 100 [2018-12-31 18:36:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:13,405 INFO L480 AbstractCegarLoop]: Abstraction has 16232 states and 37875 transitions. [2018-12-31 18:36:13,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:36:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 16232 states and 37875 transitions. [2018-12-31 18:36:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 18:36:13,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:13,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:13,424 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:13,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:13,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1459578440, now seen corresponding path program 2 times [2018-12-31 18:36:13,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:13,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:13,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:13,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:13,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:13,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:13,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:13,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:13,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:13,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:13,557 INFO L87 Difference]: Start difference. First operand 16232 states and 37875 transitions. Second operand 5 states. [2018-12-31 18:36:14,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:14,037 INFO L93 Difference]: Finished difference Result 17403 states and 40371 transitions. [2018-12-31 18:36:14,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:36:14,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-31 18:36:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:14,060 INFO L225 Difference]: With dead ends: 17403 [2018-12-31 18:36:14,060 INFO L226 Difference]: Without dead ends: 17403 [2018-12-31 18:36:14,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17403 states. [2018-12-31 18:36:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17403 to 16195. [2018-12-31 18:36:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16195 states. [2018-12-31 18:36:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16195 states to 16195 states and 37727 transitions. [2018-12-31 18:36:14,254 INFO L78 Accepts]: Start accepts. Automaton has 16195 states and 37727 transitions. Word has length 100 [2018-12-31 18:36:14,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:14,255 INFO L480 AbstractCegarLoop]: Abstraction has 16195 states and 37727 transitions. [2018-12-31 18:36:14,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 16195 states and 37727 transitions. [2018-12-31 18:36:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 18:36:14,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:14,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:14,272 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1493494978, now seen corresponding path program 3 times [2018-12-31 18:36:14,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:14,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:36:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:14,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:14,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:14,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:14,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:14,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:14,489 INFO L87 Difference]: Start difference. First operand 16195 states and 37727 transitions. Second operand 6 states. [2018-12-31 18:36:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:14,983 INFO L93 Difference]: Finished difference Result 19238 states and 44650 transitions. [2018-12-31 18:36:14,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:36:14,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-31 18:36:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:15,009 INFO L225 Difference]: With dead ends: 19238 [2018-12-31 18:36:15,009 INFO L226 Difference]: Without dead ends: 19238 [2018-12-31 18:36:15,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19238 states. [2018-12-31 18:36:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19238 to 16225. [2018-12-31 18:36:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16225 states. [2018-12-31 18:36:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16225 states to 16225 states and 37790 transitions. [2018-12-31 18:36:15,216 INFO L78 Accepts]: Start accepts. Automaton has 16225 states and 37790 transitions. Word has length 100 [2018-12-31 18:36:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:15,217 INFO L480 AbstractCegarLoop]: Abstraction has 16225 states and 37790 transitions. [2018-12-31 18:36:15,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 16225 states and 37790 transitions. [2018-12-31 18:36:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 18:36:15,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:15,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:15,236 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:15,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:15,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1182685185, now seen corresponding path program 2 times [2018-12-31 18:36:15,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:15,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:15,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:15,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:36:15,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:15,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:15,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:15,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:15,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:15,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:15,539 INFO L87 Difference]: Start difference. First operand 16225 states and 37790 transitions. Second operand 5 states. [2018-12-31 18:36:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:15,987 INFO L93 Difference]: Finished difference Result 17568 states and 40553 transitions. [2018-12-31 18:36:15,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:36:15,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-31 18:36:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:16,010 INFO L225 Difference]: With dead ends: 17568 [2018-12-31 18:36:16,010 INFO L226 Difference]: Without dead ends: 17568 [2018-12-31 18:36:16,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17568 states. [2018-12-31 18:36:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17568 to 16449. [2018-12-31 18:36:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16449 states. [2018-12-31 18:36:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16449 states to 16449 states and 38253 transitions. [2018-12-31 18:36:16,199 INFO L78 Accepts]: Start accepts. Automaton has 16449 states and 38253 transitions. Word has length 100 [2018-12-31 18:36:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:16,200 INFO L480 AbstractCegarLoop]: Abstraction has 16449 states and 38253 transitions. [2018-12-31 18:36:16,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16449 states and 38253 transitions. [2018-12-31 18:36:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 18:36:16,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:16,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:16,218 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:16,219 INFO L82 PathProgramCache]: Analyzing trace with hash 421103019, now seen corresponding path program 1 times [2018-12-31 18:36:16,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:16,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:16,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:16,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:36:16,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:16,534 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 18:36:16,697 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 18:36:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:16,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:16,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 18:36:16,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 18:36:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 18:36:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-31 18:36:16,782 INFO L87 Difference]: Start difference. First operand 16449 states and 38253 transitions. Second operand 12 states. [2018-12-31 18:36:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:18,556 INFO L93 Difference]: Finished difference Result 31157 states and 72165 transitions. [2018-12-31 18:36:18,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 18:36:18,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-31 18:36:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:18,592 INFO L225 Difference]: With dead ends: 31157 [2018-12-31 18:36:18,592 INFO L226 Difference]: Without dead ends: 25991 [2018-12-31 18:36:18,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-31 18:36:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25991 states. [2018-12-31 18:36:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25991 to 19646. [2018-12-31 18:36:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-31 18:36:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 45772 transitions. [2018-12-31 18:36:18,882 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 45772 transitions. Word has length 102 [2018-12-31 18:36:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:18,882 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 45772 transitions. [2018-12-31 18:36:18,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 18:36:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 45772 transitions. [2018-12-31 18:36:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 18:36:19,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:19,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:19,060 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:19,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1248832949, now seen corresponding path program 2 times [2018-12-31 18:36:19,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:19,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:19,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:19,424 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 18:36:19,620 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 18:36:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:20,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:20,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 18:36:20,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 18:36:20,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 18:36:20,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:36:20,443 INFO L87 Difference]: Start difference. First operand 19646 states and 45772 transitions. Second operand 10 states. [2018-12-31 18:36:21,142 WARN L181 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-12-31 18:36:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:21,998 INFO L93 Difference]: Finished difference Result 22176 states and 51622 transitions. [2018-12-31 18:36:22,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:36:22,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-31 18:36:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:22,005 INFO L225 Difference]: With dead ends: 22176 [2018-12-31 18:36:22,006 INFO L226 Difference]: Without dead ends: 3607 [2018-12-31 18:36:22,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-31 18:36:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2018-12-31 18:36:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3605. [2018-12-31 18:36:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3605 states. [2018-12-31 18:36:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3605 states to 3605 states and 8520 transitions. [2018-12-31 18:36:22,044 INFO L78 Accepts]: Start accepts. Automaton has 3605 states and 8520 transitions. Word has length 102 [2018-12-31 18:36:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:22,045 INFO L480 AbstractCegarLoop]: Abstraction has 3605 states and 8520 transitions. [2018-12-31 18:36:22,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 18:36:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3605 states and 8520 transitions. [2018-12-31 18:36:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 18:36:22,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:22,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:22,050 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:22,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:22,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1149405590, now seen corresponding path program 1 times [2018-12-31 18:36:22,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:22,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:22,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:22,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:36:22,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:36:22,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:22,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-31 18:36:22,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 18:36:22,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 18:36:22,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:36:22,312 INFO L87 Difference]: Start difference. First operand 3605 states and 8520 transitions. Second operand 13 states. [2018-12-31 18:36:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:23,319 INFO L93 Difference]: Finished difference Result 5791 states and 13438 transitions. [2018-12-31 18:36:23,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 18:36:23,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-12-31 18:36:23,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:23,325 INFO L225 Difference]: With dead ends: 5791 [2018-12-31 18:36:23,325 INFO L226 Difference]: Without dead ends: 4112 [2018-12-31 18:36:23,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-31 18:36:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4112 states. [2018-12-31 18:36:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4112 to 3607. [2018-12-31 18:36:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3607 states. [2018-12-31 18:36:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 8521 transitions. [2018-12-31 18:36:23,368 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 8521 transitions. Word has length 102 [2018-12-31 18:36:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:23,368 INFO L480 AbstractCegarLoop]: Abstraction has 3607 states and 8521 transitions. [2018-12-31 18:36:23,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 18:36:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 8521 transitions. [2018-12-31 18:36:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 18:36:23,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:23,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:23,373 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:23,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:23,373 INFO L82 PathProgramCache]: Analyzing trace with hash 137931784, now seen corresponding path program 2 times [2018-12-31 18:36:23,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:23,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:23,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:23,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:36:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:36:23,470 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 18:36:23,659 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 18:36:23,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:36:23 BasicIcfg [2018-12-31 18:36:23,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 18:36:23,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 18:36:23,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 18:36:23,665 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 18:36:23,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:35:17" (3/4) ... [2018-12-31 18:36:23,668 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 18:36:23,867 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 18:36:23,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 18:36:23,870 INFO L168 Benchmark]: Toolchain (without parser) took 69292.17 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 952.7 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 921.1 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,874 INFO L168 Benchmark]: CDTParser took 0.26 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. [2018-12-31 18:36:23,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 937.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,876 INFO L168 Benchmark]: Boogie Preprocessor took 95.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 18:36:23,876 INFO L168 Benchmark]: RCFGBuilder took 1745.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,876 INFO L168 Benchmark]: TraceAbstraction took 66213.46 ms. Allocated memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 816.1 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,877 INFO L168 Benchmark]: Witness Printer took 202.78 ms. Allocated memory is still 4.9 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:23,882 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.26 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 937.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1745.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66213.46 ms. Allocated memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 816.1 MB. Max. memory is 11.5 GB. * Witness Printer took 202.78 ms. Allocated memory is still 4.9 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L684] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L685] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L686] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L687] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L688] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L689] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L690] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L691] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L692] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L693] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L694] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L695] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L696] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L698] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L784] -1 pthread_t t313; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L785] FCALL, FORK -1 pthread_create(&t313, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] -1 pthread_t t314; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] FCALL, FORK -1 pthread_create(&t314, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L732] 0 x$w_buff1 = x$w_buff0 [L733] 0 x$w_buff0 = 1 [L734] 0 x$w_buff1_used = x$w_buff0_used [L735] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L738] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L739] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L740] 0 x$r_buff0_thd2 = (_Bool)1 [L743] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L744] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L745] 0 x$flush_delayed = weak$$choice2 [L746] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 0 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L748] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L749] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L750] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L751] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L751] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L752] EXPR 0 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 0 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L753] EXPR 0 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 0 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] 0 x = x$flush_delayed ? x$mem_tmp : x [L756] 0 x$flush_delayed = (_Bool)0 [L759] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L704] 1 y = 1 [L707] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L708] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L709] 1 x$flush_delayed = weak$$choice2 [L710] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L711] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L763] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L711] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L712] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L712] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L713] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L713] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L765] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L766] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L714] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L714] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L715] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L715] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L716] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L717] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L717] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L719] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L719] 1 x = x$flush_delayed ? x$mem_tmp : x [L720] 1 x$flush_delayed = (_Bool)0 [L725] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L794] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L795] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L796] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L797] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L800] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 283 locations, 3 error locations. UNSAFE Result, 66.0s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 28.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10748 SDtfs, 13326 SDslu, 29879 SDs, 0 SdLazy, 10642 SolverSat, 466 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 75 SyntacticMatches, 30 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83127occurred 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: 18.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 154649 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2532 NumberOfCodeBlocks, 2532 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2401 ConstructedInterpolants, 0 QuantifiedInterpolants, 518440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...