./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix056_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix056_tso.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 bb399b49d562562005292857f055e3a5f2e4f47f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 22:30:02,423 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:30:02,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:30:02,439 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:30:02,439 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:30:02,440 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:30:02,442 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:30:02,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:30:02,446 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:30:02,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:30:02,447 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:30:02,448 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:30:02,449 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:30:02,450 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:30:02,451 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:30:02,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:30:02,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:30:02,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:30:02,457 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:30:02,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:30:02,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:30:02,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:30:02,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:30:02,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:30:02,465 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:30:02,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:30:02,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:30:02,468 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:30:02,469 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:30:02,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:30:02,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:30:02,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:30:02,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:30:02,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:30:02,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:30:02,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:30:02,474 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:30:02,492 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:30:02,493 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:30:02,494 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:30:02,494 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:30:02,494 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:30:02,495 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:30:02,495 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:30:02,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:30:02,495 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:30:02,496 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:30:02,496 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:30:02,496 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:30:02,496 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:30:02,496 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:30:02,497 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:30:02,497 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:30:02,497 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:30:02,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:30:02,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:30:02,498 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:30:02,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:30:02,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:30:02,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:30:02,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:30:02,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:30:02,499 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:30:02,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:30:02,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:30:02,500 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 -> bb399b49d562562005292857f055e3a5f2e4f47f [2018-12-31 22:30:02,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:30:02,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:30:02,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:30:02,564 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:30:02,564 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:30:02,565 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix056_tso.opt_false-unreach-call.i [2018-12-31 22:30:02,639 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af525f3f/1e3307eaee2b4015beeff3f0f11e2ee9/FLAG0f7059851 [2018-12-31 22:30:03,253 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:30:03,254 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix056_tso.opt_false-unreach-call.i [2018-12-31 22:30:03,282 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af525f3f/1e3307eaee2b4015beeff3f0f11e2ee9/FLAG0f7059851 [2018-12-31 22:30:03,489 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af525f3f/1e3307eaee2b4015beeff3f0f11e2ee9 [2018-12-31 22:30:03,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:30:03,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:30:03,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:30:03,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:30:03,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:30:03,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:30:03" (1/1) ... [2018-12-31 22:30:03,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a35997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:03, skipping insertion in model container [2018-12-31 22:30:03,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:30:03" (1/1) ... [2018-12-31 22:30:03,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:30:03,601 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:30:04,160 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:30:04,191 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:30:04,343 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:30:04,423 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:30:04,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04 WrapperNode [2018-12-31 22:30:04,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:30:04,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:30:04,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:30:04,425 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:30:04,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04" (1/1) ... [2018-12-31 22:30:04,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04" (1/1) ... [2018-12-31 22:30:04,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:30:04,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:30:04,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:30:04,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:30:04,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04" (1/1) ... [2018-12-31 22:30:04,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04" (1/1) ... [2018-12-31 22:30:04,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04" (1/1) ... [2018-12-31 22:30:04,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04" (1/1) ... [2018-12-31 22:30:04,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04" (1/1) ... [2018-12-31 22:30:04,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04" (1/1) ... [2018-12-31 22:30:04,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04" (1/1) ... [2018-12-31 22:30:04,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:30:04,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:30:04,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:30:04,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:30:04,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:30:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:30:04,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:30:04,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:30:04,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:30:04,651 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:30:04,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:30:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:30:04,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:30:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-31 22:30:04,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-31 22:30:04,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:30:04,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:30:04,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:30:04,655 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 22:30:05,932 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:30:05,933 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:30:05,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:30:05 BoogieIcfgContainer [2018-12-31 22:30:05,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:30:05,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:30:05,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:30:05,940 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:30:05,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:30:03" (1/3) ... [2018-12-31 22:30:05,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f516dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:30:05, skipping insertion in model container [2018-12-31 22:30:05,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:30:04" (2/3) ... [2018-12-31 22:30:05,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f516dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:30:05, skipping insertion in model container [2018-12-31 22:30:05,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:30:05" (3/3) ... [2018-12-31 22:30:05,946 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_tso.opt_false-unreach-call.i [2018-12-31 22:30:05,999 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:05,999 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,000 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,000 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,006 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,006 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,008 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,008 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,008 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,008 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,009 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,009 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,009 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,009 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,012 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,013 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,013 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,013 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,013 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,016 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,016 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,016 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,017 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,017 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,021 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,021 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,021 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,021 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,022 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,022 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,022 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,022 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,022 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,023 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,023 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,023 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,023 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,024 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,024 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,024 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,024 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,024 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,025 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,025 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:30:06,047 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:30:06,047 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:30:06,058 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:30:06,078 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:30:06,106 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:30:06,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:30:06,107 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:30:06,107 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:30:06,107 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:30:06,107 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:30:06,108 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:30:06,108 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:30:06,108 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:30:06,124 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-31 22:30:31,119 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-31 22:30:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-31 22:30:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 22:30:31,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:30:31,139 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] [2018-12-31 22:30:31,142 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:30:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:30:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-31 22:30:31,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:30:31,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:30:31,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:30:31,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:30:31,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:30:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:30:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:30:31,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:30:31,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:30:31,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:30:31,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:30:31,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:30:31,630 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-31 22:30:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:30:34,576 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-31 22:30:34,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:30:34,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-31 22:30:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:30:36,396 INFO L225 Difference]: With dead ends: 233472 [2018-12-31 22:30:36,397 INFO L226 Difference]: Without dead ends: 203722 [2018-12-31 22:30:36,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:30:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-31 22:30:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-31 22:30:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-31 22:30:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-31 22:30:50,290 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-31 22:30:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:30:50,292 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-31 22:30:50,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:30:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-31 22:30:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 22:30:50,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:30:50,309 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] [2018-12-31 22:30:50,309 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:30:50,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:30:50,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-31 22:30:50,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:30:50,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:30:50,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:30:50,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:30:50,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:30:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:30:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:30:50,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:30:50,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:30:50,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:30:50,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:30:50,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:30:50,471 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 5 states. [2018-12-31 22:30:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:30:54,304 INFO L93 Difference]: Finished difference Result 325272 states and 1470479 transitions. [2018-12-31 22:30:54,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:30:54,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-31 22:30:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:30:55,751 INFO L225 Difference]: With dead ends: 325272 [2018-12-31 22:30:55,751 INFO L226 Difference]: Without dead ends: 324272 [2018-12-31 22:30:55,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:31:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-31 22:31:12,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-31 22:31:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-31 22:31:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 842874 transitions. [2018-12-31 22:31:13,472 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 842874 transitions. Word has length 50 [2018-12-31 22:31:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:31:13,473 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 842874 transitions. [2018-12-31 22:31:13,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:31:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 842874 transitions. [2018-12-31 22:31:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 22:31:13,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:31:13,484 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] [2018-12-31 22:31:13,484 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:31:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:31:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-31 22:31:13,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:31:13,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:31:13,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:31:13,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:31:13,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:31:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:31:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:31:13,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:31:13,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:31:13,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:31:13,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:31:13,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:31:13,593 INFO L87 Difference]: Start difference. First operand 186422 states and 842874 transitions. Second operand 3 states. [2018-12-31 22:31:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:31:14,858 INFO L93 Difference]: Finished difference Result 186422 states and 842759 transitions. [2018-12-31 22:31:14,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:31:14,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-31 22:31:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:31:15,719 INFO L225 Difference]: With dead ends: 186422 [2018-12-31 22:31:15,719 INFO L226 Difference]: Without dead ends: 186422 [2018-12-31 22:31:15,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:31:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186422 states. [2018-12-31 22:31:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186422 to 186422. [2018-12-31 22:31:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-31 22:31:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 842759 transitions. [2018-12-31 22:31:23,107 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 842759 transitions. Word has length 51 [2018-12-31 22:31:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:31:23,108 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 842759 transitions. [2018-12-31 22:31:23,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:31:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 842759 transitions. [2018-12-31 22:31:23,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 22:31:23,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:31:23,117 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] [2018-12-31 22:31:23,118 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:31:23,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:31:23,118 INFO L82 PathProgramCache]: Analyzing trace with hash -873971028, now seen corresponding path program 1 times [2018-12-31 22:31:23,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:31:23,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:31:23,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:31:23,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:31:23,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:31:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:31:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:31:23,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:31:23,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:31:23,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:31:23,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:31:23,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:31:23,261 INFO L87 Difference]: Start difference. First operand 186422 states and 842759 transitions. Second operand 5 states. [2018-12-31 22:31:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:31:32,591 INFO L93 Difference]: Finished difference Result 334052 states and 1503038 transitions. [2018-12-31 22:31:32,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:31:32,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-31 22:31:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:31:35,357 INFO L225 Difference]: With dead ends: 334052 [2018-12-31 22:31:35,358 INFO L226 Difference]: Without dead ends: 333002 [2018-12-31 22:31:35,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:31:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333002 states. [2018-12-31 22:31:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333002 to 194882. [2018-12-31 22:31:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194882 states. [2018-12-31 22:31:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194882 states to 194882 states and 878067 transitions. [2018-12-31 22:31:44,485 INFO L78 Accepts]: Start accepts. Automaton has 194882 states and 878067 transitions. Word has length 51 [2018-12-31 22:31:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:31:44,486 INFO L480 AbstractCegarLoop]: Abstraction has 194882 states and 878067 transitions. [2018-12-31 22:31:44,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:31:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 194882 states and 878067 transitions. [2018-12-31 22:31:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-31 22:31:44,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:31:44,527 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] [2018-12-31 22:31:44,527 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:31:44,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:31:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash 340354422, now seen corresponding path program 1 times [2018-12-31 22:31:44,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:31:44,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:31:44,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:31:44,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:31:44,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:31:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:31:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:31:44,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:31:44,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:31:44,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:31:44,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:31:44,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:31:44,691 INFO L87 Difference]: Start difference. First operand 194882 states and 878067 transitions. Second operand 4 states. [2018-12-31 22:31:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:31:47,997 INFO L93 Difference]: Finished difference Result 172218 states and 762613 transitions. [2018-12-31 22:31:47,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:31:47,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-31 22:31:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:31:48,636 INFO L225 Difference]: With dead ends: 172218 [2018-12-31 22:31:48,637 INFO L226 Difference]: Without dead ends: 169613 [2018-12-31 22:31:48,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:31:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169613 states. [2018-12-31 22:32:01,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169613 to 169613. [2018-12-31 22:32:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169613 states. [2018-12-31 22:32:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169613 states to 169613 states and 753931 transitions. [2018-12-31 22:32:03,107 INFO L78 Accepts]: Start accepts. Automaton has 169613 states and 753931 transitions. Word has length 58 [2018-12-31 22:32:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:03,108 INFO L480 AbstractCegarLoop]: Abstraction has 169613 states and 753931 transitions. [2018-12-31 22:32:03,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:32:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 169613 states and 753931 transitions. [2018-12-31 22:32:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 22:32:03,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:03,143 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] [2018-12-31 22:32:03,143 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:03,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1409834262, now seen corresponding path program 1 times [2018-12-31 22:32:03,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:03,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:03,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:03,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:03,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:03,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:03,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:32:03,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:32:03,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:32:03,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:32:03,380 INFO L87 Difference]: Start difference. First operand 169613 states and 753931 transitions. Second operand 5 states. [2018-12-31 22:32:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:03,708 INFO L93 Difference]: Finished difference Result 59117 states and 239411 transitions. [2018-12-31 22:32:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:32:03,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-31 22:32:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:03,857 INFO L225 Difference]: With dead ends: 59117 [2018-12-31 22:32:03,858 INFO L226 Difference]: Without dead ends: 56805 [2018-12-31 22:32:03,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:32:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56805 states. [2018-12-31 22:32:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56805 to 56805. [2018-12-31 22:32:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56805 states. [2018-12-31 22:32:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56805 states to 56805 states and 230749 transitions. [2018-12-31 22:32:04,960 INFO L78 Accepts]: Start accepts. Automaton has 56805 states and 230749 transitions. Word has length 59 [2018-12-31 22:32:04,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:04,960 INFO L480 AbstractCegarLoop]: Abstraction has 56805 states and 230749 transitions. [2018-12-31 22:32:04,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:32:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 56805 states and 230749 transitions. [2018-12-31 22:32:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 22:32:04,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:04,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:04,976 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:04,976 INFO L82 PathProgramCache]: Analyzing trace with hash 503624572, now seen corresponding path program 1 times [2018-12-31 22:32:04,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:04,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:04,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:04,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:04,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:05,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:05,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:32:05,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:32:05,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:32:05,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:32:05,152 INFO L87 Difference]: Start difference. First operand 56805 states and 230749 transitions. Second operand 4 states. [2018-12-31 22:32:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:06,130 INFO L93 Difference]: Finished difference Result 78969 states and 316074 transitions. [2018-12-31 22:32:06,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:32:06,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-31 22:32:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:08,012 INFO L225 Difference]: With dead ends: 78969 [2018-12-31 22:32:08,012 INFO L226 Difference]: Without dead ends: 78969 [2018-12-31 22:32:08,012 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 [2018-12-31 22:32:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78969 states. [2018-12-31 22:32:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78969 to 61561. [2018-12-31 22:32:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61561 states. [2018-12-31 22:32:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61561 states to 61561 states and 248442 transitions. [2018-12-31 22:32:09,331 INFO L78 Accepts]: Start accepts. Automaton has 61561 states and 248442 transitions. Word has length 65 [2018-12-31 22:32:09,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:09,331 INFO L480 AbstractCegarLoop]: Abstraction has 61561 states and 248442 transitions. [2018-12-31 22:32:09,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:32:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 61561 states and 248442 transitions. [2018-12-31 22:32:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 22:32:09,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:09,352 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] [2018-12-31 22:32:09,352 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:09,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:09,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2048532389, now seen corresponding path program 1 times [2018-12-31 22:32:09,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:09,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:09,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:09,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:09,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:32:09,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:32:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:32:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:32:09,549 INFO L87 Difference]: Start difference. First operand 61561 states and 248442 transitions. Second operand 6 states. [2018-12-31 22:32:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:09,660 INFO L93 Difference]: Finished difference Result 12217 states and 41898 transitions. [2018-12-31 22:32:09,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:32:09,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-31 22:32:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:09,683 INFO L225 Difference]: With dead ends: 12217 [2018-12-31 22:32:09,683 INFO L226 Difference]: Without dead ends: 10505 [2018-12-31 22:32:09,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:32:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10505 states. [2018-12-31 22:32:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10505 to 9990. [2018-12-31 22:32:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9990 states. [2018-12-31 22:32:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9990 states to 9990 states and 34202 transitions. [2018-12-31 22:32:09,837 INFO L78 Accepts]: Start accepts. Automaton has 9990 states and 34202 transitions. Word has length 65 [2018-12-31 22:32:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:09,838 INFO L480 AbstractCegarLoop]: Abstraction has 9990 states and 34202 transitions. [2018-12-31 22:32:09,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:32:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 9990 states and 34202 transitions. [2018-12-31 22:32:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 22:32:09,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:09,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:09,857 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:09,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:09,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1199736739, now seen corresponding path program 1 times [2018-12-31 22:32:09,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:09,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:09,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:09,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:09,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:10,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:10,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:32:10,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:32:10,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:32:10,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:32:10,023 INFO L87 Difference]: Start difference. First operand 9990 states and 34202 transitions. Second operand 3 states. [2018-12-31 22:32:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:10,484 INFO L93 Difference]: Finished difference Result 10410 states and 35483 transitions. [2018-12-31 22:32:10,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:32:10,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-31 22:32:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:10,504 INFO L225 Difference]: With dead ends: 10410 [2018-12-31 22:32:10,505 INFO L226 Difference]: Without dead ends: 10410 [2018-12-31 22:32:10,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:32:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10410 states. [2018-12-31 22:32:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10410 to 10180. [2018-12-31 22:32:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10180 states. [2018-12-31 22:32:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10180 states to 10180 states and 34784 transitions. [2018-12-31 22:32:10,666 INFO L78 Accepts]: Start accepts. Automaton has 10180 states and 34784 transitions. Word has length 98 [2018-12-31 22:32:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:10,666 INFO L480 AbstractCegarLoop]: Abstraction has 10180 states and 34784 transitions. [2018-12-31 22:32:10,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:32:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 10180 states and 34784 transitions. [2018-12-31 22:32:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 22:32:10,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:10,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:10,686 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:10,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2015703874, now seen corresponding path program 1 times [2018-12-31 22:32:10,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:10,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:10,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:10,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:10,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:10,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:10,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:32:10,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:32:10,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:32:10,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:32:10,823 INFO L87 Difference]: Start difference. First operand 10180 states and 34784 transitions. Second operand 5 states. [2018-12-31 22:32:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:11,177 INFO L93 Difference]: Finished difference Result 12325 states and 41500 transitions. [2018-12-31 22:32:11,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:32:11,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-31 22:32:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:11,202 INFO L225 Difference]: With dead ends: 12325 [2018-12-31 22:32:11,202 INFO L226 Difference]: Without dead ends: 12325 [2018-12-31 22:32:11,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:32:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12325 states. [2018-12-31 22:32:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12325 to 10625. [2018-12-31 22:32:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10625 states. [2018-12-31 22:32:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 36150 transitions. [2018-12-31 22:32:11,599 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 36150 transitions. Word has length 98 [2018-12-31 22:32:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:11,600 INFO L480 AbstractCegarLoop]: Abstraction has 10625 states and 36150 transitions. [2018-12-31 22:32:11,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:32:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 36150 transitions. [2018-12-31 22:32:11,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 22:32:11,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:11,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:11,616 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:11,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2023463233, now seen corresponding path program 2 times [2018-12-31 22:32:11,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:11,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:11,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:11,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:11,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:11,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:11,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:32:11,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:32:11,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:32:11,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:32:11,828 INFO L87 Difference]: Start difference. First operand 10625 states and 36150 transitions. Second operand 4 states. [2018-12-31 22:32:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:12,291 INFO L93 Difference]: Finished difference Result 15705 states and 53547 transitions. [2018-12-31 22:32:12,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:32:12,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-31 22:32:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:12,324 INFO L225 Difference]: With dead ends: 15705 [2018-12-31 22:32:12,324 INFO L226 Difference]: Without dead ends: 15705 [2018-12-31 22:32:12,325 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 [2018-12-31 22:32:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15705 states. [2018-12-31 22:32:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15705 to 10835. [2018-12-31 22:32:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10835 states. [2018-12-31 22:32:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10835 states to 10835 states and 36788 transitions. [2018-12-31 22:32:12,541 INFO L78 Accepts]: Start accepts. Automaton has 10835 states and 36788 transitions. Word has length 98 [2018-12-31 22:32:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:12,541 INFO L480 AbstractCegarLoop]: Abstraction has 10835 states and 36788 transitions. [2018-12-31 22:32:12,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:32:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 10835 states and 36788 transitions. [2018-12-31 22:32:12,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 22:32:12,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:12,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:12,559 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:12,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2078773641, now seen corresponding path program 1 times [2018-12-31 22:32:12,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:12,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:12,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:12,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:32:12,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:12,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:12,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:32:12,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:32:12,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:32:12,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:32:12,734 INFO L87 Difference]: Start difference. First operand 10835 states and 36788 transitions. Second operand 4 states. [2018-12-31 22:32:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:13,060 INFO L93 Difference]: Finished difference Result 19887 states and 67479 transitions. [2018-12-31 22:32:13,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:32:13,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-31 22:32:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:13,109 INFO L225 Difference]: With dead ends: 19887 [2018-12-31 22:32:13,109 INFO L226 Difference]: Without dead ends: 19887 [2018-12-31 22:32:13,110 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 [2018-12-31 22:32:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19887 states. [2018-12-31 22:32:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19887 to 10585. [2018-12-31 22:32:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10585 states. [2018-12-31 22:32:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10585 states to 10585 states and 35653 transitions. [2018-12-31 22:32:13,343 INFO L78 Accepts]: Start accepts. Automaton has 10585 states and 35653 transitions. Word has length 100 [2018-12-31 22:32:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:13,343 INFO L480 AbstractCegarLoop]: Abstraction has 10585 states and 35653 transitions. [2018-12-31 22:32:13,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:32:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 10585 states and 35653 transitions. [2018-12-31 22:32:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 22:32:13,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:13,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:13,360 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:13,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash 513813606, now seen corresponding path program 1 times [2018-12-31 22:32:13,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:13,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:13,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:13,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:13,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:13,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:13,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:32:13,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:32:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:32:13,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:32:13,587 INFO L87 Difference]: Start difference. First operand 10585 states and 35653 transitions. Second operand 6 states. [2018-12-31 22:32:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:14,295 INFO L93 Difference]: Finished difference Result 12645 states and 42081 transitions. [2018-12-31 22:32:14,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:32:14,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-31 22:32:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:14,320 INFO L225 Difference]: With dead ends: 12645 [2018-12-31 22:32:14,320 INFO L226 Difference]: Without dead ends: 12645 [2018-12-31 22:32:14,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:32:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12645 states. [2018-12-31 22:32:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12645 to 10930. [2018-12-31 22:32:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10930 states. [2018-12-31 22:32:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10930 states to 10930 states and 36774 transitions. [2018-12-31 22:32:14,504 INFO L78 Accepts]: Start accepts. Automaton has 10930 states and 36774 transitions. Word has length 100 [2018-12-31 22:32:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:14,504 INFO L480 AbstractCegarLoop]: Abstraction has 10930 states and 36774 transitions. [2018-12-31 22:32:14,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:32:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 10930 states and 36774 transitions. [2018-12-31 22:32:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 22:32:14,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:14,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, 1, 1, 1, 1] [2018-12-31 22:32:14,525 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:14,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1483394629, now seen corresponding path program 1 times [2018-12-31 22:32:14,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:14,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:14,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:14,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:14,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:32:14,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:32:14,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:32:14,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:32:14,751 INFO L87 Difference]: Start difference. First operand 10930 states and 36774 transitions. Second operand 6 states. [2018-12-31 22:32:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:15,096 INFO L93 Difference]: Finished difference Result 10209 states and 34039 transitions. [2018-12-31 22:32:15,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:32:15,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-31 22:32:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:15,116 INFO L225 Difference]: With dead ends: 10209 [2018-12-31 22:32:15,116 INFO L226 Difference]: Without dead ends: 10209 [2018-12-31 22:32:15,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:32:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10209 states. [2018-12-31 22:32:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10209 to 9860. [2018-12-31 22:32:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9860 states. [2018-12-31 22:32:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 33018 transitions. [2018-12-31 22:32:15,274 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 33018 transitions. Word has length 100 [2018-12-31 22:32:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:15,274 INFO L480 AbstractCegarLoop]: Abstraction has 9860 states and 33018 transitions. [2018-12-31 22:32:15,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:32:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 33018 transitions. [2018-12-31 22:32:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 22:32:15,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:15,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:15,291 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:15,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:15,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1210375560, now seen corresponding path program 1 times [2018-12-31 22:32:15,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:15,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:15,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:15,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:15,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:15,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:15,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:32:15,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:32:15,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:32:15,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:32:15,441 INFO L87 Difference]: Start difference. First operand 9860 states and 33018 transitions. Second operand 6 states. [2018-12-31 22:32:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:15,938 INFO L93 Difference]: Finished difference Result 11240 states and 36827 transitions. [2018-12-31 22:32:15,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:32:15,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-31 22:32:15,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:15,958 INFO L225 Difference]: With dead ends: 11240 [2018-12-31 22:32:15,959 INFO L226 Difference]: Without dead ends: 10885 [2018-12-31 22:32:15,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:32:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10885 states. [2018-12-31 22:32:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10885 to 10310. [2018-12-31 22:32:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10310 states. [2018-12-31 22:32:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10310 states to 10310 states and 34213 transitions. [2018-12-31 22:32:16,126 INFO L78 Accepts]: Start accepts. Automaton has 10310 states and 34213 transitions. Word has length 100 [2018-12-31 22:32:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:16,127 INFO L480 AbstractCegarLoop]: Abstraction has 10310 states and 34213 transitions. [2018-12-31 22:32:16,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:32:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 10310 states and 34213 transitions. [2018-12-31 22:32:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 22:32:16,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:16,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:16,141 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:16,141 INFO L82 PathProgramCache]: Analyzing trace with hash 490364919, now seen corresponding path program 1 times [2018-12-31 22:32:16,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:16,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:16,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:16,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:16,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:16,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:16,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:32:16,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:32:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:32:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:32:16,808 INFO L87 Difference]: Start difference. First operand 10310 states and 34213 transitions. Second operand 7 states. [2018-12-31 22:32:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:17,152 INFO L93 Difference]: Finished difference Result 11273 states and 37309 transitions. [2018-12-31 22:32:17,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:32:17,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-31 22:32:17,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:17,186 INFO L225 Difference]: With dead ends: 11273 [2018-12-31 22:32:17,186 INFO L226 Difference]: Without dead ends: 11273 [2018-12-31 22:32:17,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:32:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11273 states. [2018-12-31 22:32:17,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11273 to 10225. [2018-12-31 22:32:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10225 states. [2018-12-31 22:32:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10225 states to 10225 states and 33965 transitions. [2018-12-31 22:32:17,362 INFO L78 Accepts]: Start accepts. Automaton has 10225 states and 33965 transitions. Word has length 100 [2018-12-31 22:32:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:17,362 INFO L480 AbstractCegarLoop]: Abstraction has 10225 states and 33965 transitions. [2018-12-31 22:32:17,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:32:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 10225 states and 33965 transitions. [2018-12-31 22:32:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 22:32:17,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:17,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:17,379 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:17,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1901244439, now seen corresponding path program 1 times [2018-12-31 22:32:17,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:17,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:17,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:17,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:17,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:17,707 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-12-31 22:32:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:17,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:17,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:32:17,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:32:17,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:32:17,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:32:17,742 INFO L87 Difference]: Start difference. First operand 10225 states and 33965 transitions. Second operand 5 states. [2018-12-31 22:32:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:18,110 INFO L93 Difference]: Finished difference Result 9433 states and 31233 transitions. [2018-12-31 22:32:18,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:32:18,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-31 22:32:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:18,130 INFO L225 Difference]: With dead ends: 9433 [2018-12-31 22:32:18,130 INFO L226 Difference]: Without dead ends: 9433 [2018-12-31 22:32:18,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:32:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9433 states. [2018-12-31 22:32:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9433 to 9248. [2018-12-31 22:32:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9248 states. [2018-12-31 22:32:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 30715 transitions. [2018-12-31 22:32:18,278 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 30715 transitions. Word has length 100 [2018-12-31 22:32:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:18,278 INFO L480 AbstractCegarLoop]: Abstraction has 9248 states and 30715 transitions. [2018-12-31 22:32:18,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:32:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 30715 transitions. [2018-12-31 22:32:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 22:32:18,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:18,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:18,293 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:18,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash -34415848, now seen corresponding path program 1 times [2018-12-31 22:32:18,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:18,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:18,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:18,692 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 22:32:19,170 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 22:32:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:19,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:19,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:32:19,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:32:19,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:32:19,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:32:19,203 INFO L87 Difference]: Start difference. First operand 9248 states and 30715 transitions. Second operand 6 states. [2018-12-31 22:32:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:19,899 INFO L93 Difference]: Finished difference Result 8096 states and 26267 transitions. [2018-12-31 22:32:19,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:32:19,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-31 22:32:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:19,915 INFO L225 Difference]: With dead ends: 8096 [2018-12-31 22:32:19,915 INFO L226 Difference]: Without dead ends: 8096 [2018-12-31 22:32:19,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:32:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2018-12-31 22:32:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6671. [2018-12-31 22:32:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6671 states. [2018-12-31 22:32:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 21861 transitions. [2018-12-31 22:32:20,025 INFO L78 Accepts]: Start accepts. Automaton has 6671 states and 21861 transitions. Word has length 100 [2018-12-31 22:32:20,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:20,025 INFO L480 AbstractCegarLoop]: Abstraction has 6671 states and 21861 transitions. [2018-12-31 22:32:20,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:32:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 6671 states and 21861 transitions. [2018-12-31 22:32:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 22:32:20,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:20,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:20,036 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:20,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:20,036 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-31 22:32:20,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:20,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:20,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:20,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:20,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:32:20,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:32:20,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:32:20,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:32:20,270 INFO L87 Difference]: Start difference. First operand 6671 states and 21861 transitions. Second operand 7 states. [2018-12-31 22:32:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:21,016 INFO L93 Difference]: Finished difference Result 12218 states and 39640 transitions. [2018-12-31 22:32:21,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 22:32:21,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-31 22:32:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:21,040 INFO L225 Difference]: With dead ends: 12218 [2018-12-31 22:32:21,040 INFO L226 Difference]: Without dead ends: 12218 [2018-12-31 22:32:21,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 22:32:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12218 states. [2018-12-31 22:32:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12218 to 9653. [2018-12-31 22:32:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9653 states. [2018-12-31 22:32:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 31719 transitions. [2018-12-31 22:32:21,199 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 31719 transitions. Word has length 102 [2018-12-31 22:32:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:21,200 INFO L480 AbstractCegarLoop]: Abstraction has 9653 states and 31719 transitions. [2018-12-31 22:32:21,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:32:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 31719 transitions. [2018-12-31 22:32:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 22:32:21,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:21,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:21,214 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-31 22:32:21,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:21,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:21,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:21,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:21,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:21,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:21,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:32:21,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:32:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:32:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:32:21,374 INFO L87 Difference]: Start difference. First operand 9653 states and 31719 transitions. Second operand 6 states. [2018-12-31 22:32:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:21,632 INFO L93 Difference]: Finished difference Result 9843 states and 32066 transitions. [2018-12-31 22:32:21,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:32:21,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-31 22:32:21,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:21,651 INFO L225 Difference]: With dead ends: 9843 [2018-12-31 22:32:21,651 INFO L226 Difference]: Without dead ends: 9843 [2018-12-31 22:32:21,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:32:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9843 states. [2018-12-31 22:32:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9843 to 9578. [2018-12-31 22:32:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-31 22:32:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 31339 transitions. [2018-12-31 22:32:21,805 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 31339 transitions. Word has length 102 [2018-12-31 22:32:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:21,806 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 31339 transitions. [2018-12-31 22:32:21,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:32:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 31339 transitions. [2018-12-31 22:32:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 22:32:21,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:21,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:21,819 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:21,819 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-31 22:32:21,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:21,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:22,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:22,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:32:22,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:32:22,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:32:22,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:32:22,020 INFO L87 Difference]: Start difference. First operand 9578 states and 31339 transitions. Second operand 6 states. [2018-12-31 22:32:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:22,799 INFO L93 Difference]: Finished difference Result 12122 states and 38989 transitions. [2018-12-31 22:32:22,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:32:22,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-31 22:32:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:22,825 INFO L225 Difference]: With dead ends: 12122 [2018-12-31 22:32:22,825 INFO L226 Difference]: Without dead ends: 12122 [2018-12-31 22:32:22,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:32:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12122 states. [2018-12-31 22:32:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12122 to 9828. [2018-12-31 22:32:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9828 states. [2018-12-31 22:32:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9828 states to 9828 states and 31959 transitions. [2018-12-31 22:32:23,006 INFO L78 Accepts]: Start accepts. Automaton has 9828 states and 31959 transitions. Word has length 102 [2018-12-31 22:32:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:23,007 INFO L480 AbstractCegarLoop]: Abstraction has 9828 states and 31959 transitions. [2018-12-31 22:32:23,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:32:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 9828 states and 31959 transitions. [2018-12-31 22:32:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 22:32:23,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:23,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:23,023 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash -668679505, now seen corresponding path program 1 times [2018-12-31 22:32:23,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:23,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:23,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:23,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:23,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:23,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:23,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:32:23,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:32:23,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:32:23,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:32:23,207 INFO L87 Difference]: Start difference. First operand 9828 states and 31959 transitions. Second operand 5 states. [2018-12-31 22:32:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:23,494 INFO L93 Difference]: Finished difference Result 11108 states and 36119 transitions. [2018-12-31 22:32:23,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:32:23,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-31 22:32:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:23,520 INFO L225 Difference]: With dead ends: 11108 [2018-12-31 22:32:23,520 INFO L226 Difference]: Without dead ends: 11108 [2018-12-31 22:32:23,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:32:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11108 states. [2018-12-31 22:32:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11108 to 8660. [2018-12-31 22:32:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8660 states. [2018-12-31 22:32:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 28270 transitions. [2018-12-31 22:32:23,675 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 28270 transitions. Word has length 102 [2018-12-31 22:32:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:23,675 INFO L480 AbstractCegarLoop]: Abstraction has 8660 states and 28270 transitions. [2018-12-31 22:32:23,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:32:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 28270 transitions. [2018-12-31 22:32:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 22:32:23,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:23,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:23,687 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:23,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:23,687 INFO L82 PathProgramCache]: Analyzing trace with hash 576084976, now seen corresponding path program 1 times [2018-12-31 22:32:23,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:23,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:23,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:23,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:23,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:24,038 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 22:32:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:24,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:24,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:32:24,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:32:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:32:24,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:32:24,119 INFO L87 Difference]: Start difference. First operand 8660 states and 28270 transitions. Second operand 10 states. [2018-12-31 22:32:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:24,777 INFO L93 Difference]: Finished difference Result 16320 states and 53691 transitions. [2018-12-31 22:32:24,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:32:24,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-31 22:32:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:24,794 INFO L225 Difference]: With dead ends: 16320 [2018-12-31 22:32:24,794 INFO L226 Difference]: Without dead ends: 8000 [2018-12-31 22:32:24,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-31 22:32:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8000 states. [2018-12-31 22:32:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8000 to 8000. [2018-12-31 22:32:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8000 states. [2018-12-31 22:32:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8000 states to 8000 states and 26334 transitions. [2018-12-31 22:32:24,910 INFO L78 Accepts]: Start accepts. Automaton has 8000 states and 26334 transitions. Word has length 102 [2018-12-31 22:32:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:24,911 INFO L480 AbstractCegarLoop]: Abstraction has 8000 states and 26334 transitions. [2018-12-31 22:32:24,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:32:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 8000 states and 26334 transitions. [2018-12-31 22:32:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 22:32:24,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:24,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:24,922 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:24,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1577961002, now seen corresponding path program 2 times [2018-12-31 22:32:24,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:24,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:24,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:24,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:24,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:25,163 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 22:32:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:25,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:25,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:32:25,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:32:25,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:32:25,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:32:25,684 INFO L87 Difference]: Start difference. First operand 8000 states and 26334 transitions. Second operand 7 states. [2018-12-31 22:32:26,452 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 22:32:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:26,467 INFO L93 Difference]: Finished difference Result 14610 states and 48913 transitions. [2018-12-31 22:32:26,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:32:26,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-31 22:32:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:26,482 INFO L225 Difference]: With dead ends: 14610 [2018-12-31 22:32:26,482 INFO L226 Difference]: Without dead ends: 6821 [2018-12-31 22:32:26,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:32:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-12-31 22:32:26,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 6821. [2018-12-31 22:32:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6821 states. [2018-12-31 22:32:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 23131 transitions. [2018-12-31 22:32:26,581 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 23131 transitions. Word has length 102 [2018-12-31 22:32:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:26,581 INFO L480 AbstractCegarLoop]: Abstraction has 6821 states and 23131 transitions. [2018-12-31 22:32:26,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:32:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 23131 transitions. [2018-12-31 22:32:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 22:32:26,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:26,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:26,593 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:26,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1340703688, now seen corresponding path program 1 times [2018-12-31 22:32:26,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:26,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:26,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:26,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:32:26,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:26,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:26,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:32:26,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:32:26,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:32:26,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:32:26,905 INFO L87 Difference]: Start difference. First operand 6821 states and 23131 transitions. Second operand 7 states. [2018-12-31 22:32:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:27,381 INFO L93 Difference]: Finished difference Result 8957 states and 29585 transitions. [2018-12-31 22:32:27,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:32:27,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-31 22:32:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:27,399 INFO L225 Difference]: With dead ends: 8957 [2018-12-31 22:32:27,399 INFO L226 Difference]: Without dead ends: 8821 [2018-12-31 22:32:27,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:32:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2018-12-31 22:32:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 6805. [2018-12-31 22:32:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6805 states. [2018-12-31 22:32:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6805 states to 6805 states and 23039 transitions. [2018-12-31 22:32:27,519 INFO L78 Accepts]: Start accepts. Automaton has 6805 states and 23039 transitions. Word has length 102 [2018-12-31 22:32:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:27,519 INFO L480 AbstractCegarLoop]: Abstraction has 6805 states and 23039 transitions. [2018-12-31 22:32:27,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:32:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 6805 states and 23039 transitions. [2018-12-31 22:32:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 22:32:27,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:27,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:27,530 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:27,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1018603321, now seen corresponding path program 1 times [2018-12-31 22:32:27,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:27,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:27,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:27,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:27,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:27,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:27,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:32:27,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:32:27,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:32:27,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:32:27,815 INFO L87 Difference]: Start difference. First operand 6805 states and 23039 transitions. Second operand 5 states. [2018-12-31 22:32:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:27,873 INFO L93 Difference]: Finished difference Result 6805 states and 22971 transitions. [2018-12-31 22:32:27,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:32:27,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-31 22:32:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:27,888 INFO L225 Difference]: With dead ends: 6805 [2018-12-31 22:32:27,888 INFO L226 Difference]: Without dead ends: 6805 [2018-12-31 22:32:27,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:32:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2018-12-31 22:32:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 6789. [2018-12-31 22:32:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6789 states. [2018-12-31 22:32:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 22927 transitions. [2018-12-31 22:32:27,991 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 22927 transitions. Word has length 102 [2018-12-31 22:32:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:27,991 INFO L480 AbstractCegarLoop]: Abstraction has 6789 states and 22927 transitions. [2018-12-31 22:32:27,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:32:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 22927 transitions. [2018-12-31 22:32:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 22:32:28,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:28,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:28,003 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:28,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:28,003 INFO L82 PathProgramCache]: Analyzing trace with hash -682137158, now seen corresponding path program 3 times [2018-12-31 22:32:28,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:28,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:28,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:32:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:32:28,250 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 22:32:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:32:28,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:32:28,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 22:32:28,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 22:32:28,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 22:32:28,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:32:28,449 INFO L87 Difference]: Start difference. First operand 6789 states and 22927 transitions. Second operand 12 states. [2018-12-31 22:32:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:32:29,121 INFO L93 Difference]: Finished difference Result 13177 states and 44650 transitions. [2018-12-31 22:32:29,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 22:32:29,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-31 22:32:29,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:32:29,141 INFO L225 Difference]: With dead ends: 13177 [2018-12-31 22:32:29,141 INFO L226 Difference]: Without dead ends: 9273 [2018-12-31 22:32:29,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-31 22:32:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2018-12-31 22:32:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 8665. [2018-12-31 22:32:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2018-12-31 22:32:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 28570 transitions. [2018-12-31 22:32:29,285 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 28570 transitions. Word has length 102 [2018-12-31 22:32:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:32:29,285 INFO L480 AbstractCegarLoop]: Abstraction has 8665 states and 28570 transitions. [2018-12-31 22:32:29,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 22:32:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 28570 transitions. [2018-12-31 22:32:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-31 22:32:29,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:32:29,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:32:29,300 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:32:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:32:29,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1406537120, now seen corresponding path program 4 times [2018-12-31 22:32:29,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:32:29,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:32:29,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:29,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:32:29,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:32:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:32:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:32:29,396 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:32:29,649 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:32:29,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:32:29 BasicIcfg [2018-12-31 22:32:29,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:32:29,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:32:29,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:32:29,653 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:32:29,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:30:05" (3/4) ... [2018-12-31 22:32:29,658 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:32:29,872 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:32:29,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:32:29,875 INFO L168 Benchmark]: Toolchain (without parser) took 146380.98 ms. Allocated memory was 1.0 GB in the beginning and 7.4 GB in the end (delta: 6.4 GB). Free memory was 947.3 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-31 22:32:29,877 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:32:29,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 927.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-31 22:32:29,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:32:29,886 INFO L168 Benchmark]: Boogie Preprocessor took 45.12 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. [2018-12-31 22:32:29,887 INFO L168 Benchmark]: RCFGBuilder took 1375.23 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: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2018-12-31 22:32:29,887 INFO L168 Benchmark]: TraceAbstraction took 143717.41 ms. Allocated memory was 1.2 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-12-31 22:32:29,888 INFO L168 Benchmark]: Witness Printer took 219.25 ms. Allocated memory is still 7.4 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 67.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. [2018-12-31 22:32:29,893 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.18 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 927.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.12 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 1375.23 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: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 143717.41 ms. Allocated memory was 1.2 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 219.25 ms. Allocated memory is still 7.4 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 67.4 MB). Peak memory consumption was 67.4 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t1512; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t1512, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1513; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1513, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1514; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1514, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 y$w_buff1 = y$w_buff0 [L740] 0 y$w_buff0 = 2 [L741] 0 y$w_buff1_used = y$w_buff0_used [L742] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 0 y$r_buff0_thd3 = (_Bool)1 [L751] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] 1 z = 1 [L707] 1 x = 1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 2 x = 2 [L722] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L754] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L732] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L795] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L796] -1 y$flush_delayed = weak$$choice2 [L797] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L804] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y = y$flush_delayed ? y$mem_tmp : y [L807] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 143.5s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 41.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6078 SDtfs, 5829 SDslu, 13840 SDs, 0 SdLazy, 4673 SolverSat, 285 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 81 SyntacticMatches, 16 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194882occurred 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: 68.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 410334 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 2456 NumberOfCodeBlocks, 2456 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2327 ConstructedInterpolants, 0 QuantifiedInterpolants, 499631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...