./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix041_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix041_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 312968f43197d6c548eeb38f4d8e08bfae3b68af ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 02:07:33,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 02:07:33,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 02:07:33,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 02:07:33,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 02:07:33,483 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 02:07:33,485 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 02:07:33,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 02:07:33,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 02:07:33,490 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 02:07:33,491 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 02:07:33,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 02:07:33,493 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 02:07:33,494 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 02:07:33,495 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 02:07:33,496 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 02:07:33,497 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 02:07:33,499 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 02:07:33,501 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 02:07:33,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 02:07:33,505 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 02:07:33,506 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 02:07:33,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 02:07:33,509 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 02:07:33,509 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 02:07:33,510 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 02:07:33,512 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 02:07:33,513 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 02:07:33,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 02:07:33,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 02:07:33,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 02:07:33,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 02:07:33,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 02:07:33,517 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 02:07:33,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 02:07:33,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 02:07:33,520 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 02:07:33,535 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 02:07:33,536 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 02:07:33,537 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 02:07:33,537 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 02:07:33,537 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 02:07:33,537 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 02:07:33,538 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 02:07:33,539 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 02:07:33,539 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 02:07:33,539 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 02:07:33,539 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 02:07:33,539 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 02:07:33,540 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 02:07:33,540 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 02:07:33,541 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 02:07:33,541 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 02:07:33,541 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 02:07:33,541 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 02:07:33,541 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 02:07:33,541 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 02:07:33,542 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 02:07:33,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 02:07:33,543 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 02:07:33,543 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 02:07:33,543 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 02:07:33,543 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 02:07:33,544 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 02:07:33,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 02:07:33,545 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 -> 312968f43197d6c548eeb38f4d8e08bfae3b68af [2019-01-13 02:07:33,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 02:07:33,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 02:07:33,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 02:07:33,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 02:07:33,601 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 02:07:33,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix041_pso.opt_false-unreach-call.i [2019-01-13 02:07:33,661 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87cf5175/a83116ba76804327a18f821ba6002cd6/FLAG2ec2443b1 [2019-01-13 02:07:34,207 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 02:07:34,208 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix041_pso.opt_false-unreach-call.i [2019-01-13 02:07:34,235 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87cf5175/a83116ba76804327a18f821ba6002cd6/FLAG2ec2443b1 [2019-01-13 02:07:34,491 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87cf5175/a83116ba76804327a18f821ba6002cd6 [2019-01-13 02:07:34,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 02:07:34,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 02:07:34,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 02:07:34,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 02:07:34,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 02:07:34,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:07:34" (1/1) ... [2019-01-13 02:07:34,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a0c3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:34, skipping insertion in model container [2019-01-13 02:07:34,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:07:34" (1/1) ... [2019-01-13 02:07:34,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 02:07:34,597 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 02:07:35,077 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:07:35,091 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 02:07:35,264 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:07:35,344 INFO L195 MainTranslator]: Completed translation [2019-01-13 02:07:35,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35 WrapperNode [2019-01-13 02:07:35,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 02:07:35,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 02:07:35,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 02:07:35,346 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 02:07:35,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35" (1/1) ... [2019-01-13 02:07:35,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35" (1/1) ... [2019-01-13 02:07:35,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 02:07:35,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 02:07:35,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 02:07:35,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 02:07:35,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35" (1/1) ... [2019-01-13 02:07:35,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35" (1/1) ... [2019-01-13 02:07:35,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35" (1/1) ... [2019-01-13 02:07:35,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35" (1/1) ... [2019-01-13 02:07:35,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35" (1/1) ... [2019-01-13 02:07:35,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35" (1/1) ... [2019-01-13 02:07:35,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35" (1/1) ... [2019-01-13 02:07:35,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 02:07:35,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 02:07:35,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 02:07:35,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 02:07:35,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 02:07:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 02:07:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 02:07:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 02:07:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 02:07:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 02:07:35,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 02:07:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 02:07:35,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 02:07:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 02:07:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 02:07:35,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 02:07:35,550 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 02:07:36,634 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 02:07:36,635 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 02:07:36,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:07:36 BoogieIcfgContainer [2019-01-13 02:07:36,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 02:07:36,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 02:07:36,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 02:07:36,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 02:07:36,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 02:07:34" (1/3) ... [2019-01-13 02:07:36,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a30290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:07:36, skipping insertion in model container [2019-01-13 02:07:36,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:07:35" (2/3) ... [2019-01-13 02:07:36,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a30290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:07:36, skipping insertion in model container [2019-01-13 02:07:36,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:07:36" (3/3) ... [2019-01-13 02:07:36,645 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_pso.opt_false-unreach-call.i [2019-01-13 02:07:36,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,687 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,687 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,693 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,693 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,693 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,693 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,699 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,699 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,699 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,701 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,701 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:07:36,727 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 02:07:36,728 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 02:07:36,735 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 02:07:36,752 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 02:07:36,778 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 02:07:36,778 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 02:07:36,779 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 02:07:36,779 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 02:07:36,779 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 02:07:36,779 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 02:07:36,779 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 02:07:36,779 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 02:07:36,780 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 02:07:36,793 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2019-01-13 02:07:38,476 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2019-01-13 02:07:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2019-01-13 02:07:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 02:07:38,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:38,489 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] [2019-01-13 02:07:38,491 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2019-01-13 02:07:38,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:38,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:38,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:38,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:38,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:38,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:38,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:07:38,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:07:38,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:07:38,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:38,874 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2019-01-13 02:07:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:39,938 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2019-01-13 02:07:39,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:07:39,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-01-13 02:07:39,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:40,325 INFO L225 Difference]: With dead ends: 45389 [2019-01-13 02:07:40,325 INFO L226 Difference]: Without dead ends: 40629 [2019-01-13 02:07:40,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2019-01-13 02:07:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2019-01-13 02:07:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2019-01-13 02:07:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2019-01-13 02:07:42,118 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2019-01-13 02:07:42,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:42,119 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2019-01-13 02:07:42,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:07:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2019-01-13 02:07:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 02:07:42,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:42,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:07:42,126 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1632937034, now seen corresponding path program 1 times [2019-01-13 02:07:42,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:42,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:42,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:42,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:42,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:42,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:42,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:07:42,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:07:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:07:42,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:07:42,324 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2019-01-13 02:07:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:42,937 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2019-01-13 02:07:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:07:42,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-01-13 02:07:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:43,101 INFO L225 Difference]: With dead ends: 23663 [2019-01-13 02:07:43,101 INFO L226 Difference]: Without dead ends: 23663 [2019-01-13 02:07:43,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:07:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2019-01-13 02:07:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2019-01-13 02:07:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2019-01-13 02:07:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2019-01-13 02:07:44,312 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2019-01-13 02:07:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:44,314 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2019-01-13 02:07:44,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:07:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2019-01-13 02:07:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 02:07:44,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:44,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:07:44,322 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash -164014325, now seen corresponding path program 1 times [2019-01-13 02:07:44,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:44,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:44,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:44,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:44,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:44,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:44,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:44,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:44,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:44,533 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2019-01-13 02:07:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:46,959 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2019-01-13 02:07:46,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:07:46,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-01-13 02:07:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:47,355 INFO L225 Difference]: With dead ends: 64831 [2019-01-13 02:07:47,356 INFO L226 Difference]: Without dead ends: 64671 [2019-01-13 02:07:47,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:07:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2019-01-13 02:07:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2019-01-13 02:07:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2019-01-13 02:07:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2019-01-13 02:07:48,918 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2019-01-13 02:07:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:48,919 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2019-01-13 02:07:48,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2019-01-13 02:07:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 02:07:48,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:48,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:07:48,923 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:48,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:48,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2019-01-13 02:07:48,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:48,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:48,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:48,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:49,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:49,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:49,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:49,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:49,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:49,060 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 5 states. [2019-01-13 02:07:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:50,408 INFO L93 Difference]: Finished difference Result 66627 states and 246202 transitions. [2019-01-13 02:07:50,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:07:50,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-13 02:07:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:50,660 INFO L225 Difference]: With dead ends: 66627 [2019-01-13 02:07:50,660 INFO L226 Difference]: Without dead ends: 66459 [2019-01-13 02:07:50,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:07:50,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2019-01-13 02:07:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2019-01-13 02:07:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2019-01-13 02:07:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143659 transitions. [2019-01-13 02:07:52,640 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143659 transitions. Word has length 46 [2019-01-13 02:07:52,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:52,641 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143659 transitions. [2019-01-13 02:07:52,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143659 transitions. [2019-01-13 02:07:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 02:07:52,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:52,654 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] [2019-01-13 02:07:52,654 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:52,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:52,654 INFO L82 PathProgramCache]: Analyzing trace with hash -800575093, now seen corresponding path program 1 times [2019-01-13 02:07:52,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:52,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:52,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:52,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:52,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:07:52,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:07:52,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:07:52,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:52,774 INFO L87 Difference]: Start difference. First operand 38835 states and 143659 transitions. Second operand 4 states. [2019-01-13 02:07:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:52,871 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2019-01-13 02:07:52,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:07:52,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-13 02:07:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:52,901 INFO L225 Difference]: With dead ends: 14217 [2019-01-13 02:07:52,901 INFO L226 Difference]: Without dead ends: 13696 [2019-01-13 02:07:52,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2019-01-13 02:07:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2019-01-13 02:07:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2019-01-13 02:07:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2019-01-13 02:07:53,222 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2019-01-13 02:07:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:53,222 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2019-01-13 02:07:53,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:07:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2019-01-13 02:07:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-13 02:07:53,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:53,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:07:53,229 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:53,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1496318134, now seen corresponding path program 1 times [2019-01-13 02:07:53,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:53,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:53,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:53,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:53,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:53,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:53,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:07:53,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:07:53,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:07:53,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:53,447 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2019-01-13 02:07:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:53,809 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2019-01-13 02:07:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:07:53,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-01-13 02:07:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:53,843 INFO L225 Difference]: With dead ends: 19084 [2019-01-13 02:07:53,843 INFO L226 Difference]: Without dead ends: 19084 [2019-01-13 02:07:53,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2019-01-13 02:07:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2019-01-13 02:07:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2019-01-13 02:07:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2019-01-13 02:07:54,099 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2019-01-13 02:07:54,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:54,099 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2019-01-13 02:07:54,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:07:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2019-01-13 02:07:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-13 02:07:54,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:54,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:07:54,108 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:54,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:54,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1055838827, now seen corresponding path program 1 times [2019-01-13 02:07:54,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:54,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:54,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:54,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:54,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:54,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:54,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:54,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:54,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:54,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:54,333 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 5 states. [2019-01-13 02:07:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:54,380 INFO L93 Difference]: Finished difference Result 2828 states and 7576 transitions. [2019-01-13 02:07:54,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 02:07:54,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-01-13 02:07:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:54,383 INFO L225 Difference]: With dead ends: 2828 [2019-01-13 02:07:54,384 INFO L226 Difference]: Without dead ends: 2416 [2019-01-13 02:07:54,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2019-01-13 02:07:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2313. [2019-01-13 02:07:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2019-01-13 02:07:54,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 6179 transitions. [2019-01-13 02:07:54,418 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 6179 transitions. Word has length 59 [2019-01-13 02:07:54,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:54,418 INFO L480 AbstractCegarLoop]: Abstraction has 2313 states and 6179 transitions. [2019-01-13 02:07:54,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 6179 transitions. [2019-01-13 02:07:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 02:07:54,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:54,428 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] [2019-01-13 02:07:54,428 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:54,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:54,428 INFO L82 PathProgramCache]: Analyzing trace with hash -401390984, now seen corresponding path program 1 times [2019-01-13 02:07:54,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:54,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:54,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:54,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:54,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:07:54,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:07:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:07:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:54,668 INFO L87 Difference]: Start difference. First operand 2313 states and 6179 transitions. Second operand 4 states. [2019-01-13 02:07:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:54,921 INFO L93 Difference]: Finished difference Result 2750 states and 7226 transitions. [2019-01-13 02:07:54,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:07:54,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 02:07:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:54,928 INFO L225 Difference]: With dead ends: 2750 [2019-01-13 02:07:54,928 INFO L226 Difference]: Without dead ends: 2750 [2019-01-13 02:07:54,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-01-13 02:07:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2402. [2019-01-13 02:07:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2402 states. [2019-01-13 02:07:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 6381 transitions. [2019-01-13 02:07:54,968 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 6381 transitions. Word has length 92 [2019-01-13 02:07:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:54,968 INFO L480 AbstractCegarLoop]: Abstraction has 2402 states and 6381 transitions. [2019-01-13 02:07:54,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:07:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 6381 transitions. [2019-01-13 02:07:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 02:07:54,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:54,975 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] [2019-01-13 02:07:54,975 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash 568190039, now seen corresponding path program 1 times [2019-01-13 02:07:54,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:54,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:54,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:54,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:54,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:55,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:55,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:07:55,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:07:55,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:07:55,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:55,091 INFO L87 Difference]: Start difference. First operand 2402 states and 6381 transitions. Second operand 4 states. [2019-01-13 02:07:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:55,450 INFO L93 Difference]: Finished difference Result 3360 states and 8951 transitions. [2019-01-13 02:07:55,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:07:55,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 02:07:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:55,456 INFO L225 Difference]: With dead ends: 3360 [2019-01-13 02:07:55,456 INFO L226 Difference]: Without dead ends: 3360 [2019-01-13 02:07:55,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2019-01-13 02:07:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 2367. [2019-01-13 02:07:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-01-13 02:07:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 6242 transitions. [2019-01-13 02:07:55,492 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 6242 transitions. Word has length 92 [2019-01-13 02:07:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:55,493 INFO L480 AbstractCegarLoop]: Abstraction has 2367 states and 6242 transitions. [2019-01-13 02:07:55,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:07:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 6242 transitions. [2019-01-13 02:07:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 02:07:55,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:55,498 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] [2019-01-13 02:07:55,499 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash -167652887, now seen corresponding path program 2 times [2019-01-13 02:07:55,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:55,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:55,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:55,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:55,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:55,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:55,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:55,791 INFO L87 Difference]: Start difference. First operand 2367 states and 6242 transitions. Second operand 5 states. [2019-01-13 02:07:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:56,157 INFO L93 Difference]: Finished difference Result 2725 states and 7108 transitions. [2019-01-13 02:07:56,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:07:56,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-01-13 02:07:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:56,163 INFO L225 Difference]: With dead ends: 2725 [2019-01-13 02:07:56,163 INFO L226 Difference]: Without dead ends: 2725 [2019-01-13 02:07:56,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:07:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2019-01-13 02:07:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2363. [2019-01-13 02:07:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-01-13 02:07:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 6233 transitions. [2019-01-13 02:07:56,193 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 6233 transitions. Word has length 92 [2019-01-13 02:07:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:56,194 INFO L480 AbstractCegarLoop]: Abstraction has 2363 states and 6233 transitions. [2019-01-13 02:07:56,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 6233 transitions. [2019-01-13 02:07:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 02:07:56,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:56,198 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] [2019-01-13 02:07:56,199 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash -264980909, now seen corresponding path program 1 times [2019-01-13 02:07:56,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:56,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:56,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:56,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 02:07:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:56,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:56,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:07:56,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:07:56,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:07:56,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:07:56,351 INFO L87 Difference]: Start difference. First operand 2363 states and 6233 transitions. Second operand 3 states. [2019-01-13 02:07:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:56,628 INFO L93 Difference]: Finished difference Result 2413 states and 6340 transitions. [2019-01-13 02:07:56,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:07:56,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-01-13 02:07:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:56,633 INFO L225 Difference]: With dead ends: 2413 [2019-01-13 02:07:56,633 INFO L226 Difference]: Without dead ends: 2413 [2019-01-13 02:07:56,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:07:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2019-01-13 02:07:56,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2375. [2019-01-13 02:07:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2019-01-13 02:07:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 6257 transitions. [2019-01-13 02:07:56,663 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 6257 transitions. Word has length 92 [2019-01-13 02:07:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:56,663 INFO L480 AbstractCegarLoop]: Abstraction has 2375 states and 6257 transitions. [2019-01-13 02:07:56,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:07:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 6257 transitions. [2019-01-13 02:07:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:56,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:56,668 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] [2019-01-13 02:07:56,668 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:56,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:56,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1400839737, now seen corresponding path program 1 times [2019-01-13 02:07:56,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:56,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:56,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:56,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:56,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:56,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:07:56,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:07:56,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:07:56,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:56,818 INFO L87 Difference]: Start difference. First operand 2375 states and 6257 transitions. Second operand 4 states. [2019-01-13 02:07:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:57,007 INFO L93 Difference]: Finished difference Result 4576 states and 12148 transitions. [2019-01-13 02:07:57,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:07:57,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-13 02:07:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:57,016 INFO L225 Difference]: With dead ends: 4576 [2019-01-13 02:07:57,016 INFO L226 Difference]: Without dead ends: 4576 [2019-01-13 02:07:57,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:07:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2019-01-13 02:07:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 2359. [2019-01-13 02:07:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2019-01-13 02:07:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 6176 transitions. [2019-01-13 02:07:57,063 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 6176 transitions. Word has length 94 [2019-01-13 02:07:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:57,063 INFO L480 AbstractCegarLoop]: Abstraction has 2359 states and 6176 transitions. [2019-01-13 02:07:57,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:07:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 6176 transitions. [2019-01-13 02:07:57,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:57,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:57,068 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] [2019-01-13 02:07:57,069 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:57,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1730605498, now seen corresponding path program 1 times [2019-01-13 02:07:57,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:57,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:57,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:57,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:57,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:07:57,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:07:57,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:07:57,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:57,251 INFO L87 Difference]: Start difference. First operand 2359 states and 6176 transitions. Second operand 7 states. [2019-01-13 02:07:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:57,747 INFO L93 Difference]: Finished difference Result 2684 states and 6937 transitions. [2019-01-13 02:07:57,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:07:57,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 02:07:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:57,752 INFO L225 Difference]: With dead ends: 2684 [2019-01-13 02:07:57,752 INFO L226 Difference]: Without dead ends: 2684 [2019-01-13 02:07:57,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-01-13 02:07:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2437. [2019-01-13 02:07:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2019-01-13 02:07:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 6326 transitions. [2019-01-13 02:07:57,779 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 6326 transitions. Word has length 94 [2019-01-13 02:07:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:57,780 INFO L480 AbstractCegarLoop]: Abstraction has 2437 states and 6326 transitions. [2019-01-13 02:07:57,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:07:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 6326 transitions. [2019-01-13 02:07:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:57,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:57,784 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] [2019-01-13 02:07:57,784 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:57,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:57,784 INFO L82 PathProgramCache]: Analyzing trace with hash 547258201, now seen corresponding path program 1 times [2019-01-13 02:07:57,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:57,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:57,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:57,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:57,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:58,250 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-13 02:07:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:58,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:58,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:07:58,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:07:58,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:07:58,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:07:58,352 INFO L87 Difference]: Start difference. First operand 2437 states and 6326 transitions. Second operand 5 states. [2019-01-13 02:07:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:58,506 INFO L93 Difference]: Finished difference Result 2230 states and 5772 transitions. [2019-01-13 02:07:58,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:07:58,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 02:07:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:58,511 INFO L225 Difference]: With dead ends: 2230 [2019-01-13 02:07:58,511 INFO L226 Difference]: Without dead ends: 2230 [2019-01-13 02:07:58,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:07:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2019-01-13 02:07:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2229. [2019-01-13 02:07:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2229 states. [2019-01-13 02:07:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 5770 transitions. [2019-01-13 02:07:58,534 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 5770 transitions. Word has length 94 [2019-01-13 02:07:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:58,534 INFO L480 AbstractCegarLoop]: Abstraction has 2229 states and 5770 transitions. [2019-01-13 02:07:58,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:07:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 5770 transitions. [2019-01-13 02:07:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:07:58,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:58,538 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] [2019-01-13 02:07:58,538 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:58,539 INFO L82 PathProgramCache]: Analyzing trace with hash -375425382, now seen corresponding path program 1 times [2019-01-13 02:07:58,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:58,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:58,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:58,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:58,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:07:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:07:58,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:07:58,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:07:58,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:07:58,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:07:58,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:07:58,834 INFO L87 Difference]: Start difference. First operand 2229 states and 5770 transitions. Second operand 6 states. [2019-01-13 02:07:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:07:59,507 INFO L93 Difference]: Finished difference Result 1941 states and 4874 transitions. [2019-01-13 02:07:59,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 02:07:59,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 02:07:59,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:07:59,511 INFO L225 Difference]: With dead ends: 1941 [2019-01-13 02:07:59,511 INFO L226 Difference]: Without dead ends: 1941 [2019-01-13 02:07:59,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:07:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2019-01-13 02:07:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1624. [2019-01-13 02:07:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2019-01-13 02:07:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 4128 transitions. [2019-01-13 02:07:59,540 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 4128 transitions. Word has length 94 [2019-01-13 02:07:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:07:59,541 INFO L480 AbstractCegarLoop]: Abstraction has 1624 states and 4128 transitions. [2019-01-13 02:07:59,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:07:59,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 4128 transitions. [2019-01-13 02:07:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:07:59,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:07:59,546 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] [2019-01-13 02:07:59,546 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:07:59,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:07:59,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1696918783, now seen corresponding path program 1 times [2019-01-13 02:07:59,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:07:59,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:07:59,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:59,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:07:59,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:07:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:08:00,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:00,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:08:00,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:08:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:08:00,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:08:00,060 INFO L87 Difference]: Start difference. First operand 1624 states and 4128 transitions. Second operand 7 states. [2019-01-13 02:08:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:00,839 INFO L93 Difference]: Finished difference Result 3053 states and 7610 transitions. [2019-01-13 02:08:00,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 02:08:00,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-13 02:08:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:00,845 INFO L225 Difference]: With dead ends: 3053 [2019-01-13 02:08:00,845 INFO L226 Difference]: Without dead ends: 3053 [2019-01-13 02:08:00,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 02:08:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2019-01-13 02:08:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2358. [2019-01-13 02:08:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2358 states. [2019-01-13 02:08:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 6000 transitions. [2019-01-13 02:08:00,877 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 6000 transitions. Word has length 96 [2019-01-13 02:08:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:00,878 INFO L480 AbstractCegarLoop]: Abstraction has 2358 states and 6000 transitions. [2019-01-13 02:08:00,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:08:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 6000 transitions. [2019-01-13 02:08:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:00,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:00,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:08:00,885 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:00,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:00,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1353284032, now seen corresponding path program 1 times [2019-01-13 02:08:00,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:00,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:00,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:00,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:00,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:08:01,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:01,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:08:01,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:08:01,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:08:01,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:08:01,081 INFO L87 Difference]: Start difference. First operand 2358 states and 6000 transitions. Second operand 6 states. [2019-01-13 02:08:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:01,308 INFO L93 Difference]: Finished difference Result 2471 states and 6261 transitions. [2019-01-13 02:08:01,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 02:08:01,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-13 02:08:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:01,313 INFO L225 Difference]: With dead ends: 2471 [2019-01-13 02:08:01,313 INFO L226 Difference]: Without dead ends: 2471 [2019-01-13 02:08:01,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-13 02:08:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-01-13 02:08:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2411. [2019-01-13 02:08:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-01-13 02:08:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6129 transitions. [2019-01-13 02:08:01,338 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6129 transitions. Word has length 96 [2019-01-13 02:08:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:01,339 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 6129 transitions. [2019-01-13 02:08:01,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:08:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6129 transitions. [2019-01-13 02:08:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:01,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:01,344 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] [2019-01-13 02:08:01,344 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:01,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2026684544, now seen corresponding path program 1 times [2019-01-13 02:08:01,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:01,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:01,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:01,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:01,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:08:01,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:01,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:08:01,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:08:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:08:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:08:01,677 INFO L87 Difference]: Start difference. First operand 2411 states and 6129 transitions. Second operand 5 states. [2019-01-13 02:08:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:01,950 INFO L93 Difference]: Finished difference Result 2731 states and 6929 transitions. [2019-01-13 02:08:01,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:08:01,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-01-13 02:08:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:01,956 INFO L225 Difference]: With dead ends: 2731 [2019-01-13 02:08:01,956 INFO L226 Difference]: Without dead ends: 2731 [2019-01-13 02:08:01,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:08:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2019-01-13 02:08:01,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2140. [2019-01-13 02:08:01,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-01-13 02:08:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 5454 transitions. [2019-01-13 02:08:01,984 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 5454 transitions. Word has length 96 [2019-01-13 02:08:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:01,985 INFO L480 AbstractCegarLoop]: Abstraction has 2140 states and 5454 transitions. [2019-01-13 02:08:01,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:08:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 5454 transitions. [2019-01-13 02:08:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:01,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:01,989 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] [2019-01-13 02:08:01,989 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:01,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:01,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1023518271, now seen corresponding path program 1 times [2019-01-13 02:08:01,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:01,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:01,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:01,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:01,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:02,386 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 02:08:02,586 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 02:08:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:08:02,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:02,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 02:08:02,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 02:08:02,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 02:08:02,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 02:08:02,772 INFO L87 Difference]: Start difference. First operand 2140 states and 5454 transitions. Second operand 10 states. [2019-01-13 02:08:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:03,496 INFO L93 Difference]: Finished difference Result 3914 states and 10153 transitions. [2019-01-13 02:08:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:08:03,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-01-13 02:08:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:03,500 INFO L225 Difference]: With dead ends: 3914 [2019-01-13 02:08:03,500 INFO L226 Difference]: Without dead ends: 1820 [2019-01-13 02:08:03,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-13 02:08:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2019-01-13 02:08:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1820. [2019-01-13 02:08:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-01-13 02:08:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4769 transitions. [2019-01-13 02:08:03,519 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4769 transitions. Word has length 96 [2019-01-13 02:08:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:03,519 INFO L480 AbstractCegarLoop]: Abstraction has 1820 states and 4769 transitions. [2019-01-13 02:08:03,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 02:08:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4769 transitions. [2019-01-13 02:08:03,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:03,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:03,523 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] [2019-01-13 02:08:03,523 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:03,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:03,523 INFO L82 PathProgramCache]: Analyzing trace with hash -390127679, now seen corresponding path program 2 times [2019-01-13 02:08:03,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:03,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:03,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:03,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:03,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:03,793 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 02:08:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:08:04,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:04,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 02:08:04,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 02:08:04,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 02:08:04,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 02:08:04,126 INFO L87 Difference]: Start difference. First operand 1820 states and 4769 transitions. Second operand 12 states. [2019-01-13 02:08:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:04,766 INFO L93 Difference]: Finished difference Result 3454 states and 9140 transitions. [2019-01-13 02:08:04,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 02:08:04,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-01-13 02:08:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:04,772 INFO L225 Difference]: With dead ends: 3454 [2019-01-13 02:08:04,772 INFO L226 Difference]: Without dead ends: 2478 [2019-01-13 02:08:04,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-13 02:08:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-01-13 02:08:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2326. [2019-01-13 02:08:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-13 02:08:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 5964 transitions. [2019-01-13 02:08:04,797 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 5964 transitions. Word has length 96 [2019-01-13 02:08:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:04,797 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 5964 transitions. [2019-01-13 02:08:04,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 02:08:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 5964 transitions. [2019-01-13 02:08:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:04,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:04,801 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] [2019-01-13 02:08:04,801 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:04,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:04,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1513895995, now seen corresponding path program 3 times [2019-01-13 02:08:04,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:04,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:04,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 02:08:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:08:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:08:04,888 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 02:08:05,083 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 02:08:05,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 02:08:05 BasicIcfg [2019-01-13 02:08:05,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 02:08:05,085 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 02:08:05,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 02:08:05,086 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 02:08:05,086 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:07:36" (3/4) ... [2019-01-13 02:08:05,090 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 02:08:05,287 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 02:08:05,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 02:08:05,292 INFO L168 Benchmark]: Toolchain (without parser) took 30795.88 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -110.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-13 02:08:05,294 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 02:08:05,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 846.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-13 02:08:05,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-01-13 02:08:05,295 INFO L168 Benchmark]: Boogie Preprocessor took 42.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 02:08:05,295 INFO L168 Benchmark]: RCFGBuilder took 1170.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2019-01-13 02:08:05,295 INFO L168 Benchmark]: TraceAbstraction took 28447.79 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-13 02:08:05,298 INFO L168 Benchmark]: Witness Printer took 205.47 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2019-01-13 02:08:05,301 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 846.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1170.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28447.79 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 205.47 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=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] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=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] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=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] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=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] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L697] -1 int z = 0; VAL [__unbuffered_cnt=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, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L765] -1 pthread_t t1097; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L766] FCALL, FORK -1 pthread_create(&t1097, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L767] -1 pthread_t t1098; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L768] FCALL, FORK -1 pthread_create(&t1098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 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) [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 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 [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 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 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -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) [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -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 [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 28.3s OverallTime, 21 OverallIterations, 1 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4288 SDtfs, 4007 SDslu, 9346 SDs, 0 SdLazy, 3089 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 82546 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1665 NumberOfCodeBlocks, 1665 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1549 ConstructedInterpolants, 0 QuantifiedInterpolants, 309275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...