./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.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 e96094309f833c5561ddfbc57c8146bf40ed5806 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 04:31:48,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 04:31:48,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 04:31:48,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 04:31:48,411 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 04:31:48,412 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 04:31:48,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 04:31:48,415 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 04:31:48,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 04:31:48,418 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 04:31:48,419 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 04:31:48,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 04:31:48,420 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 04:31:48,421 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 04:31:48,422 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 04:31:48,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 04:31:48,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 04:31:48,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 04:31:48,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 04:31:48,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 04:31:48,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 04:31:48,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 04:31:48,435 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 04:31:48,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 04:31:48,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 04:31:48,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 04:31:48,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 04:31:48,444 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 04:31:48,445 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 04:31:48,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 04:31:48,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 04:31:48,447 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 04:31:48,447 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 04:31:48,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 04:31:48,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 04:31:48,449 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 04:31:48,449 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 04:31:48,464 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 04:31:48,464 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 04:31:48,465 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 04:31:48,466 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 04:31:48,466 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 04:31:48,466 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 04:31:48,466 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 04:31:48,466 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 04:31:48,466 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 04:31:48,467 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 04:31:48,467 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 04:31:48,467 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 04:31:48,467 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 04:31:48,467 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 04:31:48,467 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 04:31:48,468 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 04:31:48,468 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 04:31:48,468 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 04:31:48,468 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 04:31:48,468 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 04:31:48,469 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 04:31:48,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 04:31:48,469 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 04:31:48,469 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 04:31:48,469 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 04:31:48,469 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 04:31:48,470 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 04:31:48,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 04:31:48,470 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 -> e96094309f833c5561ddfbc57c8146bf40ed5806 [2019-01-13 04:31:48,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 04:31:48,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 04:31:48,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 04:31:48,525 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 04:31:48,525 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 04:31:48,527 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.opt_false-unreach-call.i [2019-01-13 04:31:48,591 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5e6df2f/5a6cadfe6f2d40499c127a076c8fe1d4/FLAG7081c7420 [2019-01-13 04:31:49,055 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 04:31:49,056 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.opt_false-unreach-call.i [2019-01-13 04:31:49,072 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5e6df2f/5a6cadfe6f2d40499c127a076c8fe1d4/FLAG7081c7420 [2019-01-13 04:31:49,360 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5e6df2f/5a6cadfe6f2d40499c127a076c8fe1d4 [2019-01-13 04:31:49,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 04:31:49,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 04:31:49,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 04:31:49,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 04:31:49,371 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 04:31:49,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 04:31:49" (1/1) ... [2019-01-13 04:31:49,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60404f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:49, skipping insertion in model container [2019-01-13 04:31:49,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 04:31:49" (1/1) ... [2019-01-13 04:31:49,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 04:31:49,473 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 04:31:49,970 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 04:31:49,989 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 04:31:50,142 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 04:31:50,218 INFO L195 MainTranslator]: Completed translation [2019-01-13 04:31:50,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50 WrapperNode [2019-01-13 04:31:50,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 04:31:50,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 04:31:50,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 04:31:50,221 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 04:31:50,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50" (1/1) ... [2019-01-13 04:31:50,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50" (1/1) ... [2019-01-13 04:31:50,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 04:31:50,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 04:31:50,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 04:31:50,295 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 04:31:50,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50" (1/1) ... [2019-01-13 04:31:50,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50" (1/1) ... [2019-01-13 04:31:50,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50" (1/1) ... [2019-01-13 04:31:50,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50" (1/1) ... [2019-01-13 04:31:50,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50" (1/1) ... [2019-01-13 04:31:50,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50" (1/1) ... [2019-01-13 04:31:50,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50" (1/1) ... [2019-01-13 04:31:50,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 04:31:50,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 04:31:50,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 04:31:50,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 04:31:50,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 04:31:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 04:31:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 04:31:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 04:31:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 04:31:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 04:31:50,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 04:31:50,409 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 04:31:50,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 04:31:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 04:31:50,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 04:31:50,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 04:31:50,413 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 04:31:51,514 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 04:31:51,515 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 04:31:51,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:31:51 BoogieIcfgContainer [2019-01-13 04:31:51,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 04:31:51,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 04:31:51,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 04:31:51,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 04:31:51,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 04:31:49" (1/3) ... [2019-01-13 04:31:51,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f558fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 04:31:51, skipping insertion in model container [2019-01-13 04:31:51,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:50" (2/3) ... [2019-01-13 04:31:51,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f558fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 04:31:51, skipping insertion in model container [2019-01-13 04:31:51,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:31:51" (3/3) ... [2019-01-13 04:31:51,530 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_rmo.opt_false-unreach-call.i [2019-01-13 04:31:51,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,583 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,584 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,584 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,584 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,585 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,585 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,588 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,588 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,588 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,588 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,590 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,590 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,590 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,590 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,590 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,593 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,593 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:51,620 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 04:31:51,621 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 04:31:51,629 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 04:31:51,645 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 04:31:51,667 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 04:31:51,667 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 04:31:51,668 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 04:31:51,668 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 04:31:51,668 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 04:31:51,668 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 04:31:51,668 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 04:31:51,668 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 04:31:51,669 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 04:31:51,682 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2019-01-13 04:31:53,358 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25103 states. [2019-01-13 04:31:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 25103 states. [2019-01-13 04:31:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 04:31:53,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:53,367 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] [2019-01-13 04:31:53,369 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash -969782754, now seen corresponding path program 1 times [2019-01-13 04:31:53,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:53,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:53,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:53,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:53,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:53,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:53,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:53,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:53,781 INFO L87 Difference]: Start difference. First operand 25103 states. Second operand 4 states. [2019-01-13 04:31:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:54,613 INFO L93 Difference]: Finished difference Result 45395 states and 177649 transitions. [2019-01-13 04:31:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:31:54,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-01-13 04:31:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:55,019 INFO L225 Difference]: With dead ends: 45395 [2019-01-13 04:31:55,019 INFO L226 Difference]: Without dead ends: 40635 [2019-01-13 04:31:55,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40635 states. [2019-01-13 04:31:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40635 to 23669. [2019-01-13 04:31:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23669 states. [2019-01-13 04:31:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 92566 transitions. [2019-01-13 04:31:56,488 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 92566 transitions. Word has length 32 [2019-01-13 04:31:56,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:56,489 INFO L480 AbstractCegarLoop]: Abstraction has 23669 states and 92566 transitions. [2019-01-13 04:31:56,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 92566 transitions. [2019-01-13 04:31:56,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 04:31:56,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:56,497 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] [2019-01-13 04:31:56,498 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:56,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:56,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1661840205, now seen corresponding path program 1 times [2019-01-13 04:31:56,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:56,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:56,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:56,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:56,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:56,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:56,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:56,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:56,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:56,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:56,786 INFO L87 Difference]: Start difference. First operand 23669 states and 92566 transitions. Second operand 5 states. [2019-01-13 04:31:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:59,611 INFO L93 Difference]: Finished difference Result 64837 states and 241396 transitions. [2019-01-13 04:31:59,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:31:59,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-01-13 04:31:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:59,908 INFO L225 Difference]: With dead ends: 64837 [2019-01-13 04:31:59,909 INFO L226 Difference]: Without dead ends: 64677 [2019-01-13 04:31:59,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:32:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64677 states. [2019-01-13 04:32:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64677 to 37149. [2019-01-13 04:32:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37149 states. [2019-01-13 04:32:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37149 states to 37149 states and 138311 transitions. [2019-01-13 04:32:01,716 INFO L78 Accepts]: Start accepts. Automaton has 37149 states and 138311 transitions. Word has length 43 [2019-01-13 04:32:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:01,718 INFO L480 AbstractCegarLoop]: Abstraction has 37149 states and 138311 transitions. [2019-01-13 04:32:01,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:32:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 37149 states and 138311 transitions. [2019-01-13 04:32:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 04:32:01,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:01,730 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] [2019-01-13 04:32:01,730 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:01,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1508943518, now seen corresponding path program 1 times [2019-01-13 04:32:01,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:01,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:01,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:01,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:01,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:32:01,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:32:01,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:32:01,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:32:01,971 INFO L87 Difference]: Start difference. First operand 37149 states and 138311 transitions. Second operand 4 states. [2019-01-13 04:32:02,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:02,071 INFO L93 Difference]: Finished difference Result 12371 states and 41204 transitions. [2019-01-13 04:32:02,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:32:02,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-13 04:32:02,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:02,098 INFO L225 Difference]: With dead ends: 12371 [2019-01-13 04:32:02,099 INFO L226 Difference]: Without dead ends: 11850 [2019-01-13 04:32:02,099 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 [2019-01-13 04:32:02,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2019-01-13 04:32:02,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 11850. [2019-01-13 04:32:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11850 states. [2019-01-13 04:32:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11850 states to 11850 states and 39649 transitions. [2019-01-13 04:32:02,404 INFO L78 Accepts]: Start accepts. Automaton has 11850 states and 39649 transitions. Word has length 44 [2019-01-13 04:32:02,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:02,404 INFO L480 AbstractCegarLoop]: Abstraction has 11850 states and 39649 transitions. [2019-01-13 04:32:02,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:32:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 11850 states and 39649 transitions. [2019-01-13 04:32:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 04:32:02,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:02,411 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] [2019-01-13 04:32:02,412 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:02,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:02,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1699267050, now seen corresponding path program 1 times [2019-01-13 04:32:02,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:02,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:02,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:02,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:02,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:02,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:02,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:32:02,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:32:02,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:32:02,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:32:02,608 INFO L87 Difference]: Start difference. First operand 11850 states and 39649 transitions. Second operand 4 states. [2019-01-13 04:32:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:03,090 INFO L93 Difference]: Finished difference Result 17026 states and 55724 transitions. [2019-01-13 04:32:03,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:32:03,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-13 04:32:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:03,129 INFO L225 Difference]: With dead ends: 17026 [2019-01-13 04:32:03,130 INFO L226 Difference]: Without dead ends: 17026 [2019-01-13 04:32:03,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:32:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17026 states. [2019-01-13 04:32:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17026 to 12886. [2019-01-13 04:32:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12886 states. [2019-01-13 04:32:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 42751 transitions. [2019-01-13 04:32:03,417 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 42751 transitions. Word has length 57 [2019-01-13 04:32:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:03,418 INFO L480 AbstractCegarLoop]: Abstraction has 12886 states and 42751 transitions. [2019-01-13 04:32:03,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:32:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 42751 transitions. [2019-01-13 04:32:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 04:32:03,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:03,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:03,428 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:03,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:03,428 INFO L82 PathProgramCache]: Analyzing trace with hash -852889911, now seen corresponding path program 1 times [2019-01-13 04:32:03,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:03,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:03,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:03,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:03,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:03,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:03,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:32:03,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:32:03,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:32:03,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:32:03,571 INFO L87 Difference]: Start difference. First operand 12886 states and 42751 transitions. Second operand 6 states. [2019-01-13 04:32:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:04,966 INFO L93 Difference]: Finished difference Result 18606 states and 60861 transitions. [2019-01-13 04:32:04,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 04:32:04,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-01-13 04:32:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:05,001 INFO L225 Difference]: With dead ends: 18606 [2019-01-13 04:32:05,002 INFO L226 Difference]: Without dead ends: 18574 [2019-01-13 04:32:05,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 04:32:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18574 states. [2019-01-13 04:32:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18574 to 14418. [2019-01-13 04:32:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14418 states. [2019-01-13 04:32:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14418 states to 14418 states and 47580 transitions. [2019-01-13 04:32:05,258 INFO L78 Accepts]: Start accepts. Automaton has 14418 states and 47580 transitions. Word has length 57 [2019-01-13 04:32:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:05,258 INFO L480 AbstractCegarLoop]: Abstraction has 14418 states and 47580 transitions. [2019-01-13 04:32:05,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:32:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 14418 states and 47580 transitions. [2019-01-13 04:32:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 04:32:05,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:05,287 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] [2019-01-13 04:32:05,287 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:05,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:05,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1122563706, now seen corresponding path program 1 times [2019-01-13 04:32:05,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:05,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:05,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:05,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:05,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:05,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:05,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:32:05,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:32:05,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:32:05,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:32:05,444 INFO L87 Difference]: Start difference. First operand 14418 states and 47580 transitions. Second operand 4 states. [2019-01-13 04:32:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:06,158 INFO L93 Difference]: Finished difference Result 23166 states and 75033 transitions. [2019-01-13 04:32:06,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:32:06,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-01-13 04:32:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:06,195 INFO L225 Difference]: With dead ends: 23166 [2019-01-13 04:32:06,195 INFO L226 Difference]: Without dead ends: 22990 [2019-01-13 04:32:06,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:32:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22990 states. [2019-01-13 04:32:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22990 to 19518. [2019-01-13 04:32:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19518 states. [2019-01-13 04:32:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19518 states to 19518 states and 64005 transitions. [2019-01-13 04:32:06,534 INFO L78 Accepts]: Start accepts. Automaton has 19518 states and 64005 transitions. Word has length 71 [2019-01-13 04:32:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:06,535 INFO L480 AbstractCegarLoop]: Abstraction has 19518 states and 64005 transitions. [2019-01-13 04:32:06,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:32:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 19518 states and 64005 transitions. [2019-01-13 04:32:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 04:32:06,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:06,557 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] [2019-01-13 04:32:06,558 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:06,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:06,558 INFO L82 PathProgramCache]: Analyzing trace with hash 230745991, now seen corresponding path program 1 times [2019-01-13 04:32:06,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:06,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:06,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:06,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:06,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:06,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:06,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:32:06,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:32:06,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:32:06,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:32:06,816 INFO L87 Difference]: Start difference. First operand 19518 states and 64005 transitions. Second operand 5 states. [2019-01-13 04:32:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:07,044 INFO L93 Difference]: Finished difference Result 3426 states and 9184 transitions. [2019-01-13 04:32:07,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 04:32:07,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-01-13 04:32:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:07,048 INFO L225 Difference]: With dead ends: 3426 [2019-01-13 04:32:07,049 INFO L226 Difference]: Without dead ends: 3014 [2019-01-13 04:32:07,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:32:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-01-13 04:32:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 2911. [2019-01-13 04:32:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2019-01-13 04:32:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 7787 transitions. [2019-01-13 04:32:07,078 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 7787 transitions. Word has length 71 [2019-01-13 04:32:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:07,078 INFO L480 AbstractCegarLoop]: Abstraction has 2911 states and 7787 transitions. [2019-01-13 04:32:07,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:32:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 7787 transitions. [2019-01-13 04:32:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:32:07,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:07,083 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] [2019-01-13 04:32:07,083 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:07,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1246078848, now seen corresponding path program 1 times [2019-01-13 04:32:07,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:07,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:07,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:07,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:07,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:32:07,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:32:07,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:32:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:32:07,190 INFO L87 Difference]: Start difference. First operand 2911 states and 7787 transitions. Second operand 4 states. [2019-01-13 04:32:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:07,444 INFO L93 Difference]: Finished difference Result 3948 states and 10239 transitions. [2019-01-13 04:32:07,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:32:07,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-01-13 04:32:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:07,454 INFO L225 Difference]: With dead ends: 3948 [2019-01-13 04:32:07,454 INFO L226 Difference]: Without dead ends: 3948 [2019-01-13 04:32:07,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:32:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2019-01-13 04:32:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3394. [2019-01-13 04:32:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3394 states. [2019-01-13 04:32:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 8914 transitions. [2019-01-13 04:32:07,492 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 8914 transitions. Word has length 90 [2019-01-13 04:32:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:07,493 INFO L480 AbstractCegarLoop]: Abstraction has 3394 states and 8914 transitions. [2019-01-13 04:32:07,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:32:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 8914 transitions. [2019-01-13 04:32:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:32:07,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:07,499 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] [2019-01-13 04:32:07,500 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:07,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1865541151, now seen corresponding path program 1 times [2019-01-13 04:32:07,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:07,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:07,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:07,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:07,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:07,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:07,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:32:07,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:32:07,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:32:07,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:32:07,688 INFO L87 Difference]: Start difference. First operand 3394 states and 8914 transitions. Second operand 6 states. [2019-01-13 04:32:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:07,943 INFO L93 Difference]: Finished difference Result 3602 states and 9284 transitions. [2019-01-13 04:32:07,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 04:32:07,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-01-13 04:32:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:07,949 INFO L225 Difference]: With dead ends: 3602 [2019-01-13 04:32:07,949 INFO L226 Difference]: Without dead ends: 3602 [2019-01-13 04:32:07,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 04:32:07,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2019-01-13 04:32:07,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 3372. [2019-01-13 04:32:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3372 states. [2019-01-13 04:32:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 8797 transitions. [2019-01-13 04:32:07,987 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 8797 transitions. Word has length 90 [2019-01-13 04:32:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:07,988 INFO L480 AbstractCegarLoop]: Abstraction has 3372 states and 8797 transitions. [2019-01-13 04:32:07,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:32:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 8797 transitions. [2019-01-13 04:32:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:32:08,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:08,294 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] [2019-01-13 04:32:08,294 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:08,294 INFO L82 PathProgramCache]: Analyzing trace with hash 840847230, now seen corresponding path program 1 times [2019-01-13 04:32:08,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:08,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:08,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:08,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:08,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:08,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:08,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:32:08,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:32:08,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:32:08,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:32:08,651 INFO L87 Difference]: Start difference. First operand 3372 states and 8797 transitions. Second operand 5 states. [2019-01-13 04:32:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:08,945 INFO L93 Difference]: Finished difference Result 4392 states and 11188 transitions. [2019-01-13 04:32:08,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:32:08,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-01-13 04:32:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:08,953 INFO L225 Difference]: With dead ends: 4392 [2019-01-13 04:32:08,953 INFO L226 Difference]: Without dead ends: 4392 [2019-01-13 04:32:08,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:32:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2019-01-13 04:32:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 3594. [2019-01-13 04:32:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-01-13 04:32:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 9293 transitions. [2019-01-13 04:32:09,009 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 9293 transitions. Word has length 90 [2019-01-13 04:32:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:09,009 INFO L480 AbstractCegarLoop]: Abstraction has 3594 states and 9293 transitions. [2019-01-13 04:32:09,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:32:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 9293 transitions. [2019-01-13 04:32:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:32:09,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:09,014 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] [2019-01-13 04:32:09,015 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:09,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:09,015 INFO L82 PathProgramCache]: Analyzing trace with hash 437071095, now seen corresponding path program 2 times [2019-01-13 04:32:09,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:09,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:09,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:09,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:09,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:09,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:09,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:32:09,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:32:09,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:32:09,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:32:09,237 INFO L87 Difference]: Start difference. First operand 3594 states and 9293 transitions. Second operand 4 states. [2019-01-13 04:32:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:09,857 INFO L93 Difference]: Finished difference Result 5130 states and 13284 transitions. [2019-01-13 04:32:09,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:32:09,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-01-13 04:32:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:09,865 INFO L225 Difference]: With dead ends: 5130 [2019-01-13 04:32:09,865 INFO L226 Difference]: Without dead ends: 5112 [2019-01-13 04:32:09,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:32:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5112 states. [2019-01-13 04:32:09,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5112 to 3636. [2019-01-13 04:32:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3636 states. [2019-01-13 04:32:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 9376 transitions. [2019-01-13 04:32:09,910 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 9376 transitions. Word has length 90 [2019-01-13 04:32:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:09,911 INFO L480 AbstractCegarLoop]: Abstraction has 3636 states and 9376 transitions. [2019-01-13 04:32:09,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:32:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 9376 transitions. [2019-01-13 04:32:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:32:09,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:09,916 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] [2019-01-13 04:32:09,917 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:09,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash 100591209, now seen corresponding path program 1 times [2019-01-13 04:32:09,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:09,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:09,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 04:32:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:10,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:10,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 04:32:10,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 04:32:10,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 04:32:10,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:32:10,033 INFO L87 Difference]: Start difference. First operand 3636 states and 9376 transitions. Second operand 3 states. [2019-01-13 04:32:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:10,304 INFO L93 Difference]: Finished difference Result 3688 states and 9475 transitions. [2019-01-13 04:32:10,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 04:32:10,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-01-13 04:32:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:10,310 INFO L225 Difference]: With dead ends: 3688 [2019-01-13 04:32:10,310 INFO L226 Difference]: Without dead ends: 3688 [2019-01-13 04:32:10,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:32:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2019-01-13 04:32:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3658. [2019-01-13 04:32:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3658 states. [2019-01-13 04:32:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 9410 transitions. [2019-01-13 04:32:10,354 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 9410 transitions. Word has length 90 [2019-01-13 04:32:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:10,354 INFO L480 AbstractCegarLoop]: Abstraction has 3658 states and 9410 transitions. [2019-01-13 04:32:10,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 04:32:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 9410 transitions. [2019-01-13 04:32:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:32:10,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:10,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:10,360 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:10,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1619414373, now seen corresponding path program 1 times [2019-01-13 04:32:10,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:10,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:10,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:10,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:10,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 04:32:10,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 04:32:10,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 04:32:10,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-13 04:32:10,608 INFO L87 Difference]: Start difference. First operand 3658 states and 9410 transitions. Second operand 9 states. [2019-01-13 04:32:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:12,082 INFO L93 Difference]: Finished difference Result 7294 states and 18183 transitions. [2019-01-13 04:32:12,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-13 04:32:12,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-01-13 04:32:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:12,092 INFO L225 Difference]: With dead ends: 7294 [2019-01-13 04:32:12,092 INFO L226 Difference]: Without dead ends: 7262 [2019-01-13 04:32:12,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-01-13 04:32:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7262 states. [2019-01-13 04:32:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7262 to 4934. [2019-01-13 04:32:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4934 states. [2019-01-13 04:32:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 12543 transitions. [2019-01-13 04:32:12,152 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 12543 transitions. Word has length 92 [2019-01-13 04:32:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:12,152 INFO L480 AbstractCegarLoop]: Abstraction has 4934 states and 12543 transitions. [2019-01-13 04:32:12,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 04:32:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 12543 transitions. [2019-01-13 04:32:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:32:12,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:12,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:12,159 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1430788442, now seen corresponding path program 1 times [2019-01-13 04:32:12,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:12,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:12,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:12,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:12,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:12,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:12,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:32:12,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:32:12,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:32:12,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:32:12,371 INFO L87 Difference]: Start difference. First operand 4934 states and 12543 transitions. Second operand 7 states. [2019-01-13 04:32:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:13,362 INFO L93 Difference]: Finished difference Result 8015 states and 20164 transitions. [2019-01-13 04:32:13,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 04:32:13,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 04:32:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:13,372 INFO L225 Difference]: With dead ends: 8015 [2019-01-13 04:32:13,372 INFO L226 Difference]: Without dead ends: 7764 [2019-01-13 04:32:13,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:32:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7764 states. [2019-01-13 04:32:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7764 to 5020. [2019-01-13 04:32:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5020 states. [2019-01-13 04:32:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 12633 transitions. [2019-01-13 04:32:13,435 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 12633 transitions. Word has length 92 [2019-01-13 04:32:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:13,435 INFO L480 AbstractCegarLoop]: Abstraction has 5020 states and 12633 transitions. [2019-01-13 04:32:13,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:32:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 12633 transitions. [2019-01-13 04:32:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:32:13,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:13,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:13,443 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1693857927, now seen corresponding path program 1 times [2019-01-13 04:32:13,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:13,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:13,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:13,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:13,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:13,855 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 04:32:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:14,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:14,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:32:14,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:32:14,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:32:14,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:32:14,006 INFO L87 Difference]: Start difference. First operand 5020 states and 12633 transitions. Second operand 6 states. [2019-01-13 04:32:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:14,154 INFO L93 Difference]: Finished difference Result 3809 states and 9705 transitions. [2019-01-13 04:32:14,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:32:14,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 04:32:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:14,162 INFO L225 Difference]: With dead ends: 3809 [2019-01-13 04:32:14,162 INFO L226 Difference]: Without dead ends: 3809 [2019-01-13 04:32:14,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:32:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2019-01-13 04:32:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3597. [2019-01-13 04:32:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2019-01-13 04:32:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 9242 transitions. [2019-01-13 04:32:14,200 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 9242 transitions. Word has length 92 [2019-01-13 04:32:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:14,200 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 9242 transitions. [2019-01-13 04:32:14,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:32:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 9242 transitions. [2019-01-13 04:32:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:32:14,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:14,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:14,206 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:14,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:14,206 INFO L82 PathProgramCache]: Analyzing trace with hash -64252365, now seen corresponding path program 1 times [2019-01-13 04:32:14,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:14,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:14,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:14,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:14,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:15,061 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2019-01-13 04:32:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:15,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:15,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 04:32:15,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 04:32:15,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 04:32:15,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:32:15,249 INFO L87 Difference]: Start difference. First operand 3597 states and 9242 transitions. Second operand 8 states. [2019-01-13 04:32:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:16,019 INFO L93 Difference]: Finished difference Result 4654 states and 11807 transitions. [2019-01-13 04:32:16,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 04:32:16,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-01-13 04:32:16,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:16,026 INFO L225 Difference]: With dead ends: 4654 [2019-01-13 04:32:16,026 INFO L226 Difference]: Without dead ends: 4622 [2019-01-13 04:32:16,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-13 04:32:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-01-13 04:32:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 3732. [2019-01-13 04:32:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2019-01-13 04:32:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 9517 transitions. [2019-01-13 04:32:16,073 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 9517 transitions. Word has length 92 [2019-01-13 04:32:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:16,073 INFO L480 AbstractCegarLoop]: Abstraction has 3732 states and 9517 transitions. [2019-01-13 04:32:16,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 04:32:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 9517 transitions. [2019-01-13 04:32:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:32:16,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:16,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:16,082 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:16,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:16,083 INFO L82 PathProgramCache]: Analyzing trace with hash 897361652, now seen corresponding path program 1 times [2019-01-13 04:32:16,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:16,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:16,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:16,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:16,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:16,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:16,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:32:16,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:32:16,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:32:16,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:32:16,258 INFO L87 Difference]: Start difference. First operand 3732 states and 9517 transitions. Second operand 7 states. [2019-01-13 04:32:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:16,676 INFO L93 Difference]: Finished difference Result 4887 states and 12337 transitions. [2019-01-13 04:32:16,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:32:16,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 04:32:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:16,684 INFO L225 Difference]: With dead ends: 4887 [2019-01-13 04:32:16,685 INFO L226 Difference]: Without dead ends: 4887 [2019-01-13 04:32:16,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:32:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states. [2019-01-13 04:32:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4052. [2019-01-13 04:32:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4052 states. [2019-01-13 04:32:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4052 states to 4052 states and 10367 transitions. [2019-01-13 04:32:16,743 INFO L78 Accepts]: Start accepts. Automaton has 4052 states and 10367 transitions. Word has length 92 [2019-01-13 04:32:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:16,744 INFO L480 AbstractCegarLoop]: Abstraction has 4052 states and 10367 transitions. [2019-01-13 04:32:16,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:32:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4052 states and 10367 transitions. [2019-01-13 04:32:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:32:16,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:16,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:16,752 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:16,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2142126133, now seen corresponding path program 1 times [2019-01-13 04:32:16,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:16,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:16,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:16,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:16,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:16,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:16,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:32:16,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:32:16,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:32:16,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:32:16,963 INFO L87 Difference]: Start difference. First operand 4052 states and 10367 transitions. Second operand 5 states. [2019-01-13 04:32:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:17,010 INFO L93 Difference]: Finished difference Result 5996 states and 15588 transitions. [2019-01-13 04:32:17,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:32:17,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-01-13 04:32:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:17,017 INFO L225 Difference]: With dead ends: 5996 [2019-01-13 04:32:17,018 INFO L226 Difference]: Without dead ends: 5996 [2019-01-13 04:32:17,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:32:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2019-01-13 04:32:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3732. [2019-01-13 04:32:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2019-01-13 04:32:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 9430 transitions. [2019-01-13 04:32:17,064 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 9430 transitions. Word has length 92 [2019-01-13 04:32:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:17,064 INFO L480 AbstractCegarLoop]: Abstraction has 3732 states and 9430 transitions. [2019-01-13 04:32:17,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:32:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 9430 transitions. [2019-01-13 04:32:17,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:32:17,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:17,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:17,069 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:17,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:17,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1672124747, now seen corresponding path program 1 times [2019-01-13 04:32:17,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:17,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:17,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:17,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:17,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:17,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:17,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:32:17,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:32:17,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:32:17,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:32:17,368 INFO L87 Difference]: Start difference. First operand 3732 states and 9430 transitions. Second operand 6 states. [2019-01-13 04:32:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:17,590 INFO L93 Difference]: Finished difference Result 3300 states and 8142 transitions. [2019-01-13 04:32:17,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:32:17,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 04:32:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:17,595 INFO L225 Difference]: With dead ends: 3300 [2019-01-13 04:32:17,595 INFO L226 Difference]: Without dead ends: 3300 [2019-01-13 04:32:17,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:32:17,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2019-01-13 04:32:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2619. [2019-01-13 04:32:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2019-01-13 04:32:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 6636 transitions. [2019-01-13 04:32:17,633 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 6636 transitions. Word has length 92 [2019-01-13 04:32:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:17,633 INFO L480 AbstractCegarLoop]: Abstraction has 2619 states and 6636 transitions. [2019-01-13 04:32:17,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:32:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 6636 transitions. [2019-01-13 04:32:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:32:17,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:17,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:17,637 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:17,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1613356635, now seen corresponding path program 1 times [2019-01-13 04:32:17,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:17,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:17,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:17,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:18,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:18,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:32:18,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:32:18,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:32:18,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:32:18,008 INFO L87 Difference]: Start difference. First operand 2619 states and 6636 transitions. Second operand 5 states. [2019-01-13 04:32:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:18,248 INFO L93 Difference]: Finished difference Result 2971 states and 7500 transitions. [2019-01-13 04:32:18,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:32:18,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 04:32:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:18,253 INFO L225 Difference]: With dead ends: 2971 [2019-01-13 04:32:18,253 INFO L226 Difference]: Without dead ends: 2939 [2019-01-13 04:32:18,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:32:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2019-01-13 04:32:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2667. [2019-01-13 04:32:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2019-01-13 04:32:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 6740 transitions. [2019-01-13 04:32:18,293 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 6740 transitions. Word has length 94 [2019-01-13 04:32:18,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:18,293 INFO L480 AbstractCegarLoop]: Abstraction has 2667 states and 6740 transitions. [2019-01-13 04:32:18,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:32:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 6740 transitions. [2019-01-13 04:32:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:32:18,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:18,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:18,298 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:18,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:18,299 INFO L82 PathProgramCache]: Analyzing trace with hash -368592154, now seen corresponding path program 1 times [2019-01-13 04:32:18,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:18,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:18,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:18,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:18,533 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 04:32:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:18,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:18,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 04:32:18,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 04:32:18,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 04:32:18,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:32:18,632 INFO L87 Difference]: Start difference. First operand 2667 states and 6740 transitions. Second operand 12 states. [2019-01-13 04:32:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:19,550 INFO L93 Difference]: Finished difference Result 4454 states and 11424 transitions. [2019-01-13 04:32:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 04:32:19,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-01-13 04:32:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:19,557 INFO L225 Difference]: With dead ends: 4454 [2019-01-13 04:32:19,557 INFO L226 Difference]: Without dead ends: 3478 [2019-01-13 04:32:19,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-13 04:32:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2019-01-13 04:32:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 3198. [2019-01-13 04:32:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2019-01-13 04:32:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 7987 transitions. [2019-01-13 04:32:19,828 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 7987 transitions. Word has length 94 [2019-01-13 04:32:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:19,828 INFO L480 AbstractCegarLoop]: Abstraction has 3198 states and 7987 transitions. [2019-01-13 04:32:19,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 04:32:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 7987 transitions. [2019-01-13 04:32:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:32:19,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:19,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:19,834 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:19,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:19,834 INFO L82 PathProgramCache]: Analyzing trace with hash -822908468, now seen corresponding path program 2 times [2019-01-13 04:32:19,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:19,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:19,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:19,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:19,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:32:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:32:19,927 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 04:32:20,094 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 04:32:20,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 04:32:20 BasicIcfg [2019-01-13 04:32:20,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 04:32:20,098 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 04:32:20,098 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 04:32:20,099 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 04:32:20,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:31:51" (3/4) ... [2019-01-13 04:32:20,104 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 04:32:20,293 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 04:32:20,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 04:32:20,296 INFO L168 Benchmark]: Toolchain (without parser) took 30931.18 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 951.4 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 422.8 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:20,300 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 04:32:20,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 852.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:20,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:20,301 INFO L168 Benchmark]: Boogie Preprocessor took 46.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 04:32:20,301 INFO L168 Benchmark]: RCFGBuilder took 1175.03 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: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:20,302 INFO L168 Benchmark]: TraceAbstraction took 28580.27 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -957.3 MB). Peak memory consumption was 364.9 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:20,302 INFO L168 Benchmark]: Witness Printer took 196.76 ms. Allocated memory is still 2.5 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:20,316 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.19 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 852.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.45 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 1175.03 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: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28580.27 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -957.3 MB). Peak memory consumption was 364.9 MB. Max. memory is 11.5 GB. * Witness Printer took 196.76 ms. Allocated memory is still 2.5 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2021; VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2021, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 2 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] -1 pthread_t t2022; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] FCALL, FORK -1 pthread_create(&t2022, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 __unbuffered_p1_EAX = x [L730] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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=2] [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L715] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L717] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -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) [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -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 [L767] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L768] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -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 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 y$flush_delayed = weak$$choice2 [L774] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -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) [L776] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -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)) [L777] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -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)) [L778] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -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)) [L779] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -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)) [L780] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -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)) [L781] 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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -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)) [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y = y$flush_delayed ? y$mem_tmp : y [L784] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 28.4s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4848 SDtfs, 4662 SDslu, 11312 SDs, 0 SdLazy, 4578 SolverSat, 324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 72 SyntacticMatches, 12 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37149occurred in iteration=2, 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: 5.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 69959 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1751 NumberOfCodeBlocks, 1751 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1636 ConstructedInterpolants, 0 QuantifiedInterpolants, 361840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...